Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200363.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 6.0K Mar 5 14:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 14:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 597K Mar 3 18:30 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 ASLink-PT-06a-LTLCardinality-00
FORMULA_NAME ASLink-PT-06a-LTLCardinality-01
FORMULA_NAME ASLink-PT-06a-LTLCardinality-02
FORMULA_NAME ASLink-PT-06a-LTLCardinality-03
FORMULA_NAME ASLink-PT-06a-LTLCardinality-04
FORMULA_NAME ASLink-PT-06a-LTLCardinality-05
FORMULA_NAME ASLink-PT-06a-LTLCardinality-06
FORMULA_NAME ASLink-PT-06a-LTLCardinality-07
FORMULA_NAME ASLink-PT-06a-LTLCardinality-08
FORMULA_NAME ASLink-PT-06a-LTLCardinality-09
FORMULA_NAME ASLink-PT-06a-LTLCardinality-10
FORMULA_NAME ASLink-PT-06a-LTLCardinality-11
FORMULA_NAME ASLink-PT-06a-LTLCardinality-12
FORMULA_NAME ASLink-PT-06a-LTLCardinality-13
FORMULA_NAME ASLink-PT-06a-LTLCardinality-14
FORMULA_NAME ASLink-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779478090983

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 19:28:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:28:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:28:12] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2026-05-22 19:28:12] [INFO ] Transformed 1406 places.
[2026-05-22 19:28:12] [INFO ] Transformed 2100 transitions.
[2026-05-22 19:28:12] [INFO ] Found NUPN structural information;
[2026-05-22 19:28:12] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1370 transition count 2078
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 1360 transition count 2030
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 1360 transition count 2030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 1360 transition count 2029
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1359 transition count 2021
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1359 transition count 2021
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1358 transition count 2013
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1358 transition count 2013
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1357 transition count 2005
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1357 transition count 2005
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1356 transition count 1997
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1356 transition count 1997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1355 transition count 1989
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1355 transition count 1989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1354 transition count 1981
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1354 transition count 1981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1353 transition count 1973
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1353 transition count 1973
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1352 transition count 1965
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1352 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1351 transition count 1957
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1351 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1350 transition count 1949
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1350 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1349 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1349 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1348 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1348 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1347 transition count 1925
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1347 transition count 1925
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1346 transition count 1917
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1346 transition count 1917
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1345 transition count 1909
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1345 transition count 1909
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1344 transition count 1901
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1344 transition count 1901
Applied a total of 89 rules in 1173 ms. Remains 1344 /1406 variables (removed 62) and now considering 1901/2078 (removed 177) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15071155213769321024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8133238839507774952.kers'
[2026-05-22 19:28:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15071155213769321024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8133238839507774952.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1901 rows 1344 cols 7078 entries
Finished phase 1 with 538 SingleSign rule and 572 generalized
[2026-05-22 19:28:14] [INFO ] Computed 234 invariants in 38 ms
Computed 234 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-8133238839507774952.kers
Total runtime 45 ms.
[2026-05-22 19:28:16] [INFO ] Implicit Places using invariants in 1833 ms returned [1, 19, 20, 21, 24, 35, 53, 71, 201, 221, 222, 223, 241, 259, 388, 404, 409, 410, 411, 429, 447, 576, 592, 597, 598, 599, 617, 635, 764, 780, 785, 786, 787, 805, 823, 952, 968, 973, 974, 975, 993, 1011, 1140, 1145, 1157, 1162, 1163, 1164, 1182, 1184, 1187, 1205, 1206, 1207, 1208, 1225, 1233, 1241, 1247, 1253, 1259, 1265, 1273, 1279, 1285, 1293]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1888 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1278/1406 places, 1901/2078 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1265 transition count 1888
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1265 transition count 1888
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1255 transition count 1878
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1255 transition count 1878
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1250 transition count 1873
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1250 transition count 1873
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1248 transition count 1871
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1248 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1246 transition count 1869
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1246 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1245 transition count 1868
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1245 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1244 transition count 1867
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1244 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1243 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1243 transition count 1866
Applied a total of 70 rules in 628 ms. Remains 1243 /1278 variables (removed 35) and now considering 1866/1901 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-257010681059653754.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2203603809982861986.kers'
[2026-05-22 19:28:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-257010681059653754.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2203603809982861986.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1866 rows 1243 cols 6483 entries
Finished phase 1 with 820 SingleSign rule and 255 generalized
[2026-05-22 19:28:16] [INFO ] Computed 168 invariants in 12 ms
Computed 168 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-2203603809982861986.kers
Total runtime 15 ms.
[2026-05-22 19:28:17] [INFO ] Implicit Places using invariants in 994 ms returned []
[2026-05-22 19:28:17] [INFO ] Invariant cache hit.
[2026-05-22 19:28:20] [INFO ] Implicit Places using invariants and state equation in 2919 ms returned []
Implicit Place search using SMT with State Equation took 3937 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1243/1406 places, 1866/2078 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7646 ms. Remains : 1243/1406 places, 1866/2078 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Applied a total of 0 rules in 43 ms. Remains 1243 /1243 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2026-05-22 19:28:20] [INFO ] Invariant cache hit.
[2026-05-22 19:28:21] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2026-05-22 19:28:21] [INFO ] Invariant cache hit.
[2026-05-22 19:28:24] [INFO ] Implicit Places using invariants and state equation in 2644 ms returned []
Implicit Place search using SMT with State Equation took 3799 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2026-05-22 19:28:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 1865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1242/3109 variables, and 130 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 130/138 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 1865/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1242 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 1865 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1242/3109 variables, and 130 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 130/138 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 0/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60897ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60937ms
Finished structural reductions in LTL mode , in 1 iterations and 64849 ms. Remains : 1243/1243 places, 1866/1866 transitions.
Support contains 19 out of 1243 places after structural reductions.
[2026-05-22 19:29:25] [INFO ] Flatten gal took : 194 ms
[2026-05-22 19:29:26] [INFO ] Flatten gal took : 111 ms
[2026-05-22 19:29:26] [INFO ] Input system was already deterministic with 1866 transitions.
RANDOM walk for 40000 steps (226 resets) in 1581 ms. (25 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40002 steps (29 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (27 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (29 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
[2026-05-22 19:29:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 306/536 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 707/1243 variables, 138/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1866/3109 variables, 1243/1411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3109 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3109 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3109/3109 variables, and 1411 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 306/536 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 707/1243 variables, 138/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1866/3109 variables, 1243/1411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3109 variables, 3/1414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3109/3109 variables, and 1414 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6341ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1243 transition count 1628
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 479 place count 1005 transition count 1625
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 482 place count 1003 transition count 1624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 1002 transition count 1624
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 164 Pre rules applied. Total rules applied 483 place count 1002 transition count 1460
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 4 with 381 rules applied. Total rules applied 864 place count 785 transition count 1460
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 882 place count 776 transition count 1451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 891 place count 767 transition count 1451
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 891 place count 767 transition count 1427
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 939 place count 743 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 944 place count 738 transition count 1422
Iterating global reduction 6 with 5 rules applied. Total rules applied 949 place count 738 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 953 place count 738 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 954 place count 737 transition count 1418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 954 place count 737 transition count 1417
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 956 place count 736 transition count 1417
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 8 with 134 rules applied. Total rules applied 1090 place count 669 transition count 1350
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1095 place count 669 transition count 1345
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1100 place count 664 transition count 1345
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1124 place count 664 transition count 1321
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1149 place count 639 transition count 1321
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1153 place count 639 transition count 1317
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 1172 place count 639 transition count 1317
Applied a total of 1172 rules in 487 ms. Remains 639 /1243 variables (removed 604) and now considering 1317/1866 (removed 549) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 639/1243 places, 1317/1866 transitions.
RANDOM walk for 40000 steps (530 resets) in 581 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (95 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (95 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (94 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 557765 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :2 out of 3
Probabilistic random walk after 557765 steps, saw 125056 distinct states, run finished after 3014 ms. (steps per millisecond=185 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3772947233989905977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16566125032772400433.kers'
[2026-05-22 19:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3772947233989905977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16566125032772400433.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 2 ms.
// Phase 1: matrix 1317 rows 635 cols 5529 entries
Finished phase 1 with 242 SingleSign rule and 292 generalized
[2026-05-22 19:29:37] [INFO ] Computed 105 invariants in 27 ms
Computed 105 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-16566125032772400433.kers
Total runtime 32 ms.
[2026-05-22 19:29:37] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/389 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/639 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1317/1956 variables, 639/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1956 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1956 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 769 constraints, problems are : Problem set: 0 solved, 1 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 639/639 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/389 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/639 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1317/1956 variables, 639/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1956 variables, 25/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1956 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1956/1956 variables, and 770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 639/639 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5695ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 2 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1317/1317 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 639 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 638 transition count 1316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 637 transition count 1315
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 637 transition count 1314
Applied a total of 5 rules in 67 ms. Remains 637 /639 variables (removed 2) and now considering 1314/1317 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 637/639 places, 1314/1317 transitions.
RANDOM walk for 40000 steps (537 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (102 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533669 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533669 steps, saw 120593 distinct states, run finished after 3014 ms. (steps per millisecond=177 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7613388336316799851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5819151480070269072.kers'
[2026-05-22 19:29:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7613388336316799851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5819151480070269072.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 2 ms.
// Phase 1: matrix 1314 rows 631 cols 5515 entries
Finished phase 1 with 240 SingleSign rule and 292 generalized
[2026-05-22 19:29:46] [INFO ] Computed 105 invariants in 27 ms
Computed 105 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-5819151480070269072.kers
Total runtime 31 ms.
[2026-05-22 19:29:46] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/387 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/637 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1314/1951 variables, 637/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 28/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1951 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1951 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1951/1951 variables, and 770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 637/637 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/387 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/637 variables, 73/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1314/1951 variables, 637/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1951 variables, 28/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1951 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1951 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1951 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1951/1951 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3139 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 637/637 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3778ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1314/1314 transitions.
Applied a total of 0 rules in 23 ms. Remains 637 /637 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 637/637 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1314/1314 transitions.
Applied a total of 0 rules in 23 ms. Remains 637 /637 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2026-05-22 19:29:50] [INFO ] Invariant cache hit.
[2026-05-22 19:29:51] [INFO ] Implicit Places using invariants in 917 ms returned [90, 96, 99, 101, 109, 116, 117, 120, 189, 195, 198, 200, 203, 210, 211, 212, 281, 287, 290, 292, 295, 302, 303, 304, 373, 379, 382, 384, 387, 394, 395, 396, 465, 471, 474, 476, 479, 486, 487, 488, 557, 563, 566, 568, 571, 584]
[2026-05-22 19:29:51] [INFO ] Actually due to overlaps returned [116, 210, 302, 394, 486, 117, 211, 303, 395, 487, 212, 304, 396, 488, 584, 120, 90, 96, 101, 189, 195, 200, 281, 287, 292, 373, 379, 384, 465, 471, 476, 557, 563, 568, 109, 203, 295, 387, 479, 571]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 921 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 597/637 places, 1314/1314 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 597 transition count 1302
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 585 transition count 1302
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 54 place count 555 transition count 1272
Iterating global reduction 0 with 30 rules applied. Total rules applied 84 place count 555 transition count 1272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 555 transition count 1266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 549 transition count 1260
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 549 transition count 1260
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 114 place count 543 transition count 1254
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 132 place count 543 transition count 1236
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 150 place count 525 transition count 1236
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 525 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 524 transition count 1235
Applied a total of 152 rules in 129 ms. Remains 524 /597 variables (removed 73) and now considering 1235/1314 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14016892331279365617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6557304805040155095.kers'
[2026-05-22 19:29:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14016892331279365617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6557304805040155095.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1235 rows 524 cols 5110 entries
Finished phase 1 with 185 SingleSign rule and 274 generalized
[2026-05-22 19:29:51] [INFO ] Computed 65 invariants in 26 ms
Computed 65 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-6557304805040155095.kers
Total runtime 28 ms.
[2026-05-22 19:29:52] [INFO ] Implicit Places using invariants in 656 ms returned [72, 94, 152, 169, 225, 242, 298, 315, 371, 388, 444, 461]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 659 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 512/637 places, 1235/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 511 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 511 transition count 1234
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 505 transition count 1228
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 505 transition count 1222
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 499 transition count 1222
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 499 transition count 1222
Applied a total of 27 rules in 96 ms. Remains 499 /512 variables (removed 13) and now considering 1222/1235 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9288713392450225203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13410124043306081296.kers'
[2026-05-22 19:29:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9288713392450225203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13410124043306081296.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1222 rows 499 cols 5008 entries
Finished phase 1 with 175 SingleSign rule and 271 generalized
[2026-05-22 19:29:52] [INFO ] Computed 53 invariants in 13 ms
Computed 53 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13410124043306081296.kers
Total runtime 15 ms.
[2026-05-22 19:29:52] [INFO ] Implicit Places using invariants in 444 ms returned []
[2026-05-22 19:29:52] [INFO ] Invariant cache hit.
[2026-05-22 19:29:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:29:54] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 499/637 places, 1222/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3631 ms. Remains : 499/637 places, 1222/1314 transitions.
RANDOM walk for 40000 steps (707 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (148 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 504276 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 504276 steps, saw 342915 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-22 19:29:57] [INFO ] Invariant cache hit.
[2026-05-22 19:29:57] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 377/382 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/499 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1222/1721 variables, 499/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1721 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1721/1721 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 499/499 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 377/382 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/499 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1222/1721 variables, 499/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12161 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 499/499 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 386 ms.
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1222/1222 transitions.
Applied a total of 0 rules in 19 ms. Remains 499 /499 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 499/499 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1222/1222 transitions.
Applied a total of 0 rules in 17 ms. Remains 499 /499 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2026-05-22 19:30:10] [INFO ] Invariant cache hit.
[2026-05-22 19:30:10] [INFO ] Implicit Places using invariants in 555 ms returned []
[2026-05-22 19:30:10] [INFO ] Invariant cache hit.
[2026-05-22 19:30:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:30:12] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2026-05-22 19:30:12] [INFO ] Redundant transitions in 97 ms returned []
Running 1221 sub problems to find dead transitions.
[2026-05-22 19:30:12] [INFO ] Invariant cache hit.
[2026-05-22 19:30:12] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1721 variables, and 24 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/499 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1721 variables, and 24 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/499 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1221 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62548 ms. Remains : 499/499 places, 1222/1222 transitions.
Computed a total of 1 stabilizing places and 1 stable 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(((p1&&G(p2))||p0))))'
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1243 transition count 1629
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 240 rules applied. Total rules applied 477 place count 1006 transition count 1626
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 481 place count 1004 transition count 1624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 483 place count 1002 transition count 1624
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 164 Pre rules applied. Total rules applied 483 place count 1002 transition count 1460
Deduced a syphon composed of 164 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 4 with 381 rules applied. Total rules applied 864 place count 785 transition count 1460
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 882 place count 776 transition count 1451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 891 place count 767 transition count 1451
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 891 place count 767 transition count 1427
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 939 place count 743 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 944 place count 738 transition count 1422
Iterating global reduction 6 with 5 rules applied. Total rules applied 949 place count 738 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 953 place count 738 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 954 place count 737 transition count 1418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 954 place count 737 transition count 1417
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 956 place count 736 transition count 1417
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 8 with 132 rules applied. Total rules applied 1088 place count 670 transition count 1351
Applied a total of 1088 rules in 177 ms. Remains 670 /1243 variables (removed 573) and now considering 1351/1866 (removed 515) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12324859874498216830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9217175859389479800.kers'
[2026-05-22 19:31:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12324859874498216830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9217175859389479800.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1351 rows 665 cols 5441 entries
Finished phase 1 with 295 SingleSign rule and 269 generalized
[2026-05-22 19:31:13] [INFO ] Computed 106 invariants in 29 ms
Computed 106 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-9217175859389479800.kers
Total runtime 30 ms.
[2026-05-22 19:31:14] [INFO ] Implicit Places using invariants in 732 ms returned [91, 97, 102, 124, 194, 200, 205, 221, 291, 297, 302, 318, 388, 394, 399, 486, 492, 497, 513, 584, 590, 595, 615, 667]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 735 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 646/1243 places, 1351/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 646 transition count 1349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 644 transition count 1349
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4 place count 644 transition count 1339
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 634 transition count 1339
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 36 place count 622 transition count 1327
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 622 transition count 1327
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 60 place count 610 transition count 1315
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 610 transition count 1315
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 604 transition count 1309
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 604 transition count 1309
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 104 place count 594 transition count 1299
Applied a total of 104 rules in 121 ms. Remains 594 /646 variables (removed 52) and now considering 1299/1351 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7647565177493654417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9876271335024834246.kers'
[2026-05-22 19:31:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7647565177493654417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9876271335024834246.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1299 rows 594 cols 5274 entries
Finished phase 1 with 267 SingleSign rule and 245 generalized
[2026-05-22 19:31:14] [INFO ] Computed 82 invariants in 8 ms
Computed 82 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9876271335024834246.kers
Total runtime 10 ms.
[2026-05-22 19:31:15] [INFO ] Implicit Places using invariants in 861 ms returned [98, 101, 184, 187, 268, 271, 441, 444, 526, 529]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 878 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/1243 places, 1299/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 584 transition count 1294
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 579 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 574 transition count 1289
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 574 transition count 1289
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 574 transition count 1284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 573 transition count 1283
Applied a total of 27 rules in 58 ms. Remains 573 /584 variables (removed 11) and now considering 1283/1299 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1228294473516051993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11898407346545645042.kers'
[2026-05-22 19:31:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1228294473516051993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11898407346545645042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1283 rows 573 cols 5146 entries
Finished phase 1 with 261 SingleSign rule and 240 generalized
[2026-05-22 19:31:15] [INFO ] Computed 72 invariants in 8 ms
Computed 72 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11898407346545645042.kers
Total runtime 13 ms.
[2026-05-22 19:31:15] [INFO ] Implicit Places using invariants in 562 ms returned [72, 158, 238, 407, 487]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 577 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 568/1243 places, 1283/1866 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 563 transition count 1278
Applied a total of 10 rules in 32 ms. Remains 563 /568 variables (removed 5) and now considering 1278/1283 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2998044286537762349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14269846141168358075.kers'
[2026-05-22 19:31:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2998044286537762349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14269846141168358075.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1278 rows 563 cols 5161 entries
Finished phase 1 with 261 SingleSign rule and 235 generalized
[2026-05-22 19:31:15] [INFO ] Computed 67 invariants in 8 ms
Computed 67 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14269846141168358075.kers
Total runtime 9 ms.
[2026-05-22 19:31:16] [INFO ] Implicit Places using invariants in 433 ms returned []
[2026-05-22 19:31:16] [INFO ] Invariant cache hit.
[2026-05-22 19:31:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:31:17] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 563/1243 places, 1278/1866 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4711 ms. Remains : 563/1243 places, 1278/1866 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(p1)&&p2)||p0))))'
Stuttering acceptance computed with spot in 452 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-05
Product exploration explored 100000 steps with 1288 reset in 367 ms.
Product exploration explored 100000 steps with 1279 reset in 372 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 13 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (515 resets) in 669 ms. (59 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (106 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (105 resets) in 147 ms. (270 steps per ms) remains 1/4 properties
[2026-05-22 19:31:19] [INFO ] Invariant cache hit.
[2026-05-22 19:31:19] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 404/409 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 154/563 variables, 40/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1278/1841 variables, 563/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1841 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1841/1841 variables, and 636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 563/563 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 404/409 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 154/563 variables, 40/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1278/1841 variables, 563/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1841/1841 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 563/563 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2358ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 1278/1278 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 563 transition count 1277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 562 transition count 1277
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 560 transition count 1275
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 560 transition count 1251
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 58 place count 536 transition count 1247
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 76 place count 536 transition count 1229
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 94 place count 518 transition count 1229
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 518 transition count 1228
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 518 transition count 1228
Applied a total of 96 rules in 166 ms. Remains 518 /563 variables (removed 45) and now considering 1228/1278 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 518/563 places, 1228/1278 transitions.
RANDOM walk for 40000 steps (694 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (140 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485918 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485918 steps, saw 163850 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10860485001573215953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15650266848661811445.kers'
[2026-05-22 19:31:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10860485001573215953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15650266848661811445.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1228 rows 517 cols 5178 entries
Finished phase 1 with 203 SingleSign rule and 248 generalized
[2026-05-22 19:31:25] [INFO ] Computed 67 invariants in 25 ms
Computed 67 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-15650266848661811445.kers
Total runtime 30 ms.
[2026-05-22 19:31:25] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/384 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/518 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1228/1746 variables, 518/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1746 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1746 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1746/1746 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 518/518 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/384 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/518 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1228/1746 variables, 518/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1746 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1746/1746 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9680 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 518/518 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10330ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1228/1228 transitions.
Applied a total of 0 rules in 47 ms. Remains 518 /518 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 518/518 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1228/1228 transitions.
Applied a total of 0 rules in 28 ms. Remains 518 /518 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2026-05-22 19:31:35] [INFO ] Invariant cache hit.
[2026-05-22 19:31:36] [INFO ] Implicit Places using invariants in 520 ms returned [94, 95, 167, 168, 238, 239, 310, 317, 318, 319, 389, 390]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 523 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 506/518 places, 1228/1228 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 506 transition count 1226
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 504 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 503 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 503 transition count 1225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 503 transition count 1224
Applied a total of 7 rules in 46 ms. Remains 503 /506 variables (removed 3) and now considering 1224/1228 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4234992131404780043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13127080476174374081.kers'
[2026-05-22 19:31:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4234992131404780043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13127080476174374081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1224 rows 503 cols 5029 entries
Finished phase 1 with 193 SingleSign rule and 255 generalized
[2026-05-22 19:31:36] [INFO ] Computed 55 invariants in 10 ms
Computed 55 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13127080476174374081.kers
Total runtime 13 ms.
[2026-05-22 19:31:36] [INFO ] Implicit Places using invariants in 512 ms returned [285, 302]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 514 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 501/518 places, 1224/1228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 500 transition count 1223
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 500 transition count 1222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 499 transition count 1222
Applied a total of 4 rules in 46 ms. Remains 499 /501 variables (removed 2) and now considering 1222/1224 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17319305093557483305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3897514597430931637.kers'
[2026-05-22 19:31:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17319305093557483305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3897514597430931637.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1222 rows 499 cols 5008 entries
Finished phase 1 with 187 SingleSign rule and 259 generalized
[2026-05-22 19:31:36] [INFO ] Computed 53 invariants in 9 ms
Computed 53 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3897514597430931637.kers
Total runtime 10 ms.
[2026-05-22 19:31:37] [INFO ] Implicit Places using invariants in 486 ms returned []
[2026-05-22 19:31:37] [INFO ] Invariant cache hit.
[2026-05-22 19:31:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:31:38] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 499/518 places, 1222/1228 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2926 ms. Remains : 499/518 places, 1222/1228 transitions.
RANDOM walk for 40000 steps (720 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (145 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475218 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475218 steps, saw 310428 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2026-05-22 19:31:41] [INFO ] Invariant cache hit.
[2026-05-22 19:31:41] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/387 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/499 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1222/1721 variables, 499/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1721 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1721/1721 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 499/499 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/387 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/499 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1222/1721 variables, 499/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5616 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 499/499 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6141ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13300 steps, including 943 resets, run visited all 1 properties in 48 ms. (steps per millisecond=277 )
Parikh walk visited 1 properties in 54 ms.
Knowledge based reduction with 13 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 29063 ms.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 1278/1278 transitions.
Applied a total of 0 rules in 51 ms. Remains 563 /563 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12294588117120746684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14933618762296607606.kers'
[2026-05-22 19:31:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12294588117120746684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14933618762296607606.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1278 rows 563 cols 5161 entries
Finished phase 1 with 261 SingleSign rule and 235 generalized
[2026-05-22 19:31:48] [INFO ] Computed 67 invariants in 25 ms
Computed 67 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-14933618762296607606.kers
Total runtime 27 ms.
[2026-05-22 19:31:49] [INFO ] Implicit Places using invariants in 606 ms returned []
[2026-05-22 19:31:49] [INFO ] Invariant cache hit.
[2026-05-22 19:31:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:31:50] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2026-05-22 19:31:50] [INFO ] Redundant transitions in 184 ms returned []
Running 1277 sub problems to find dead transitions.
[2026-05-22 19:31:50] [INFO ] Invariant cache hit.
[2026-05-22 19:31:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1841 variables, and 37 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/563 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1277/1277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1841 variables, and 37 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/563 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63004 ms. Remains : 563/563 places, 1278/1278 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 13 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (510 resets) in 498 ms. (80 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (102 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (109 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (110 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (111 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
[2026-05-22 19:32:51] [INFO ] Invariant cache hit.
[2026-05-22 19:32:51] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 100/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 305/411 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 152/563 variables, 40/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1278/1841 variables, 563/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1841 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1841/1841 variables, and 636 constraints, problems are : Problem set: 0 solved, 4 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 563/563 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 100/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 305/411 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 152/563 variables, 40/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1278/1841 variables, 563/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1841 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1841 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1841 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1841/1841 variables, and 641 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2858 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 563/563 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3702ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 1420 ms.
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 1278/1278 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 563 transition count 1254
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 52 place count 539 transition count 1250
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 71 place count 539 transition count 1231
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 90 place count 520 transition count 1231
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 520 transition count 1231
Applied a total of 91 rules in 67 ms. Remains 520 /563 variables (removed 43) and now considering 1231/1278 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 520/563 places, 1231/1278 transitions.
RANDOM walk for 40000 steps (669 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (133 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (141 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (133 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 378000 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :2 out of 3
Probabilistic random walk after 378000 steps, saw 134211 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-769085320149195564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17233683426696618736.kers'
[2026-05-22 19:33:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-769085320149195564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17233683426696618736.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1231 rows 520 cols 5181 entries
Finished phase 1 with 205 SingleSign rule and 248 generalized
[2026-05-22 19:33:00] [INFO ] Computed 67 invariants in 25 ms
Computed 67 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-17233683426696618736.kers
Total runtime 30 ms.
[2026-05-22 19:33:00] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 380/385 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/520 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1231/1751 variables, 520/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1751 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1751 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1751 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1751/1751 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 520/520 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 380/385 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/520 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1231/1751 variables, 520/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1751 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1751/1751 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7650 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 520/520 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 2 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 1231/1231 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 518 transition count 1229
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 518 transition count 1228
Applied a total of 5 rules in 46 ms. Remains 518 /520 variables (removed 2) and now considering 1228/1231 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 518/520 places, 1228/1231 transitions.
RANDOM walk for 40000 steps (662 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 398144 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 398144 steps, saw 140047 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7452017648850684592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11967570768113840111.kers'
[2026-05-22 19:33:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7452017648850684592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11967570768113840111.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1228 rows 517 cols 5178 entries
Finished phase 1 with 203 SingleSign rule and 248 generalized
[2026-05-22 19:33:11] [INFO ] Computed 67 invariants in 21 ms
Computed 67 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-11967570768113840111.kers
Total runtime 24 ms.
[2026-05-22 19:33:11] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/384 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/518 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1228/1746 variables, 518/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1746 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1746 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1746/1746 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 518/518 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 379/384 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/518 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1228/1746 variables, 518/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1746 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1746 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1746 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1746/1746 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6789 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 518/518 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 204 ms.
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1228/1228 transitions.
Applied a total of 0 rules in 15 ms. Remains 518 /518 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 518/518 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1228/1228 transitions.
Applied a total of 0 rules in 15 ms. Remains 518 /518 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2026-05-22 19:33:19] [INFO ] Invariant cache hit.
[2026-05-22 19:33:19] [INFO ] Implicit Places using invariants in 583 ms returned [94, 95, 167, 168, 238, 239, 310, 317, 318, 319, 389, 390]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 585 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 506/518 places, 1228/1228 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 506 transition count 1226
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 504 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 503 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 503 transition count 1225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 503 transition count 1224
Applied a total of 7 rules in 49 ms. Remains 503 /506 variables (removed 3) and now considering 1224/1228 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14686584901357229014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12300426133626762144.kers'
[2026-05-22 19:33:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14686584901357229014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12300426133626762144.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1224 rows 503 cols 5029 entries
Finished phase 1 with 193 SingleSign rule and 255 generalized
[2026-05-22 19:33:19] [INFO ] Computed 55 invariants in 25 ms
Computed 55 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-12300426133626762144.kers
Total runtime 26 ms.
[2026-05-22 19:33:20] [INFO ] Implicit Places using invariants in 552 ms returned [285, 302]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 555 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 501/518 places, 1224/1228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 500 transition count 1223
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 500 transition count 1222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 499 transition count 1222
Applied a total of 4 rules in 70 ms. Remains 499 /501 variables (removed 2) and now considering 1222/1224 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18143354938999683760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1102275712738220461.kers'
[2026-05-22 19:33:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18143354938999683760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1102275712738220461.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1222 rows 499 cols 5008 entries
Finished phase 1 with 187 SingleSign rule and 259 generalized
[2026-05-22 19:33:20] [INFO ] Computed 53 invariants in 24 ms
Computed 53 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-1102275712738220461.kers
Total runtime 25 ms.
[2026-05-22 19:33:21] [INFO ] Implicit Places using invariants in 648 ms returned []
[2026-05-22 19:33:21] [INFO ] Invariant cache hit.
[2026-05-22 19:33:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:33:22] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 499/518 places, 1222/1228 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3342 ms. Remains : 499/518 places, 1222/1228 transitions.
RANDOM walk for 40000 steps (725 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (148 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 364056 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 364056 steps, saw 234411 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2026-05-22 19:33:25] [INFO ] Invariant cache hit.
[2026-05-22 19:33:25] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/387 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/499 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1222/1721 variables, 499/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1721 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1721/1721 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 499/499 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/387 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 112/499 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1222/1721 variables, 499/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8637 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 499/499 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9095ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 246 ms.
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1222/1222 transitions.
Applied a total of 0 rules in 15 ms. Remains 499 /499 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 499/499 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 1222/1222 transitions.
Applied a total of 0 rules in 16 ms. Remains 499 /499 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2026-05-22 19:33:35] [INFO ] Invariant cache hit.
[2026-05-22 19:33:35] [INFO ] Implicit Places using invariants in 665 ms returned []
[2026-05-22 19:33:35] [INFO ] Invariant cache hit.
[2026-05-22 19:33:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:33:37] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2026-05-22 19:33:37] [INFO ] Redundant transitions in 27 ms returned []
Running 1221 sub problems to find dead transitions.
[2026-05-22 19:33:37] [INFO ] Invariant cache hit.
[2026-05-22 19:33:37] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1721 variables, and 24 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/499 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
SMT process timed out in 60418ms, After SMT, problems are : Problem set: 0 solved, 1221 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62646 ms. Remains : 499/499 places, 1222/1222 transitions.
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 106599 ms.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1278 reset in 266 ms.
Product exploration explored 100000 steps with 1261 reset in 258 ms.
Built C files in :
/tmp/ltsmin3208896694652546138
[2026-05-22 19:34:38] [INFO ] Computing symmetric may disable matrix : 1278 transitions.
[2026-05-22 19:34:38] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:38] [INFO ] Computing symmetric may enable matrix : 1278 transitions.
[2026-05-22 19:34:38] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:39] [INFO ] Computing Do-Not-Accords matrix : 1278 transitions.
[2026-05-22 19:34:39] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:39] [INFO ] Built C files in 363ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3208896694652546138
Running compilation step : cd /tmp/ltsmin3208896694652546138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3208896694652546138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3208896694652546138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 1278/1278 transitions.
Applied a total of 0 rules in 18 ms. Remains 563 /563 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6445287102845320505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8923545380828908798.kers'
[2026-05-22 19:34:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6445287102845320505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8923545380828908798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1278 rows 563 cols 5161 entries
Finished phase 1 with 261 SingleSign rule and 235 generalized
[2026-05-22 19:34:42] [INFO ] Computed 67 invariants in 10 ms
Computed 67 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8923545380828908798.kers
Total runtime 12 ms.
[2026-05-22 19:34:42] [INFO ] Implicit Places using invariants in 504 ms returned []
[2026-05-22 19:34:42] [INFO ] Invariant cache hit.
[2026-05-22 19:34:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:34:44] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2026-05-22 19:34:44] [INFO ] Redundant transitions in 37 ms returned []
Running 1277 sub problems to find dead transitions.
[2026-05-22 19:34:44] [INFO ] Invariant cache hit.
[2026-05-22 19:34:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1841 variables, and 37 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/563 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1277/1277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1841 variables, and 37 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/563 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60463ms problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62643 ms. Remains : 563/563 places, 1278/1278 transitions.
Built C files in :
/tmp/ltsmin13829318144965695527
[2026-05-22 19:35:44] [INFO ] Computing symmetric may disable matrix : 1278 transitions.
[2026-05-22 19:35:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:44] [INFO ] Computing symmetric may enable matrix : 1278 transitions.
[2026-05-22 19:35:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:45] [INFO ] Computing Do-Not-Accords matrix : 1278 transitions.
[2026-05-22 19:35:45] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:45] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13829318144965695527
Running compilation step : cd /tmp/ltsmin13829318144965695527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13829318144965695527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13829318144965695527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 19:35:48] [INFO ] Flatten gal took : 47 ms
[2026-05-22 19:35:48] [INFO ] Flatten gal took : 43 ms
[2026-05-22 19:35:48] [INFO ] Time to serialize gal into /tmp/LTL4898941789898986994.gal : 15 ms
[2026-05-22 19:35:48] [INFO ] Time to serialize properties into /tmp/LTL18003567797636117784.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/LTL4898941789898986994.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9115269185430492285.hoa' '-atoms' '/tmp/LTL18003567797636117784.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/LTL18003567797636117784.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9115269185430492285.hoa
Detected timeout of ITS tools.
[2026-05-22 19:36:03] [INFO ] Flatten gal took : 68 ms
[2026-05-22 19:36:03] [INFO ] Flatten gal took : 34 ms
[2026-05-22 19:36:03] [INFO ] Time to serialize gal into /tmp/LTL8385616836263882049.gal : 11 ms
[2026-05-22 19:36:03] [INFO ] Time to serialize properties into /tmp/LTL15724095060119023639.ltl : 6 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/LTL8385616836263882049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15724095060119023639.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(("((p1186==0)||(p1084==1))")||((G("((p810==0)||(p445==1))"))&&("((p855==0)||(p222==1))"))))))
Formula 0 simplified : FG(!"((p1186==0)||(p1084==1))" & (!"((p855==0)||(p222==1))" | F!"((p810==0)||(p445==1))"))
Detected timeout of ITS tools.
[2026-05-22 19:36:18] [INFO ] Flatten gal took : 27 ms
[2026-05-22 19:36:18] [INFO ] Applying decomposition
[2026-05-22 19:36:18] [INFO ] Flatten gal took : 40 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/graph7627564020967949215.txt' '-o' '/tmp/graph7627564020967949215.bin' '-w' '/tmp/graph7627564020967949215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7627564020967949215.bin' '-l' '-1' '-v' '-w' '/tmp/graph7627564020967949215.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:36:19] [INFO ] Decomposing Gal with order
[2026-05-22 19:36:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:36:19] [INFO ] Removed a total of 2534 redundant transitions.
[2026-05-22 19:36:19] [INFO ] Flatten gal took : 201 ms
[2026-05-22 19:36:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 32 ms.
[2026-05-22 19:36:19] [INFO ] Time to serialize gal into /tmp/LTL3950859769291305688.gal : 14 ms
[2026-05-22 19:36:19] [INFO ] Time to serialize properties into /tmp/LTL7321326673522470713.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/LTL3950859769291305688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7321326673522470713.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i11.u126.p1186==0)||(i12.u124.p1084==1))")||((G("((i8.u87.p810==0)||(i6.u65.p445==1))"))&&("((i7.u98.p855==0)||(i2.u28.p222...167
Formula 0 simplified : FG(!"((i11.u126.p1186==0)||(i12.u124.p1084==1))" & (!"((i7.u98.p855==0)||(i2.u28.p222==1))" | F!"((i8.u87.p810==0)||(i6.u65.p445==1)...159
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLCardinality-05 finished in 321441 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 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1242 transition count 1624
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 257 rules applied. Total rules applied 498 place count 994 transition count 1615
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 507 place count 986 transition count 1614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 985 transition count 1614
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 176 Pre rules applied. Total rules applied 508 place count 985 transition count 1438
Deduced a syphon composed of 176 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 912 place count 757 transition count 1438
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 38 rules applied. Total rules applied 950 place count 740 transition count 1417
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 971 place count 719 transition count 1417
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 971 place count 719 transition count 1393
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 1019 place count 695 transition count 1393
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1030 place count 684 transition count 1382
Iterating global reduction 6 with 11 rules applied. Total rules applied 1041 place count 684 transition count 1382
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 1051 place count 684 transition count 1372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1052 place count 683 transition count 1372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1052 place count 683 transition count 1371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1054 place count 682 transition count 1371
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 8 with 126 rules applied. Total rules applied 1180 place count 619 transition count 1308
Applied a total of 1180 rules in 169 ms. Remains 619 /1243 variables (removed 624) and now considering 1308/1866 (removed 558) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17632250556527962019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11349409910710921984.kers'
[2026-05-22 19:36:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17632250556527962019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11349409910710921984.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1308 rows 619 cols 5292 entries
Finished phase 1 with 260 SingleSign rule and 267 generalized
[2026-05-22 19:36:34] [INFO ] Computed 92 invariants in 25 ms
Computed 92 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-11349409910710921984.kers
Total runtime 29 ms.
[2026-05-22 19:36:35] [INFO ] Implicit Places using invariants in 676 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 280, 282, 342, 359, 365, 371, 373, 433, 450, 456, 461, 463, 523, 540, 546, 551, 553, 616]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 682 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/1243 places, 1308/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 1307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1307
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 577 transition count 1296
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 577 transition count 1296
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 566 transition count 1285
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 566 transition count 1285
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 560 transition count 1279
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 560 transition count 1279
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 548 transition count 1267
Applied a total of 82 rules in 90 ms. Remains 548 /589 variables (removed 41) and now considering 1267/1308 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8555946043337503019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4573463744348976487.kers'
[2026-05-22 19:36:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8555946043337503019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4573463744348976487.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1267 rows 548 cols 5098 entries
Finished phase 1 with 256 SingleSign rule and 230 generalized
[2026-05-22 19:36:35] [INFO ] Computed 62 invariants in 9 ms
Computed 62 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4573463744348976487.kers
Total runtime 11 ms.
[2026-05-22 19:36:36] [INFO ] Implicit Places using invariants in 900 ms returned []
[2026-05-22 19:36:36] [INFO ] Invariant cache hit.
[2026-05-22 19:36:37] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 548/1243 places, 1267/1866 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3245 ms. Remains : 548/1243 places, 1267/1866 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 45 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-06
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-06 finished in 3348 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((G(p0)||X(p1))) U (X(!p2)||G(p2))))'
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Applied a total of 0 rules in 64 ms. Remains 1243 /1243 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2807899918257678951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1166973644392155079.kers'
[2026-05-22 19:36:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2807899918257678951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1166973644392155079.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1866 rows 1243 cols 6483 entries
Finished phase 1 with 820 SingleSign rule and 255 generalized
[2026-05-22 19:36:37] [INFO ] Computed 168 invariants in 35 ms
Computed 168 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-1166973644392155079.kers
Total runtime 38 ms.
[2026-05-22 19:36:38] [INFO ] Implicit Places using invariants in 1050 ms returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1243 places, 1866/1866 transitions.
Applied a total of 0 rules in 34 ms. Remains 1242 /1242 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1164 ms. Remains : 1242/1243 places, 1866/1866 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((G(p0)||X(p1))) U (X(!p2)||G(p2))))'
Stuttering acceptance computed with spot in 580 ms :[true, false, (AND (NOT p1) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-07
Product exploration explored 100000 steps with 533 reset in 428 ms.
Product exploration explored 100000 steps with 552 reset in 397 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 30 factoid took 94 ms. Reduced automaton from 13 states, 48 edges and 3 AP (stutter sensitive) to 10 states, 32 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (221 resets) in 455 ms. (87 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40004 steps (29 resets) in 307 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (29 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 69 ms. (571 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (27 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (28 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9779919066658181010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4324396328678690923.kers'
[2026-05-22 19:36:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9779919066658181010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4324396328678690923.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1866 rows 1242 cols 6478 entries
Finished phase 1 with 820 SingleSign rule and 255 generalized
[2026-05-22 19:36:41] [INFO ] Computed 167 invariants in 11 ms
Computed 167 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-4324396328678690923.kers
Total runtime 13 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 182/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 347/535 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 707/1242 variables, 138/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1866/3108 variables, 1242/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3108 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/3108 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3108/3108 variables, and 1409 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2324 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 182/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 347/535 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 707/1242 variables, 138/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1866/3108 variables, 1242/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3108 variables, 9/1418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3108/3108 variables, and 1418 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7375ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1866/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1242 transition count 1627
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1003 transition count 1626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1002 transition count 1626
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 480 place count 1002 transition count 1462
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 380 rules applied. Total rules applied 860 place count 786 transition count 1462
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 19 rules applied. Total rules applied 879 place count 776 transition count 1453
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 888 place count 767 transition count 1453
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 888 place count 767 transition count 1430
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 934 place count 744 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 939 place count 739 transition count 1425
Iterating global reduction 5 with 5 rules applied. Total rules applied 944 place count 739 transition count 1425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 948 place count 739 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 949 place count 738 transition count 1421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 949 place count 738 transition count 1420
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 951 place count 737 transition count 1420
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 7 with 138 rules applied. Total rules applied 1089 place count 668 transition count 1351
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1090 place count 668 transition count 1350
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1096 place count 668 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1102 place count 662 transition count 1344
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1128 place count 662 transition count 1318
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1155 place count 635 transition count 1318
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1160 place count 635 transition count 1313
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1178 place count 635 transition count 1313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1179 place count 634 transition count 1312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1184 place count 629 transition count 1312
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 1184 place count 629 transition count 1302
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1209 place count 614 transition count 1302
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1214 place count 609 transition count 1297
Iterating global reduction 10 with 5 rules applied. Total rules applied 1219 place count 609 transition count 1297
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1224 place count 609 transition count 1292
Applied a total of 1224 rules in 292 ms. Remains 609 /1242 variables (removed 633) and now considering 1292/1866 (removed 574) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 609/1242 places, 1292/1866 transitions.
RANDOM walk for 40000 steps (664 resets) in 318 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (131 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (121 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (130 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (118 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (123 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (126 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (124 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (124 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (128 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 325505 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :4 out of 9
Probabilistic random walk after 325505 steps, saw 82009 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :4
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1320230903761489289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5511127727909912731.kers'
[2026-05-22 19:36:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1320230903761489289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5511127727909912731.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 1292 rows 603 cols 5265 entries
Finished phase 1 with 230 SingleSign rule and 285 generalized
[2026-05-22 19:36:52] [INFO ] Computed 94 invariants in 11 ms
Computed 94 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-5511127727909912731.kers
Total runtime 12 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1901/1901 variables, and 703 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 5/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1901 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1901 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1901/1901 variables, and 708 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6203 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7709ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4321 ms.
Support contains 6 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 19 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 609/609 places, 1292/1292 transitions.
RANDOM walk for 40000 steps (650 resets) in 347 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (129 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (130 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (128 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (129 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (122 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 319995 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 5
Probabilistic random walk after 319995 steps, saw 81001 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2026-05-22 19:37:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1901/1901 variables, and 703 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 5/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1901 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1901 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1901/1901 variables, and 708 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6081 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7623ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7340 ms.
Support contains 6 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 22 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 609/609 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 20 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2026-05-22 19:37:22] [INFO ] Invariant cache hit.
[2026-05-22 19:37:23] [INFO ] Implicit Places using invariants in 784 ms returned [90, 97, 100, 102, 105, 112, 113, 166, 183, 189, 192, 194, 195, 200, 201, 253, 270, 276, 279, 281, 282, 287, 288, 340, 357, 363, 366, 368, 369, 374, 375, 427, 444, 450, 453, 455, 456, 461, 462, 514, 524, 534, 540, 543, 545, 546]
[2026-05-22 19:37:23] [INFO ] Actually due to overlaps returned [282, 369, 456, 546, 195, 90, 97, 102, 183, 189, 194, 270, 276, 281, 357, 363, 368, 444, 450, 455, 534, 540, 545, 105, 166, 253, 340, 427, 514, 524]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 788 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 579/609 places, 1292/1292 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 555 transition count 1268
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 555 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 549 transition count 1262
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 549 transition count 1262
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 82 place count 538 transition count 1251
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 538 transition count 1250
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 101 place count 538 transition count 1232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 119 place count 520 transition count 1232
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 520 transition count 1227
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 129 place count 515 transition count 1227
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 515 transition count 1227
Applied a total of 130 rules in 169 ms. Remains 515 /579 variables (removed 64) and now considering 1227/1292 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17438998312475188411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18005151668017572022.kers'
[2026-05-22 19:37:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17438998312475188411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18005151668017572022.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1227 rows 514 cols 5113 entries
Finished phase 1 with 218 SingleSign rule and 233 generalized
[2026-05-22 19:37:23] [INFO ] Computed 64 invariants in 26 ms
Computed 64 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-18005151668017572022.kers
Total runtime 28 ms.
[2026-05-22 19:37:24] [INFO ] Implicit Places using invariants in 634 ms returned [99, 100, 171, 172, 242, 243, 313, 314, 384, 385]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 637 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 505/609 places, 1227/1292 transitions.
Applied a total of 0 rules in 30 ms. Remains 505 /505 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1645 ms. Remains : 505/609 places, 1227/1292 transitions.
RANDOM walk for 40000 steps (716 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (151 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (158 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (159 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (149 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (159 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 183879 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 5
Probabilistic random walk after 183879 steps, saw 113398 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14751412912443843078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7498830363873357116.kers'
[2026-05-22 19:37:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14751412912443843078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7498830363873357116.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1227 rows 504 cols 4978 entries
Finished phase 1 with 183 SingleSign rule and 268 generalized
[2026-05-22 19:37:27] [INFO ] Computed 54 invariants in 8 ms
Computed 54 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7498830363873357116.kers
Total runtime 11 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 136/314 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 57/371 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/379 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 126/505 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1732 variables, 505/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1732 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1732/1732 variables, and 559 constraints, problems are : Problem set: 0 solved, 5 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 136/314 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 57/371 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/379 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 126/505 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1732 variables, 505/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1732 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1732 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1732/1732 variables, and 564 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6363 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7356ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3308 ms.
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1227/1227 transitions.
Applied a total of 0 rules in 17 ms. Remains 505 /505 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 505/505 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1227/1227 transitions.
Applied a total of 0 rules in 17 ms. Remains 505 /505 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2026-05-22 19:37:38] [INFO ] Invariant cache hit.
[2026-05-22 19:37:38] [INFO ] Implicit Places using invariants in 470 ms returned []
[2026-05-22 19:37:38] [INFO ] Invariant cache hit.
[2026-05-22 19:37:39] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
[2026-05-22 19:37:40] [INFO ] Redundant transitions in 72 ms returned []
Running 1197 sub problems to find dead transitions.
[2026-05-22 19:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1732 variables, and 52 constraints, problems are : Problem set: 0 solved, 1197 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 26/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 1197/1197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1732 variables, and 52 constraints, problems are : Problem set: 0 solved, 1197 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 26/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 0/1197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 1197 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62246 ms. Remains : 505/505 places, 1227/1227 transitions.
Knowledge based reduction with 30 factoid took 423 ms. Reduced automaton from 10 states, 32 edges and 3 AP (stutter sensitive) to 10 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Knowledge-based reduction took 120981 ms.
Stuttering acceptance computed with spot in 436 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1866/1866 transitions.
Applied a total of 0 rules in 40 ms. Remains 1242 /1242 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4185244557993840390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3261220853212959428.kers'
[2026-05-22 19:38:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4185244557993840390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3261220853212959428.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1866 rows 1242 cols 6478 entries
Finished phase 1 with 820 SingleSign rule and 255 generalized
[2026-05-22 19:38:41] [INFO ] Computed 167 invariants in 16 ms
Computed 167 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-3261220853212959428.kers
Total runtime 19 ms.
[2026-05-22 19:38:43] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2026-05-22 19:38:43] [INFO ] Invariant cache hit.
[2026-05-22 19:38:46] [INFO ] Implicit Places using invariants and state equation in 3495 ms returned []
Implicit Place search using SMT with State Equation took 4671 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2026-05-22 19:38:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 1865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1241/3108 variables, and 130 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/29 constraints, Generalized P Invariants (flows): 130/138 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 1865/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 1865 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1241/3108 variables, and 130 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/29 constraints, Generalized P Invariants (flows): 130/138 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 0/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60574ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Finished structural reductions in LTL mode , in 1 iterations and 65300 ms. Remains : 1242/1242 places, 1866/1866 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 12 factoid took 77 ms. Reduced automaton from 10 states, 32 edges and 3 AP (stutter sensitive) to 10 states, 32 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (206 resets) in 313 ms. (127 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40004 steps (28 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (31 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (27 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (27 resets) in 63 ms. (625 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (27 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
[2026-05-22 19:39:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 182/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 347/535 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 707/1242 variables, 138/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1866/3108 variables, 1242/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3108 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/3108 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3108/3108 variables, and 1409 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2289 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 182/188 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 347/535 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 707/1242 variables, 138/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1866/3108 variables, 1242/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3108 variables, 9/1418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3108/3108 variables, and 1418 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7320ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1866/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1242 transition count 1627
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1003 transition count 1626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1002 transition count 1626
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 480 place count 1002 transition count 1462
Deduced a syphon composed of 164 places in 3 ms
Ensure Unique test removed 52 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 380 rules applied. Total rules applied 860 place count 786 transition count 1462
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 19 rules applied. Total rules applied 879 place count 776 transition count 1453
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 888 place count 767 transition count 1453
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 888 place count 767 transition count 1430
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 934 place count 744 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 939 place count 739 transition count 1425
Iterating global reduction 5 with 5 rules applied. Total rules applied 944 place count 739 transition count 1425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 948 place count 739 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 949 place count 738 transition count 1421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 949 place count 738 transition count 1420
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 951 place count 737 transition count 1420
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 7 with 138 rules applied. Total rules applied 1089 place count 668 transition count 1351
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1090 place count 668 transition count 1350
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1096 place count 668 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1102 place count 662 transition count 1344
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1128 place count 662 transition count 1318
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1155 place count 635 transition count 1318
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1160 place count 635 transition count 1313
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1178 place count 635 transition count 1313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1179 place count 634 transition count 1312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1184 place count 629 transition count 1312
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 1184 place count 629 transition count 1302
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1209 place count 614 transition count 1302
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1214 place count 609 transition count 1297
Iterating global reduction 10 with 5 rules applied. Total rules applied 1219 place count 609 transition count 1297
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1224 place count 609 transition count 1292
Applied a total of 1224 rules in 255 ms. Remains 609 /1242 variables (removed 633) and now considering 1292/1866 (removed 574) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 609/1242 places, 1292/1866 transitions.
RANDOM walk for 40000 steps (668 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (121 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (120 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (125 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (117 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (124 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (128 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (120 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (131 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (131 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 367919 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :4 out of 9
Probabilistic random walk after 367919 steps, saw 89997 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :4
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4097797544004717767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3486671176006069669.kers'
[2026-05-22 19:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4097797544004717767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3486671176006069669.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 2 ms.
// Phase 1: matrix 1292 rows 603 cols 5265 entries
Finished phase 1 with 230 SingleSign rule and 285 generalized
[2026-05-22 19:39:58] [INFO ] Computed 94 invariants in 15 ms
Computed 94 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-3486671176006069669.kers
Total runtime 17 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1901/1901 variables, and 703 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 5/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1901 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1901 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1901/1901 variables, and 708 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6058 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7610ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 3522 ms.
Support contains 6 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 18 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 609/609 places, 1292/1292 transitions.
RANDOM walk for 40000 steps (660 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (124 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (124 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (123 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 371451 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 3
Probabilistic random walk after 371451 steps, saw 90820 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2026-05-22 19:40:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1901/1901 variables, and 703 constraints, problems are : Problem set: 0 solved, 3 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1901 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1901 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1901/1901 variables, and 706 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6283 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7119ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 3362 ms.
Support contains 6 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 19 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 609/609 places, 1292/1292 transitions.
RANDOM walk for 40000 steps (625 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (130 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463168 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463168 steps, saw 107723 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2026-05-22 19:40:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1901 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1901/1901 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/273 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 122/395 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/472 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/478 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 129/607 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/607 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/609 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1292/1901 variables, 609/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1901 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1901 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1901 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1901/1901 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7901 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8550ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 511 ms.
Support contains 6 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 20 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 609/609 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1292/1292 transitions.
Applied a total of 0 rules in 19 ms. Remains 609 /609 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2026-05-22 19:40:35] [INFO ] Invariant cache hit.
[2026-05-22 19:40:36] [INFO ] Implicit Places using invariants in 722 ms returned [90, 97, 100, 102, 105, 112, 113, 166, 183, 189, 192, 194, 195, 200, 201, 253, 270, 276, 279, 281, 282, 287, 288, 340, 357, 363, 366, 368, 369, 374, 375, 427, 444, 450, 453, 455, 456, 461, 462, 514, 524, 534, 540, 543, 545, 546]
[2026-05-22 19:40:36] [INFO ] Actually due to overlaps returned [282, 369, 456, 546, 195, 90, 97, 102, 183, 189, 194, 270, 276, 281, 357, 363, 368, 444, 450, 455, 534, 540, 545, 105, 166, 253, 340, 427, 514, 524]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 725 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 579/609 places, 1292/1292 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 555 transition count 1268
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 555 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 549 transition count 1262
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 549 transition count 1262
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 82 place count 538 transition count 1251
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 538 transition count 1250
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 101 place count 538 transition count 1232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 119 place count 520 transition count 1232
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 520 transition count 1227
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 129 place count 515 transition count 1227
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 515 transition count 1227
Applied a total of 130 rules in 126 ms. Remains 515 /579 variables (removed 64) and now considering 1227/1292 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17294771876799320091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11461277479707238250.kers'
[2026-05-22 19:40:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17294771876799320091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11461277479707238250.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1227 rows 514 cols 5113 entries
Finished phase 1 with 218 SingleSign rule and 233 generalized
[2026-05-22 19:40:36] [INFO ] Computed 64 invariants in 16 ms
Computed 64 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-11461277479707238250.kers
Total runtime 19 ms.
[2026-05-22 19:40:37] [INFO ] Implicit Places using invariants in 635 ms returned [99, 100, 171, 172, 242, 243, 313, 314, 384, 385]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 638 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 505/609 places, 1227/1292 transitions.
Applied a total of 0 rules in 32 ms. Remains 505 /505 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1542 ms. Remains : 505/609 places, 1227/1292 transitions.
RANDOM walk for 40000 steps (719 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (147 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 399537 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 399537 steps, saw 267908 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16795003982822929451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11983322804738880340.kers'
[2026-05-22 19:40:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16795003982822929451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11983322804738880340.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1227 rows 504 cols 4978 entries
Finished phase 1 with 183 SingleSign rule and 268 generalized
[2026-05-22 19:40:40] [INFO ] Computed 54 invariants in 24 ms
Computed 54 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-11983322804738880340.kers
Total runtime 27 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/314 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/371 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/379 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/505 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1732 variables, 505/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1732 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1732/1732 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/314 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/371 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/379 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 126/505 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1732 variables, 505/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1732 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1732 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1732/1732 variables, and 560 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2826ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 289 ms.
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1227/1227 transitions.
Applied a total of 0 rules in 18 ms. Remains 505 /505 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 505/505 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1227/1227 transitions.
Applied a total of 0 rules in 17 ms. Remains 505 /505 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2026-05-22 19:40:43] [INFO ] Invariant cache hit.
[2026-05-22 19:40:43] [INFO ] Implicit Places using invariants in 460 ms returned []
[2026-05-22 19:40:43] [INFO ] Invariant cache hit.
[2026-05-22 19:40:45] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2026-05-22 19:40:45] [INFO ] Redundant transitions in 40 ms returned []
Running 1197 sub problems to find dead transitions.
[2026-05-22 19:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1732 variables, and 52 constraints, problems are : Problem set: 0 solved, 1197 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 26/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 1197/1197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1732 variables, and 52 constraints, problems are : Problem set: 0 solved, 1197 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 26/28 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 0/1197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1197 unsolved
Search for dead transitions found 0 dead transitions in 60452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62341 ms. Remains : 505/505 places, 1227/1227 transitions.
Knowledge based reduction with 12 factoid took 305 ms. Reduced automaton from 10 states, 32 edges and 3 AP (stutter sensitive) to 10 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Knowledge-based reduction took 119215 ms.
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 531 reset in 440 ms.
Product exploration explored 100000 steps with 548 reset in 418 ms.
Spot run failed in 165 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/ltsmin4170575720018533730
[2026-05-22 19:41:48] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4170575720018533730
Running compilation step : cd /tmp/ltsmin4170575720018533730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4170575720018533730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4170575720018533730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1866/1866 transitions.
Applied a total of 0 rules in 30 ms. Remains 1242 /1242 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15040521388719383872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13996404968125697046.kers'
[2026-05-22 19:41:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15040521388719383872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13996404968125697046.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1866 rows 1242 cols 6478 entries
Finished phase 1 with 820 SingleSign rule and 255 generalized
[2026-05-22 19:41:51] [INFO ] Computed 167 invariants in 11 ms
Computed 167 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-13996404968125697046.kers
Total runtime 15 ms.
[2026-05-22 19:41:52] [INFO ] Implicit Places using invariants in 953 ms returned []
[2026-05-22 19:41:52] [INFO ] Invariant cache hit.
[2026-05-22 19:41:55] [INFO ] Implicit Places using invariants and state equation in 3567 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
Running 1865 sub problems to find dead transitions.
[2026-05-22 19:41:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 1865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1241/3108 variables, and 130 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/29 constraints, Generalized P Invariants (flows): 130/138 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 1865/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 1865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1241/3108 variables, and 130 constraints, problems are : Problem set: 0 solved, 1865 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/29 constraints, Generalized P Invariants (flows): 130/138 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 0/1865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60621ms problems are : Problem set: 0 solved, 1865 unsolved
Search for dead transitions found 0 dead transitions in 60626ms
Finished structural reductions in LTL mode , in 1 iterations and 65193 ms. Remains : 1242/1242 places, 1866/1866 transitions.
Built C files in :
/tmp/ltsmin13251235684262001302
[2026-05-22 19:42:56] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13251235684262001302
Running compilation step : cd /tmp/ltsmin13251235684262001302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13251235684262001302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13251235684262001302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 19:42:59] [INFO ] Flatten gal took : 35 ms
[2026-05-22 19:42:59] [INFO ] Flatten gal took : 38 ms
[2026-05-22 19:42:59] [INFO ] Time to serialize gal into /tmp/LTL2269623488095161035.gal : 7 ms
[2026-05-22 19:42:59] [INFO ] Time to serialize properties into /tmp/LTL1200110830655202204.prop : 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/LTL2269623488095161035.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3395280672806555480.hoa' '-atoms' '/tmp/LTL1200110830655202204.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...317
Loading property file /tmp/LTL1200110830655202204.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3395280672806555480.hoa
Detected timeout of ITS tools.
[2026-05-22 19:43:14] [INFO ] Flatten gal took : 42 ms
[2026-05-22 19:43:14] [INFO ] Flatten gal took : 32 ms
[2026-05-22 19:43:14] [INFO ] Time to serialize gal into /tmp/LTL11182624571555781770.gal : 10 ms
[2026-05-22 19:43:14] [INFO ] Time to serialize properties into /tmp/LTL10308518418280250762.ltl : 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/LTL11182624571555781770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10308518418280250762.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...277
Read 1 LTL properties
Checking formula 0 : !(((G((G("((p154==0)||(p640==1))"))||(X("((p864==0)||(p94==1))"))))U((X(!("((p1092==0)||(p23==1))")))||(G("((p1092==0)||(p23==1))"))))...156
Formula 0 simplified : F(F!"((p154==0)||(p640==1))" & X!"((p864==0)||(p94==1))") R (X"((p1092==0)||(p23==1))" & F!"((p1092==0)||(p23==1))")
Detected timeout of ITS tools.
[2026-05-22 19:43:29] [INFO ] Flatten gal took : 51 ms
[2026-05-22 19:43:29] [INFO ] Applying decomposition
[2026-05-22 19:43:29] [INFO ] Flatten gal took : 38 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/graph445964766027859369.txt' '-o' '/tmp/graph445964766027859369.bin' '-w' '/tmp/graph445964766027859369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph445964766027859369.bin' '-l' '-1' '-v' '-w' '/tmp/graph445964766027859369.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:43:30] [INFO ] Decomposing Gal with order
[2026-05-22 19:43:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:43:30] [INFO ] Removed a total of 2558 redundant transitions.
[2026-05-22 19:43:30] [INFO ] Flatten gal took : 93 ms
[2026-05-22 19:43:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 32 ms.
[2026-05-22 19:43:30] [INFO ] Time to serialize gal into /tmp/LTL11296031423906560759.gal : 17 ms
[2026-05-22 19:43:30] [INFO ] Time to serialize properties into /tmp/LTL17680821438401862971.ltl : 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/LTL11296031423906560759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17680821438401862971.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G((G("((i1.i1.u49.p154==0)||(i10.i4.u229.p640==1))"))||(X("((i8.u245.p864==0)||(i0.i2.u68.p94==1))"))))U((X(!("((i14.i0.u309.p1092...238
Formula 0 simplified : F(F!"((i1.i1.u49.p154==0)||(i10.i4.u229.p640==1))" & X!"((i8.u245.p864==0)||(i0.i2.u68.p94==1))") R (X"((i14.i0.u309.p1092==0)||(i0....221
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLCardinality-07 finished in 427660 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(F(p0))&&G(p1))))'
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1242 transition count 1865
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1242 transition count 1865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1242 transition count 1864
Applied a total of 3 rules in 118 ms. Remains 1242 /1243 variables (removed 1) and now considering 1864/1866 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2721030866305530028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2184521303399118188.kers'
[2026-05-22 19:43:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2721030866305530028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2184521303399118188.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1864 rows 1242 cols 6479 entries
Finished phase 1 with 819 SingleSign rule and 255 generalized
[2026-05-22 19:43:45] [INFO ] Computed 168 invariants in 15 ms
Computed 168 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-2184521303399118188.kers
Total runtime 19 ms.
[2026-05-22 19:43:46] [INFO ] Implicit Places using invariants in 1031 ms returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1243 places, 1864/1866 transitions.
Applied a total of 0 rules in 64 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1219 ms. Remains : 1241/1243 places, 1864/1866 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(F(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-10 finished in 1500 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 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1866/1866 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1242 transition count 1624
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 257 rules applied. Total rules applied 498 place count 994 transition count 1615
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 507 place count 986 transition count 1614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 985 transition count 1614
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 176 Pre rules applied. Total rules applied 508 place count 985 transition count 1438
Deduced a syphon composed of 176 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 229 places and 0 transitions.
Iterating global reduction 4 with 405 rules applied. Total rules applied 913 place count 756 transition count 1438
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 37 rules applied. Total rules applied 950 place count 740 transition count 1417
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 971 place count 719 transition count 1417
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 971 place count 719 transition count 1392
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1021 place count 694 transition count 1392
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1032 place count 683 transition count 1381
Iterating global reduction 6 with 11 rules applied. Total rules applied 1043 place count 683 transition count 1381
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 1053 place count 683 transition count 1371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1054 place count 682 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1054 place count 682 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1056 place count 681 transition count 1370
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 8 with 124 rules applied. Total rules applied 1180 place count 619 transition count 1308
Applied a total of 1180 rules in 101 ms. Remains 619 /1243 variables (removed 624) and now considering 1308/1866 (removed 558) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15315103539245885936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16175899565371764926.kers'
[2026-05-22 19:43:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15315103539245885936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16175899565371764926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1308 rows 619 cols 5294 entries
Finished phase 1 with 252 SingleSign rule and 275 generalized
[2026-05-22 19:43:47] [INFO ] Computed 92 invariants in 8 ms
Computed 92 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16175899565371764926.kers
Total runtime 10 ms.
[2026-05-22 19:43:47] [INFO ] Implicit Places using invariants in 520 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 373, 433, 450, 456, 461, 463, 523, 540, 546, 551, 553, 616]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 524 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/1243 places, 1308/1866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 1307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1307
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1295
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1295
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 564 transition count 1283
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 564 transition count 1283
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 558 transition count 1277
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 558 transition count 1277
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 86 place count 546 transition count 1265
Applied a total of 86 rules in 76 ms. Remains 546 /589 variables (removed 43) and now considering 1265/1308 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18282569096899013332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-601657099348134876.kers'
[2026-05-22 19:43:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18282569096899013332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-601657099348134876.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1265 rows 546 cols 5095 entries
Finished phase 1 with 251 SingleSign rule and 233 generalized
[2026-05-22 19:43:47] [INFO ] Computed 62 invariants in 8 ms
Computed 62 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-601657099348134876.kers
Total runtime 11 ms.
[2026-05-22 19:43:48] [INFO ] Implicit Places using invariants in 556 ms returned []
[2026-05-22 19:43:48] [INFO ] Invariant cache hit.
[2026-05-22 19:43:49] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 546/1243 places, 1265/1866 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2597 ms. Remains : 546/1243 places, 1265/1866 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 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-15 finished in 2703 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(((p1&&G(p2))||p0))))'
Spot run failed in 46 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((G(p0)||X(p1))) U (X(!p2)||G(p2))))'
Spot run failed in 50 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-22 19:43:49] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18426671414990854546
[2026-05-22 19:43:49] [INFO ] Too many transitions (1866) to apply POR reductions. Disabling POR matrices.
[2026-05-22 19:43:49] [INFO ] Applying decomposition
[2026-05-22 19:43:49] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18426671414990854546
Running compilation step : cd /tmp/ltsmin18426671414990854546;'/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'
[2026-05-22 19:43:49] [INFO ] Flatten gal took : 32 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/graph5917097139712376404.txt' '-o' '/tmp/graph5917097139712376404.bin' '-w' '/tmp/graph5917097139712376404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5917097139712376404.bin' '-l' '-1' '-v' '-w' '/tmp/graph5917097139712376404.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:43:50] [INFO ] Decomposing Gal with order
[2026-05-22 19:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:43:50] [INFO ] Removed a total of 2526 redundant transitions.
[2026-05-22 19:43:50] [INFO ] Flatten gal took : 70 ms
[2026-05-22 19:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 14 ms.
[2026-05-22 19:43:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality8554854692471453807.gal : 13 ms
[2026-05-22 19:43:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality14391222399630012498.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/LTLCardinality8554854692471453807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14391222399630012498.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
Checking formula 0 : !((G(F(("((i16.i0.u336.p1186==0)||(i17.u306.p1084==1))")||(("((i8.u239.p855==0)||(i2.i0.u65.p222==1))")&&(G("((i6.i5.u229.p810==0)||(i...182
Formula 0 simplified : FG(!"((i16.i0.u336.p1186==0)||(i17.u306.p1084==1))" & (!"((i8.u239.p855==0)||(i2.i0.u65.p222==1))" | F!"((i6.i5.u229.p810==0)||(i6.i...174
Compilation finished in 4244 ms.
Running link step : cd /tmp/ltsmin18426671414990854546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 129 ms.
Running LTSmin : cd /tmp/ltsmin18426671414990854546;'/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' '[](<>((((LTLAPp1==true)&&[]((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18426671414990854546;'/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' '[](<>((((LTLAPp1==true)&&[]((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18426671414990854546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](([]((LTLAPp3==true))||X((LTLAPp4==true)))) U (X(!(LTLAPp5==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 20:09:02] [INFO ] Applying decomposition
[2026-05-22 20:09:02] [INFO ] Flatten gal took : 34 ms
[2026-05-22 20:09:02] [INFO ] Decomposing Gal with order
[2026-05-22 20:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:09:02] [INFO ] Removed a total of 2095 redundant transitions.
[2026-05-22 20:09:02] [INFO ] Flatten gal took : 93 ms
[2026-05-22 20:09:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 793 labels/synchronizations in 34 ms.
[2026-05-22 20:09:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality1733974650911944343.gal : 8 ms
[2026-05-22 20:09:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality190976140433614199.ltl : 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/LTLCardinality1733974650911944343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality190976140433614199.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...275
Read 2 LTL properties
Checking formula 0 : !((G(F(("((u210.p1186==0)||(i45.i1.u273.p1084==1))")||(("((u146.p855==0)||(u36.p222==1))")&&(G("((u142.p810==0)||(u75.p445==1))"))))))...156
Formula 0 simplified : FG(!"((u210.p1186==0)||(i45.i1.u273.p1084==1))" & (!"((u146.p855==0)||(u36.p222==1))" | F!"((u142.p810==0)||(u75.p445==1))"))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18426671414990854546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](([]((LTLAPp3==true))||X((LTLAPp4==true)))) U (X(!(LTLAPp5==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin18426671414990854546;'/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' '[](<>((((LTLAPp1==true)&&[]((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1203, t1374, t1375, t1378, t1380, t1383, t1395, t1404, t1457, t1480, t1530, t1556, t1609, t1...951
Computing Next relation with stutter on 8.76172e+15 deadlock states

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ASLink-PT-06a"
export BK_EXAMINATION="LTLCardinality"
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 ASLink-PT-06a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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