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-177944366200331.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-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 9.6K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 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.9K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 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 436K 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-04a-LTLCardinality-00
FORMULA_NAME ASLink-PT-04a-LTLCardinality-01
FORMULA_NAME ASLink-PT-04a-LTLCardinality-02
FORMULA_NAME ASLink-PT-04a-LTLCardinality-03
FORMULA_NAME ASLink-PT-04a-LTLCardinality-04
FORMULA_NAME ASLink-PT-04a-LTLCardinality-05
FORMULA_NAME ASLink-PT-04a-LTLCardinality-06
FORMULA_NAME ASLink-PT-04a-LTLCardinality-07
FORMULA_NAME ASLink-PT-04a-LTLCardinality-08
FORMULA_NAME ASLink-PT-04a-LTLCardinality-09
FORMULA_NAME ASLink-PT-04a-LTLCardinality-10
FORMULA_NAME ASLink-PT-04a-LTLCardinality-11
FORMULA_NAME ASLink-PT-04a-LTLCardinality-12
FORMULA_NAME ASLink-PT-04a-LTLCardinality-13
FORMULA_NAME ASLink-PT-04a-LTLCardinality-14
FORMULA_NAME ASLink-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779474022323

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-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 18:20:23] [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 18:20:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:20:23] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-22 18:20:23] [INFO ] Transformed 1016 places.
[2026-05-22 18:20:23] [INFO ] Transformed 1554 transitions.
[2026-05-22 18:20:23] [INFO ] Found NUPN structural information;
[2026-05-22 18:20:23] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 254 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 3 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 984 transition count 1502
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 983 transition count 1502
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 983 transition count 1500
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 982 transition count 1492
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 982 transition count 1492
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 981 transition count 1484
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 981 transition count 1484
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 980 transition count 1476
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 980 transition count 1476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 979 transition count 1468
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 979 transition count 1468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 978 transition count 1460
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 978 transition count 1460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 977 transition count 1452
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 977 transition count 1452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 976 transition count 1444
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 976 transition count 1444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 975 transition count 1436
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 975 transition count 1436
Applied a total of 59 rules in 589 ms. Remains 975 /1016 variables (removed 41) and now considering 1436/1538 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2298037421965444167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17913070954688014944.kers'
[2026-05-22 18:20:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2298037421965444167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17913070954688014944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1436 rows 975 cols 5372 entries
Finished phase 1 with 373 SingleSign rule and 433 generalized
[2026-05-22 18:20:24] [INFO ] Computed 169 invariants in 11 ms
Computed 169 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17913070954688014944.kers
Total runtime 13 ms.
[2026-05-22 18:20:26] [INFO ] Implicit Places using invariants in 1572 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 767, 779, 784, 785, 786, 812, 814, 817, 835, 836, 837, 838, 856, 864, 872, 878, 884, 890, 896, 904, 910, 916, 924]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 1609 ms to find 52 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 923/1016 places, 1436/1538 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 912 transition count 1425
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 912 transition count 1425
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 904 transition count 1417
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 904 transition count 1417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 901 transition count 1414
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 901 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 900 transition count 1413
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 900 transition count 1413
Applied a total of 46 rules in 116 ms. Remains 900 /923 variables (removed 23) and now considering 1413/1436 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14677592561095435230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8567808876891144231.kers'
[2026-05-22 18:20:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14677592561095435230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8567808876891144231.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1413 rows 900 cols 4936 entries
Finished phase 1 with 585 SingleSign rule and 198 generalized
[2026-05-22 18:20:26] [INFO ] Computed 117 invariants in 12 ms
Computed 117 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8567808876891144231.kers
Total runtime 13 ms.
[2026-05-22 18:20:27] [INFO ] Implicit Places using invariants in 832 ms returned []
[2026-05-22 18:20:27] [INFO ] Invariant cache hit.
[2026-05-22 18:20:29] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 3527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 900/1016 places, 1413/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5856 ms. Remains : 900/1016 places, 1413/1538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Applied a total of 0 rules in 36 ms. Remains 900 /900 variables (removed 0) and now considering 1413/1413 (removed 0) transitions.
[2026-05-22 18:20:30] [INFO ] Invariant cache hit.
[2026-05-22 18:20:30] [INFO ] Implicit Places using invariants in 574 ms returned []
[2026-05-22 18:20:30] [INFO ] Invariant cache hit.
[2026-05-22 18:20:33] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3421 ms to find 0 implicit places.
Running 1412 sub problems to find dead transitions.
[2026-05-22 18:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/899 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/2313 variables, and 90 constraints, problems are : Problem set: 0 solved, 1412 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/900 constraints, PredecessorRefiner: 1412/1412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/899 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/2313 variables, and 90 constraints, problems are : Problem set: 0 solved, 1412 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/900 constraints, PredecessorRefiner: 0/1412 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60699ms problems are : Problem set: 0 solved, 1412 unsolved
Search for dead transitions found 0 dead transitions in 60725ms
Finished structural reductions in LTL mode , in 1 iterations and 64230 ms. Remains : 900/900 places, 1413/1413 transitions.
Support contains 37 out of 900 places after structural reductions.
[2026-05-22 18:21:34] [INFO ] Flatten gal took : 131 ms
[2026-05-22 18:21:34] [INFO ] Flatten gal took : 82 ms
[2026-05-22 18:21:34] [INFO ] Input system was already deterministic with 1413 transitions.
RANDOM walk for 40000 steps (280 resets) in 1746 ms. (22 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40003 steps (51 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (53 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (54 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
[2026-05-22 18:21:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 235/244 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/399 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 493/892 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/900 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1413/2313 variables, 900/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2313 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2313 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2313/2313 variables, and 1017 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 900/900 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 235/244 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/399 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 493/892 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/900 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1413/2313 variables, 900/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2313 variables, 4/1021 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2313/2313 variables, and 1021 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 900/900 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6900ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 900 transition count 1239
Reduce places removed 174 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 178 rules applied. Total rules applied 352 place count 726 transition count 1235
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 356 place count 722 transition count 1235
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 356 place count 722 transition count 1122
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 618 place count 573 transition count 1122
Discarding 8 places :
Implicit places reduction removed 8 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 17 rules applied. Total rules applied 635 place count 565 transition count 1113
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 644 place count 556 transition count 1113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 644 place count 556 transition count 1098
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 674 place count 541 transition count 1098
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 681 place count 534 transition count 1084
Iterating global reduction 5 with 7 rules applied. Total rules applied 688 place count 534 transition count 1084
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 5 rules applied. Total rules applied 693 place count 534 transition count 1079
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 695 place count 532 transition count 1079
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 698 place count 529 transition count 1069
Iterating global reduction 7 with 3 rules applied. Total rules applied 701 place count 529 transition count 1069
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 701 place count 529 transition count 1068
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 703 place count 528 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 705 place count 526 transition count 1059
Iterating global reduction 7 with 2 rules applied. Total rules applied 707 place count 526 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 709 place count 524 transition count 1050
Iterating global reduction 7 with 2 rules applied. Total rules applied 711 place count 524 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 712 place count 523 transition count 1042
Iterating global reduction 7 with 1 rules applied. Total rules applied 713 place count 523 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 714 place count 522 transition count 1034
Iterating global reduction 7 with 1 rules applied. Total rules applied 715 place count 522 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 716 place count 521 transition count 1026
Iterating global reduction 7 with 1 rules applied. Total rules applied 717 place count 521 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 718 place count 520 transition count 1018
Iterating global reduction 7 with 1 rules applied. Total rules applied 719 place count 520 transition count 1018
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 811 place count 474 transition count 972
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 815 place count 474 transition count 968
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 819 place count 470 transition count 968
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 835 place count 470 transition count 952
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 852 place count 453 transition count 952
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 856 place count 453 transition count 948
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 869 place count 453 transition count 948
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 870 place count 452 transition count 947
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 874 place count 448 transition count 947
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 874 place count 448 transition count 939
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 19 rules applied. Total rules applied 893 place count 437 transition count 939
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 895 place count 436 transition count 938
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 896 place count 435 transition count 938
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 899 place count 432 transition count 935
Iterating global reduction 12 with 3 rules applied. Total rules applied 902 place count 432 transition count 935
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 905 place count 432 transition count 932
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 906 place count 432 transition count 931
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 907 place count 431 transition count 931
Applied a total of 907 rules in 399 ms. Remains 431 /900 variables (removed 469) and now considering 931/1413 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 431/900 places, 931/1413 transitions.
RANDOM walk for 40000 steps (720 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (190 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (198 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (178 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (187 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 700354 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :3 out of 4
Probabilistic random walk after 700354 steps, saw 157238 distinct states, run finished after 3007 ms. (steps per millisecond=232 ) properties seen :3
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15505235290418642420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8909229940456694018.kers'
[2026-05-22 18:21:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15505235290418642420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8909229940456694018.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 931 rows 428 cols 3785 entries
Finished phase 1 with 163 SingleSign rule and 204 generalized
[2026-05-22 18:21:46] [INFO ] Computed 64 invariants in 5 ms
Computed 64 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8909229940456694018.kers
Total runtime 7 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/64 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/190 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/285 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/331 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/337 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/430 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/431 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 931/1362 variables, 431/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1362 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1362 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1362/1362 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 431/431 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/64 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/190 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/285 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/331 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/337 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/430 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/431 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 931/1362 variables, 431/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1362/1362 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7541 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8084ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 510 ms.
Support contains 4 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 931/931 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 430 transition count 930
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 930
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 430 transition count 929
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 429 transition count 928
Applied a total of 5 rules in 33 ms. Remains 429 /431 variables (removed 2) and now considering 928/931 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 429/431 places, 928/931 transitions.
RANDOM walk for 40000 steps (689 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (188 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 694659 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 1
Probabilistic random walk after 694659 steps, saw 156698 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) 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-15342164926541343688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14009372935757396243.kers'
[2026-05-22 18:21:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15342164926541343688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14009372935757396243.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 928 rows 426 cols 3778 entries
Finished phase 1 with 162 SingleSign rule and 203 generalized
[2026-05-22 18:21:58] [INFO ] Computed 64 invariants in 8 ms
Computed 64 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-14009372935757396243.kers
Total runtime 20 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/189 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/283 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/329 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/335 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/428 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/429 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 928/1357 variables, 429/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1357 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1357 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 429/429 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/189 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/283 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/329 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/335 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/428 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/429 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 928/1357 variables, 429/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1357 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1357 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1357 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1357 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1357/1357 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1812 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 4 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 928/928 transitions.
Applied a total of 0 rules in 17 ms. Remains 429 /429 variables (removed 0) and now considering 928/928 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 429/429 places, 928/928 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 928/928 transitions.
Applied a total of 0 rules in 30 ms. Remains 429 /429 variables (removed 0) and now considering 928/928 (removed 0) transitions.
[2026-05-22 18:22:00] [INFO ] Invariant cache hit.
[2026-05-22 18:22:01] [INFO ] Implicit Places using invariants in 443 ms returned [72, 89, 95, 98, 100, 101, 106, 107, 159, 176, 182, 185, 187, 188, 193, 194, 246, 258, 266, 272, 275, 277, 278, 283, 284, 336, 353, 360, 363, 365, 366]
[2026-05-22 18:22:01] [INFO ] Actually due to overlaps returned [188, 278, 366, 89, 95, 100, 176, 182, 187, 266, 272, 277, 353, 360, 365, 72, 101, 159, 246, 258, 336]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 447 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 408/429 places, 928/928 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 391 transition count 911
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 391 transition count 911
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 388 transition count 908
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 388 transition count 908
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 380 transition count 900
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 380 transition count 888
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 368 transition count 888
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 368 transition count 884
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 364 transition count 884
Applied a total of 88 rules in 65 ms. Remains 364 /408 variables (removed 44) and now considering 884/928 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10888685242733606679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5661463425581965398.kers'
[2026-05-22 18:22:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10888685242733606679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5661463425581965398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 884 rows 364 cols 3682 entries
Finished phase 1 with 152 SingleSign rule and 169 generalized
[2026-05-22 18:22:01] [INFO ] Computed 43 invariants in 4 ms
Computed 43 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5661463425581965398.kers
Total runtime 6 ms.
[2026-05-22 18:22:01] [INFO ] Implicit Places using invariants in 346 ms returned [89, 90, 160, 161, 233, 234]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 360 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 358/429 places, 884/928 transitions.
Applied a total of 0 rules in 36 ms. Remains 358 /358 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 938 ms. Remains : 358/429 places, 884/928 transitions.
RANDOM walk for 40000 steps (763 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (234 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 619413 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 619413 steps, saw 410120 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) 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-558840102242097521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15784278607919545322.kers'
[2026-05-22 18:22:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-558840102242097521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15784278607919545322.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 884 rows 358 cols 3601 entries
Finished phase 1 with 131 SingleSign rule and 190 generalized
[2026-05-22 18:22:04] [INFO ] Computed 37 invariants in 27 ms
Computed 37 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-15784278607919545322.kers
Total runtime 29 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/94 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/175 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/235 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/274 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/358 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 884/1242 variables, 358/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1242 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1242 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1242/1242 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/94 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/175 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/235 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/274 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/358 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 884/1242 variables, 358/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1242 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1242 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1242 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1242/1242 variables, and 398 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1917 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 884/884 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 358/358 places, 884/884 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 884/884 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2026-05-22 18:22:07] [INFO ] Invariant cache hit.
[2026-05-22 18:22:07] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-22 18:22:07] [INFO ] Invariant cache hit.
[2026-05-22 18:22:08] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2026-05-22 18:22:08] [INFO ] Redundant transitions in 40 ms returned []
Running 862 sub problems to find dead transitions.
[2026-05-22 18:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1242 variables, and 37 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1242 variables, and 38 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61416 ms. Remains : 358/358 places, 884/884 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 358 /358 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 18:23:08] [INFO ] Invariant cache hit.
[2026-05-22 18:23:09] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2026-05-22 18:23:09] [INFO ] [Real]Absence check using 18 positive and 19 generalized place invariants in 18 ms returned sat
[2026-05-22 18:23:09] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 18:23:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2026-05-22 18:23:09] [INFO ] [Nat]Absence check using 18 positive and 19 generalized place invariants in 17 ms returned sat
[2026-05-22 18:23:10] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 18:23:11] [INFO ] After 2237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 18:23:12] [INFO ] After 2746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3245 ms.
FORMULA ASLink-PT-04a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-04a-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-04a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(X(p0)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 895 transition count 1401
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 895 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 891 transition count 1390
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 891 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 889 transition count 1381
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 889 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 887 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 887 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 885 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 885 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 883 transition count 1354
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 883 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 881 transition count 1345
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 881 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 879 transition count 1336
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 879 transition count 1336
Applied a total of 42 rules in 267 ms. Remains 879 /900 variables (removed 21) and now considering 1336/1413 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15994752687700911910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17909129751195460322.kers'
[2026-05-22 18:23:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15994752687700911910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17909129751195460322.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1336 rows 879 cols 4646 entries
Finished phase 1 with 577 SingleSign rule and 185 generalized
[2026-05-22 18:23:12] [INFO ] Computed 117 invariants in 7 ms
Computed 117 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17909129751195460322.kers
Total runtime 8 ms.
[2026-05-22 18:23:13] [INFO ] Implicit Places using invariants in 697 ms returned []
[2026-05-22 18:23:13] [INFO ] Invariant cache hit.
[2026-05-22 18:23:15] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
Running 1335 sub problems to find dead transitions.
[2026-05-22 18:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 878/2215 variables, and 90 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/2215 variables, and 90 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 0/1335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 1335 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in LTL mode, iteration 1 : 879/900 places, 1336/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63396 ms. Remains : 879/900 places, 1336/1413 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-04a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-06 finished in 63789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p1) U ((X(p1)&&((p1||F(!p2)) U (G((p1||F(!p2)))||(!p3&&(p1||F(!p2))))))||X(G(p1))))))'
Support contains 7 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 897 transition count 1403
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 897 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 895 transition count 1394
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 895 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 894 transition count 1386
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 894 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 893 transition count 1378
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 893 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 892 transition count 1370
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 892 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 891 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 891 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 890 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 890 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 889 transition count 1346
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 889 transition count 1346
Applied a total of 22 rules in 203 ms. Remains 889 /900 variables (removed 11) and now considering 1346/1413 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18431466843748759745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3167626733457785394.kers'
[2026-05-22 18:24:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18431466843748759745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3167626733457785394.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1346 rows 889 cols 4672 entries
Finished phase 1 with 587 SingleSign rule and 185 generalized
[2026-05-22 18:24:16] [INFO ] Computed 117 invariants in 15 ms
Computed 117 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-3167626733457785394.kers
Total runtime 32 ms.
[2026-05-22 18:24:17] [INFO ] Implicit Places using invariants in 733 ms returned []
[2026-05-22 18:24:17] [INFO ] Invariant cache hit.
[2026-05-22 18:24:18] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
Running 1345 sub problems to find dead transitions.
[2026-05-22 18:24:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/888 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 888/2235 variables, and 90 constraints, problems are : Problem set: 0 solved, 1345 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/889 constraints, PredecessorRefiner: 1345/1345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/888 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 888/2235 variables, and 90 constraints, problems are : Problem set: 0 solved, 1345 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/889 constraints, PredecessorRefiner: 0/1345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 1345 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in LTL mode, iteration 1 : 889/900 places, 1346/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62964 ms. Remains : 889/900 places, 1346/1413 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p1) U ((X(p1)&&((p1||F(!p2)) U (G((p1||F(!p2)))||(!p3&&(p1||F(!p2))))))||X(G(p1))))))'
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), true, (AND p2 (NOT p1)), (AND (NOT p1) p2), p2]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-08
Product exploration explored 100000 steps with 33721 reset in 576 ms.
Product exploration explored 100000 steps with 33917 reset in 478 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 12 factoid took 265 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 8996 steps (73 resets) in 127 ms. (70 steps per ms) remains 0/7 properties
Knowledge based reduction with 12 factoid took 278 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2]
Knowledge-based reduction took 1029 ms.
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2]
Support contains 5 out of 889 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 1346/1346 transitions.
Applied a total of 0 rules in 50 ms. Remains 889 /889 variables (removed 0) and now considering 1346/1346 (removed 0) transitions.
[2026-05-22 18:25:22] [INFO ] Invariant cache hit.
[2026-05-22 18:25:23] [INFO ] Implicit Places using invariants in 735 ms returned []
[2026-05-22 18:25:23] [INFO ] Invariant cache hit.
[2026-05-22 18:25:24] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2586 ms. Remains : 889/889 places, 1346/1346 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 9 factoid took 215 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 3387 steps (29 resets) in 48 ms. (69 steps per ms) remains 0/7 properties
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2]
Knowledge-based reduction took 1083 ms.
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2]
Product exploration explored 100000 steps with 25439 reset in 447 ms.
Product exploration explored 100000 steps with 25394 reset in 431 ms.
Spot run failed in 163 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/ltsmin15431218916674848975
[2026-05-22 18:25:28] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15431218916674848975
Running compilation step : cd /tmp/ltsmin15431218916674848975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2981 ms.
Running link step : cd /tmp/ltsmin15431218916674848975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 123 ms.
Running LTSmin : cd /tmp/ltsmin15431218916674848975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10178750411529324387.hoa' '--buchi-type=spotba'
LTSmin run took 3476 ms.
FORMULA ASLink-PT-04a-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-04a-LTLCardinality-08 finished in 78440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 895 transition count 1401
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 895 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 891 transition count 1390
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 891 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 889 transition count 1381
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 889 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 887 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 887 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 885 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 885 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 883 transition count 1354
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 883 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 881 transition count 1345
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 881 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 879 transition count 1336
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 879 transition count 1336
Applied a total of 42 rules in 265 ms. Remains 879 /900 variables (removed 21) and now considering 1336/1413 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7251424047480128682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16640973704980921077.kers'
[2026-05-22 18:25:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7251424047480128682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16640973704980921077.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1336 rows 879 cols 4646 entries
Finished phase 1 with 577 SingleSign rule and 185 generalized
[2026-05-22 18:25:34] [INFO ] Computed 117 invariants in 22 ms
Computed 117 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-16640973704980921077.kers
Total runtime 26 ms.
[2026-05-22 18:25:35] [INFO ] Implicit Places using invariants in 770 ms returned []
[2026-05-22 18:25:35] [INFO ] Invariant cache hit.
[2026-05-22 18:25:37] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2565 ms to find 0 implicit places.
Running 1335 sub problems to find dead transitions.
[2026-05-22 18:25:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 878/2215 variables, and 90 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/2215 variables, and 90 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 90/96 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 0/1335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 1335 unsolved
Search for dead transitions found 0 dead transitions in 60383ms
Starting structural reductions in LTL mode, iteration 1 : 879/900 places, 1336/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63221 ms. Remains : 879/900 places, 1336/1413 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 390 ms.
Product exploration explored 100000 steps with 33333 reset in 392 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 24 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 33 ms.
FORMULA ASLink-PT-04a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-04a-LTLCardinality-09 finished in 64244 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))))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 895 transition count 1401
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 895 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 891 transition count 1390
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 891 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 889 transition count 1381
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 889 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 887 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 887 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 885 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 885 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 883 transition count 1354
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 883 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 881 transition count 1345
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 881 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 879 transition count 1336
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 879 transition count 1336
Applied a total of 42 rules in 216 ms. Remains 879 /900 variables (removed 21) and now considering 1336/1413 (removed 77) transitions.
[2026-05-22 18:26:39] [INFO ] Invariant cache hit.
[2026-05-22 18:26:39] [INFO ] Implicit Places using invariants in 635 ms returned []
[2026-05-22 18:26:39] [INFO ] Invariant cache hit.
[2026-05-22 18:26:41] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 879/900 places, 1336/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2498 ms. Remains : 879/900 places, 1336/1413 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))))'
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 381 ms.
Product exploration explored 100000 steps with 33333 reset in 375 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 30 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA ASLink-PT-04a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-04a-LTLCardinality-10 finished in 3435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 899 transition count 1234
Reduce places removed 182 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 186 rules applied. Total rules applied 364 place count 717 transition count 1230
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 369 place count 713 transition count 1229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 370 place count 712 transition count 1229
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 370 place count 712 transition count 1107
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 281 rules applied. Total rules applied 651 place count 553 transition count 1107
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 681 place count 540 transition count 1090
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 698 place count 523 transition count 1090
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 698 place count 523 transition count 1073
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 732 place count 506 transition count 1073
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 743 place count 495 transition count 1055
Iterating global reduction 6 with 11 rules applied. Total rules applied 754 place count 495 transition count 1055
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 9 rules applied. Total rules applied 763 place count 495 transition count 1046
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 765 place count 493 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 768 place count 490 transition count 1036
Iterating global reduction 8 with 3 rules applied. Total rules applied 771 place count 490 transition count 1036
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 771 place count 490 transition count 1035
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 773 place count 489 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 775 place count 487 transition count 1026
Iterating global reduction 8 with 2 rules applied. Total rules applied 777 place count 487 transition count 1026
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 779 place count 485 transition count 1017
Iterating global reduction 8 with 2 rules applied. Total rules applied 781 place count 485 transition count 1017
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 782 place count 484 transition count 1009
Iterating global reduction 8 with 1 rules applied. Total rules applied 783 place count 484 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 784 place count 483 transition count 1001
Iterating global reduction 8 with 1 rules applied. Total rules applied 785 place count 483 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 786 place count 482 transition count 993
Iterating global reduction 8 with 1 rules applied. Total rules applied 787 place count 482 transition count 993
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 788 place count 481 transition count 985
Iterating global reduction 8 with 1 rules applied. Total rules applied 789 place count 481 transition count 985
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 8 with 90 rules applied. Total rules applied 879 place count 436 transition count 940
Applied a total of 879 rules in 150 ms. Remains 436 /900 variables (removed 464) and now considering 940/1413 (removed 473) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10689835349196140848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5924546920918605506.kers'
[2026-05-22 18:26:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10689835349196140848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5924546920918605506.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 940 rows 436 cols 3796 entries
Finished phase 1 with 178 SingleSign rule and 195 generalized
[2026-05-22 18:26:42] [INFO ] Computed 63 invariants in 11 ms
Computed 63 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-5924546920918605506.kers
Total runtime 13 ms.
[2026-05-22 18:26:42] [INFO ] Implicit Places using invariants in 412 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 357, 363, 368, 370, 433]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 414 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/900 places, 940/1413 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 416 transition count 939
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 415 transition count 939
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 407 transition count 931
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 407 transition count 931
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 399 transition count 923
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 399 transition count 923
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 395 transition count 919
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 395 transition count 919
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 387 transition count 911
Applied a total of 58 rules in 68 ms. Remains 387 /416 variables (removed 29) and now considering 911/940 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12200048022220914230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2434645508954268220.kers'
[2026-05-22 18:26:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12200048022220914230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2434645508954268220.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 911 rows 387 cols 3667 entries
Finished phase 1 with 176 SingleSign rule and 168 generalized
[2026-05-22 18:26:43] [INFO ] Computed 43 invariants in 15 ms
Computed 43 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-2434645508954268220.kers
Total runtime 18 ms.
[2026-05-22 18:26:43] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-22 18:26:43] [INFO ] Invariant cache hit.
[2026-05-22 18:26:44] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 387/900 places, 911/1413 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2020 ms. Remains : 387/900 places, 911/1413 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-11
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-11 finished in 2111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 895 transition count 1401
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 895 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 891 transition count 1390
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 891 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 889 transition count 1381
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 889 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 887 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 887 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 885 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 885 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 883 transition count 1354
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 883 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 881 transition count 1345
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 881 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 879 transition count 1336
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 879 transition count 1336
Applied a total of 42 rules in 248 ms. Remains 879 /900 variables (removed 21) and now considering 1336/1413 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3410405829664095253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17120860103121284444.kers'
[2026-05-22 18:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3410405829664095253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17120860103121284444.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1336 rows 879 cols 4646 entries
Finished phase 1 with 577 SingleSign rule and 185 generalized
[2026-05-22 18:26:44] [INFO ] Computed 117 invariants in 23 ms
Computed 117 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-17120860103121284444.kers
Total runtime 27 ms.
[2026-05-22 18:26:45] [INFO ] Implicit Places using invariants in 797 ms returned []
[2026-05-22 18:26:45] [INFO ] Invariant cache hit.
[2026-05-22 18:26:47] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 879/900 places, 1336/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2678 ms. Remains : 879/900 places, 1336/1413 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-12 finished in 2877 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((X(p0)||G(p1))))'
Support contains 6 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 895 transition count 1401
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 895 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 891 transition count 1390
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 891 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 889 transition count 1381
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 889 transition count 1381
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 887 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 887 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 885 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 885 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 883 transition count 1354
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 883 transition count 1354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 881 transition count 1345
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 881 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 879 transition count 1336
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 879 transition count 1336
Applied a total of 42 rules in 209 ms. Remains 879 /900 variables (removed 21) and now considering 1336/1413 (removed 77) transitions.
[2026-05-22 18:26:47] [INFO ] Invariant cache hit.
[2026-05-22 18:26:48] [INFO ] Implicit Places using invariants in 713 ms returned []
[2026-05-22 18:26:48] [INFO ] Invariant cache hit.
[2026-05-22 18:26:50] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 3033 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 879/900 places, 1336/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3243 ms. Remains : 879/900 places, 1336/1413 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((X(p0)||G(p1))))'
Stuttering acceptance computed with spot in 217 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-14 finished in 3502 ms.
All properties solved by simple procedures.
Total runtime 387197 ms.

BK_STOP 1779474410902

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-04a"
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-04a, 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-177944366200331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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