Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 247K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1779615776179

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-24 09:42:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 09:42:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 09:42:58] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2026-05-24 09:42:58] [INFO ] Transformed 626 places.
[2026-05-24 09:42:58] [INFO ] Transformed 1031 transitions.
[2026-05-24 09:42:58] [INFO ] Found NUPN structural information;
[2026-05-24 09:42:58] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 384 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 15 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 47 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
[2026-05-24 09:42:59] [INFO ] Flatten gal took : 371 ms
[2026-05-24 09:42:59] [INFO ] Flatten gal took : 115 ms
RANDOM walk for 40000 steps (456 resets) in 4097 ms. (9 steps per ms) remains 386/533 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 386/386 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 386/386 properties
[2026-05-24 09:43:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12535358072648141301.gal : 103 ms
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 386/386 properties
[2026-05-24 09:43:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9680908778649433429.prop : 9 ms
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 386/386 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12535358072648141301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9680908778649433429.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 386/386 properties

BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 386/386 properties
its-reach command run as :

BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 386/386 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 386/386 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 386/386 properties
[2026-05-24 09:43:00] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
Loading property file /tmp/ReachabilityCardinality9680908778649433429.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-752952613844331738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4750864489882076289.kers'
[2026-05-24 09:43:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-752952613844331738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4750864489882076289.kers]
Normalized transition count is 1018 out of 1019 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1018 rows 617 cols 3170 entries
Finished phase 1 with 604 SingleSign rule and 0 generalized
[2026-05-24 09:43:00] [INFO ] Computed 13 invariants in 8 ms
Computed 13 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4750864489882076289.kers
Total runtime 12 ms.
[2026-05-24 09:43:00] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,386 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,386 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,386 properties remain. new max is 16
SDD size :4 after 17
SDD proceeding with computation,386 properties remain. new max is 32
SDD size :17 after 63
SDD proceeding with computation,386 properties remain. new max is 64
SDD size :63 after 191
SDD proceeding with computation,386 properties remain. new max is 128
SDD size :191 after 352
SDD proceeding with computation,386 properties remain. new max is 256
SDD size :352 after 1360
SDD proceeding with computation,386 properties remain. new max is 512
SDD size :1360 after 2690
SDD proceeding with computation,386 properties remain. new max is 1024
SDD size :2690 after 12173
Invariant property smplace_225 does not hold.
Invariant property smplace_224 does not hold.
Invariant property smplace_223 does not hold.
Invariant property smplace_222 does not hold.
Invariant property smplace_221 does not hold.
Invariant property smplace_220 does not hold.
Invariant property smplace_219 does not hold.
Invariant property smplace_218 does not hold.
Invariant property smplace_217 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_59 does not hold.
SDD proceeding with computation,372 properties remain. new max is 1024
SDD size :12173 after 29933
Invariant property smplace_60 does not hold.
Invariant property smplace_58 does not hold.
SDD proceeding with computation,370 properties remain. new max is 1024
SDD size :29933 after 41753
SDD proceeding with computation,370 properties remain. new max is 2048
SDD size :41753 after 48285
Invariant property smplace_57 does not hold.
SDD proceeding with computation,369 properties remain. new max is 2048
SDD size :48285 after 57937
Invariant property smplace_216 does not hold.
Invariant property smplace_215 does not hold.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 386/386 constraints. Problems are: Problem set: 0 solved, 386 unsolved
SDD proceeding with computation,367 properties remain. new max is 2048
SDD size :57937 after 142867
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1636 variables, and 386 constraints, problems are : Problem set: 19 solved, 367 unsolved in 5110 ms.
Refiners :[Domain max(s): 386/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 367 unsolved
Invariant property smplace_214 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_212 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 367/367 constraints. Problems are: Problem set: 26 solved, 360 unsolved
Invariant property smplace_93 does not hold.
SDD proceeding with computation,359 properties remain. new max is 2048
SDD size :142867 after 160491
Invariant property smplace_211 does not hold.
Invariant property smplace_210 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_208 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_196 does not hold.
SDD proceeding with computation,350 properties remain. new max is 2048
SDD size :160491 after 193361
Invariant property smplace_195 does not hold.
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_192 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_94 does not hold.
SDD proceeding with computation,335 properties remain. new max is 2048
SDD size :193361 after 208437
Invariant property smplace_170 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_166 does not hold.
Invariant property smplace_111 does not hold.
SDD proceeding with computation,330 properties remain. new max is 2048
SDD size :208437 after 242073
Invariant property smplace_165 does not hold.
SDD proceeding with computation,329 properties remain. new max is 2048
SDD size :242073 after 254053
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1636 variables, and 367 constraints, problems are : Problem set: 57 solved, 329 unsolved in 5040 ms.
Refiners :[Domain max(s): 367/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10595ms problems are : Problem set: 57 solved, 329 unsolved
Skipping Parikh replay, no witness traces provided.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_159 does not hold.
Support contains 329 out of 617 places. Attempting structural reductions.
Invariant property smplace_158 does not hold.
Invariant property smplace_157 does not hold.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1021/1021 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 608 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 608 transition count 949
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 143 place count 540 transition count 947
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 539 transition count 947
Invariant property smplace_121 does not hold.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 144 place count 539 transition count 937
Invariant property smplace_120 does not hold.
Invariant property smplace_118 does not hold.
Deduced a syphon composed of 10 places in 2 ms
Invariant property smplace_117 does not hold.
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 164 place count 529 transition count 937
Invariant property smplace_116 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 193 place count 500 transition count 906
Iterating global reduction 3 with 29 rules applied. Total rules applied 222 place count 500 transition count 906
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 225 place count 500 transition count 903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 225 place count 500 transition count 902
SDD proceeding with computation,304 properties remain. new max is 2048
SDD size :254053 after 293233
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 499 transition count 902
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 234 place count 492 transition count 808
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 492 transition count 808
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 243 place count 492 transition count 806
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 491 transition count 804
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 491 transition count 804
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 303 place count 462 transition count 775
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 341 place count 443 transition count 810
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 361 place count 443 transition count 790
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 386 place count 423 transition count 785
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 388 place count 421 transition count 783
Iterating global reduction 6 with 2 rules applied. Total rules applied 390 place count 421 transition count 783
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 393 place count 421 transition count 780
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 402 place count 421 transition count 771
Applied a total of 402 rules in 348 ms. Remains 421 /617 variables (removed 196) and now considering 771/1021 (removed 250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 421/617 places, 771/1021 transitions.
SDD proceeding with computation,304 properties remain. new max is 4096
SDD size :293233 after 393123
SDD proceeding with computation,304 properties remain. new max is 8192
SDD size :393123 after 564155
SDD proceeding with computation,304 properties remain. new max is 16384
SDD size :564155 after 814583
Invariant property smplace_200 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_198 does not hold.
Invariant property smplace_30 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_17 does not hold.
Invariant property smplace_12 does not hold.
Invariant property smplace_10 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_5 does not hold.
SDD proceeding with computation,293 properties remain. new max is 16384
SDD size :814583 after 1.95952e+06
Invariant property smplace_156 does not hold.
Invariant property smplace_155 does not hold.
Invariant property smplace_154 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_152 does not hold.
Invariant property smplace_151 does not hold.
Invariant property smplace_150 does not hold.
Invariant property smplace_149 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_137 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_133 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
SDD proceeding with computation,254 properties remain. new max is 16384
SDD size :1.95952e+06 after 2.77627e+06
RANDOM walk for 4000000 steps (182649 resets) in 89452 ms. (44 steps per ms) remains 150/304 properties
BEST_FIRST walk for 40004 steps (326 resets) in 250 ms. (159 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (332 resets) in 231 ms. (172 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (337 resets) in 247 ms. (161 steps per ms) remains 148/150 properties
BEST_FIRST walk for 40003 steps (342 resets) in 241 ms. (165 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40001 steps (331 resets) in 239 ms. (166 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (314 resets) in 243 ms. (163 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (343 resets) in 228 ms. (174 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (325 resets) in 229 ms. (173 steps per ms) remains 148/148 properties
SDD proceeding with computation,254 properties remain. new max is 32768
SDD size :2.77627e+06 after 2.94538e+06
BEST_FIRST walk for 40004 steps (339 resets) in 238 ms. (167 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (349 resets) in 250 ms. (159 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (310 resets) in 219 ms. (181 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (336 resets) in 234 ms. (170 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (335 resets) in 224 ms. (177 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (337 resets) in 224 ms. (177 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (334 resets) in 169 ms. (235 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (331 resets) in 189 ms. (210 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (340 resets) in 198 ms. (201 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (339 resets) in 201 ms. (198 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (331 resets) in 160 ms. (248 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (347 resets) in 183 ms. (217 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (334 resets) in 143 ms. (277 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (337 resets) in 203 ms. (196 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (346 resets) in 197 ms. (202 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (326 resets) in 171 ms. (232 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (341 resets) in 175 ms. (227 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (327 resets) in 152 ms. (261 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (337 resets) in 233 ms. (170 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (351 resets) in 267 ms. (149 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40001 steps (337 resets) in 268 ms. (148 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (326 resets) in 238 ms. (167 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (331 resets) in 296 ms. (134 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (335 resets) in 210 ms. (189 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (328 resets) in 185 ms. (215 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (347 resets) in 170 ms. (233 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (336 resets) in 166 ms. (239 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (337 resets) in 179 ms. (222 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (334 resets) in 158 ms. (251 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (330 resets) in 201 ms. (198 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (347 resets) in 188 ms. (211 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (333 resets) in 258 ms. (154 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (331 resets) in 249 ms. (160 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (336 resets) in 234 ms. (170 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (354 resets) in 192 ms. (207 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (347 resets) in 225 ms. (177 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (325 resets) in 228 ms. (174 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (331 resets) in 198 ms. (201 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (326 resets) in 162 ms. (245 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (338 resets) in 177 ms. (224 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (329 resets) in 195 ms. (204 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (318 resets) in 167 ms. (238 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (325 resets) in 183 ms. (217 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (346 resets) in 217 ms. (183 steps per ms) remains 148/148 properties
[2026-05-24 09:43:38] [INFO ] Flow matrix only has 767 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14514083015567194779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12358579881762126695.kers'
[2026-05-24 09:43:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14514083015567194779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12358579881762126695.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 767 rows 421 cols 2553 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-24 09:43:38] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12358579881762126695.kers
Total runtime 5 ms.
[2026-05-24 09:43:38] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 173/293 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 118/411 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SDD proceeding with computation,254 properties remain. new max is 65536
SDD size :2.94538e+06 after 3.73768e+06
At refinement iteration 5 (OVERLAPS) 767/1178 variables, 411/421 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1178 variables, 43/464 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1178 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 10/1188 variables, 10/474 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1188 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Invariant property smplace_413 does not hold.
Invariant property smplace_412 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_409 does not hold.
Invariant property smplace_408 does not hold.
Invariant property smplace_405 does not hold.
SDD proceeding with computation,247 properties remain. new max is 65536
SDD size :3.73768e+06 after 4.25632e+07
At refinement iteration 10 (OVERLAPS) 0/1188 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 474 constraints, problems are : Problem set: 0 solved, 120 unsolved in 18962 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 421/421 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 173/293 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 118/411 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SDD proceeding with computation,247 properties remain. new max is 131072
SDD size :4.25632e+07 after 5.42915e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 767/1178 variables, 411/443 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1178 variables, 43/486 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1178 variables, 120/606 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1178 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1178 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 10/1188 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1188 variables, and 620 constraints, problems are : Problem set: 0 solved, 120 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 421/421 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64033ms problems are : Problem set: 0 solved, 120 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 120 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 771/771 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 421 transition count 721
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 371 transition count 721
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 100 place count 371 transition count 717
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 367 transition count 717
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 125 place count 350 transition count 697
Iterating global reduction 2 with 17 rules applied. Total rules applied 142 place count 350 transition count 697
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 142 place count 350 transition count 695
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 348 transition count 695
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 342 transition count 683
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 342 transition count 683
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 339 transition count 680
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 339 transition count 680
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 339 transition count 674
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 173 place count 336 transition count 674
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 221 place count 312 transition count 650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 312 transition count 649
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 311 transition count 648
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 311 transition count 648
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 264 place count 291 transition count 696
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 270 place count 291 transition count 690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 271 place count 290 transition count 684
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 290 transition count 684
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 273 place count 289 transition count 682
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 289 transition count 682
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 275 place count 288 transition count 679
Iterating global reduction 6 with 1 rules applied. Total rules applied 276 place count 288 transition count 679
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 277 place count 287 transition count 677
Iterating global reduction 6 with 1 rules applied. Total rules applied 278 place count 287 transition count 677
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 279 place count 286 transition count 674
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 286 transition count 674
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 281 place count 285 transition count 672
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 285 transition count 672
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 284 transition count 669
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 284 transition count 669
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 283 transition count 667
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 283 transition count 667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 282 transition count 664
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 282 transition count 664
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 289 place count 281 transition count 662
Iterating global reduction 6 with 1 rules applied. Total rules applied 290 place count 281 transition count 662
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 291 place count 280 transition count 660
Iterating global reduction 6 with 1 rules applied. Total rules applied 292 place count 280 transition count 660
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 293 place count 279 transition count 658
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 279 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 312 place count 279 transition count 640
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 315 place count 279 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 318 place count 276 transition count 637
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 321 place count 276 transition count 814
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 324 place count 273 transition count 814
Applied a total of 324 rules in 304 ms. Remains 273 /421 variables (removed 148) and now considering 814/771 (removed -43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 273/421 places, 814/771 transitions.
Invariant property smplace_407 does not hold.
Invariant property smplace_404 does not hold.
Invariant property smplace_403 does not hold.
Invariant property smplace_402 does not hold.
Invariant property smplace_401 does not hold.
Invariant property smplace_400 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_392 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_385 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_359 does not hold.
Invariant property smplace_358 does not hold.
Invariant property smplace_357 does not hold.
Invariant property smplace_356 does not hold.
Invariant property smplace_355 does not hold.
Invariant property smplace_354 does not hold.
Invariant property smplace_353 does not hold.
Invariant property smplace_352 does not hold.
Invariant property smplace_351 does not hold.
Invariant property smplace_350 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_298 does not hold.
SDD proceeding with computation,219 properties remain. new max is 131072
SDD size :5.42915e+07 after 2.05651e+08
RANDOM walk for 4000000 steps (90329 resets) in 57559 ms. (69 steps per ms) remains 49/120 properties
BEST_FIRST walk for 400003 steps (1922 resets) in 1232 ms. (324 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (1887 resets) in 1174 ms. (340 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 1327 ms. (301 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (1846 resets) in 1341 ms. (298 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (1858 resets) in 1366 ms. (292 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (1901 resets) in 1231 ms. (324 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (1862 resets) in 1106 ms. (361 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1888 resets) in 1123 ms. (355 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1891 resets) in 1124 ms. (355 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400001 steps (1892 resets) in 1276 ms. (313 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (1854 resets) in 1152 ms. (346 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400003 steps (1915 resets) in 1135 ms. (352 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (1882 resets) in 1174 ms. (340 steps per ms) remains 45/47 properties
BEST_FIRST walk for 400004 steps (1872 resets) in 1120 ms. (356 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1872 resets) in 1300 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1921 resets) in 1290 ms. (309 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1925 resets) in 1250 ms. (319 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1879 resets) in 1164 ms. (343 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1871 resets) in 1327 ms. (301 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1837 resets) in 1180 ms. (338 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1917 resets) in 1222 ms. (327 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1858 resets) in 1215 ms. (328 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1885 resets) in 1259 ms. (317 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1889 resets) in 1435 ms. (278 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1867 resets) in 1205 ms. (331 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400004 steps (1882 resets) in 1234 ms. (323 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1911 resets) in 1314 ms. (304 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 1189 ms. (336 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1870 resets) in 1134 ms. (352 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (1903 resets) in 1136 ms. (351 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1859 resets) in 1164 ms. (343 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1877 resets) in 1125 ms. (355 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1894 resets) in 1108 ms. (360 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 1212 ms. (329 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1866 resets) in 1275 ms. (313 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (1928 resets) in 1201 ms. (332 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1904 resets) in 1405 ms. (284 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (1886 resets) in 1101 ms. (362 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1873 resets) in 1390 ms. (287 steps per ms) remains 42/44 properties
BEST_FIRST walk for 400002 steps (1907 resets) in 1434 ms. (278 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400000 steps (1880 resets) in 1125 ms. (355 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (1881 resets) in 1134 ms. (352 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1894 resets) in 1104 ms. (361 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (1912 resets) in 1123 ms. (355 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1886 resets) in 1108 ms. (360 steps per ms) remains 42/42 properties
[2026-05-24 09:45:16] [INFO ] Flow matrix only has 804 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3522787533436253138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15370296721041429079.kers'
[2026-05-24 09:45:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3522787533436253138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15370296721041429079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 804 rows 273 cols 2933 entries
Finished phase 1 with 263 SingleSign rule and 0 generalized
[2026-05-24 09:45:16] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15370296721041429079.kers
Total runtime 5 ms.
[2026-05-24 09:45:16] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 131/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 81/254 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 798/1052 variables, 254/264 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1052 variables, 98/362 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1052 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 23/1075 variables, 17/379 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1075 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 2/1077 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1077 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/1077 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 381 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4784 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 273/273 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 131/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 81/254 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Invariant property smplace_398 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_390 does not hold.
Invariant property smplace_382 does not hold.
Invariant property smplace_380 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_364 does not hold.
Invariant property smplace_349 does not hold.
Invariant property smplace_295 does not hold.
SDD proceeding with computation,209 properties remain. new max is 131072
SDD size :2.05651e+08 after 4.65709e+10
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 798/1052 variables, 254/269 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 98/367 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1052 variables, 42/409 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1052 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1052 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 23/1075 variables, 17/427 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1075 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1075 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 2/1077 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1077 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (OVERLAPS) 0/1077 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 430 constraints, problems are : Problem set: 0 solved, 42 unsolved in 36087 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 273/273 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40914ms problems are : Problem set: 0 solved, 42 unsolved
SDD proceeding with computation,209 properties remain. new max is 262144
SDD size :4.65709e+10 after 4.66493e+10
Parikh walk visited 0 properties in 3737 ms.
Support contains 42 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 814/814 transitions.
Graph (complete) has 1282 edges and 273 vertex of which 270 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 270 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 269 transition count 811
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 24 place count 250 transition count 792
Iterating global reduction 2 with 19 rules applied. Total rules applied 43 place count 250 transition count 792
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 250 transition count 791
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 249 transition count 791
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 56 place count 238 transition count 777
Iterating global reduction 2 with 11 rules applied. Total rules applied 67 place count 238 transition count 777
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 236 transition count 773
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 236 transition count 773
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 99 place count 222 transition count 759
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 218 transition count 743
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 218 transition count 743
Performed 6 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 119 place count 212 transition count 746
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 212 transition count 744
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 127 place count 212 transition count 744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 212 transition count 743
Applied a total of 128 rules in 131 ms. Remains 212 /273 variables (removed 61) and now considering 743/814 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 212/273 places, 743/814 transitions.
RANDOM walk for 4000000 steps (90384 resets) in 46775 ms. (85 steps per ms) remains 38/42 properties
BEST_FIRST walk for 400004 steps (1892 resets) in 1083 ms. (369 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (1852 resets) in 1259 ms. (317 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (1892 resets) in 1076 ms. (371 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (1888 resets) in 1280 ms. (312 steps per ms) remains 36/38 properties
BEST_FIRST walk for 400003 steps (1921 resets) in 1062 ms. (376 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1864 resets) in 1247 ms. (320 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1895 resets) in 1110 ms. (360 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (1891 resets) in 1126 ms. (354 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1889 resets) in 950 ms. (420 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (1880 resets) in 1163 ms. (343 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1889 resets) in 1116 ms. (358 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 1005 ms. (397 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1911 resets) in 1165 ms. (343 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1885 resets) in 1132 ms. (353 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (1911 resets) in 1226 ms. (326 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1875 resets) in 1098 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1872 resets) in 1122 ms. (356 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1916 resets) in 1059 ms. (377 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1895 resets) in 1272 ms. (314 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1895 resets) in 1031 ms. (387 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1888 resets) in 1110 ms. (360 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1870 resets) in 1127 ms. (354 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1865 resets) in 975 ms. (409 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1845 resets) in 1027 ms. (389 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1942 resets) in 1030 ms. (387 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (1897 resets) in 1140 ms. (350 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1871 resets) in 928 ms. (430 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1852 resets) in 1203 ms. (332 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (1870 resets) in 1057 ms. (378 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1900 resets) in 1277 ms. (312 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1846 resets) in 1210 ms. (330 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1929 resets) in 1167 ms. (342 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1877 resets) in 1244 ms. (321 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1864 resets) in 1218 ms. (328 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1891 resets) in 1098 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1888 resets) in 1157 ms. (345 steps per ms) remains 36/36 properties
[2026-05-24 09:46:29] [INFO ] Flow matrix only has 733 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9503330575775287387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14358697743377998382.kers'
[2026-05-24 09:46:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9503330575775287387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14358697743377998382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 733 rows 212 cols 2767 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-24 09:46:29] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14358697743377998382.kers
Total runtime 4 ms.
[2026-05-24 09:46:29] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 92/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 71/199 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 733/932 variables, 199/209 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 97/306 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 13/945 variables, 13/319 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/945 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/945 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 945/945 variables, and 319 constraints, problems are : Problem set: 0 solved, 36 unsolved in 2737 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 92/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Invariant property smplace_406 does not hold.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 71/199 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Invariant property smplace_285 does not hold.
Invariant property smplace_251 does not hold.
SDD proceeding with computation,206 properties remain. new max is 262144
SDD size :4.66493e+10 after 7.04526e+10
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 733/932 variables, 199/212 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 97/309 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 36/345 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 13/945 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 0/945 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 945/945 variables, and 361 constraints, problems are : Problem set: 0 solved, 36 unsolved in 15206 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17990ms problems are : Problem set: 0 solved, 36 unsolved
Parikh walk visited 0 properties in 3748 ms.
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 743/743 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 212 transition count 742
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 742
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 210 transition count 741
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 209 transition count 737
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 209 transition count 737
Applied a total of 6 rules in 41 ms. Remains 209 /212 variables (removed 3) and now considering 737/743 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 209/212 places, 737/743 transitions.
RANDOM walk for 4000000 steps (90413 resets) in 42448 ms. (94 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 1247 ms. (320 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400002 steps (1905 resets) in 1054 ms. (379 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1878 resets) in 1184 ms. (337 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1888 resets) in 1053 ms. (379 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 1159 ms. (344 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1893 resets) in 1028 ms. (388 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1861 resets) in 1185 ms. (337 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1879 resets) in 1174 ms. (340 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1874 resets) in 1149 ms. (347 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1850 resets) in 1206 ms. (331 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1889 resets) in 1076 ms. (371 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (1898 resets) in 1309 ms. (305 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (1872 resets) in 1070 ms. (373 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 1233 ms. (324 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1881 resets) in 1223 ms. (326 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1867 resets) in 1288 ms. (310 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1924 resets) in 1084 ms. (368 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1857 resets) in 1083 ms. (369 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400001 steps (1890 resets) in 969 ms. (412 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1827 resets) in 1051 ms. (380 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1893 resets) in 1066 ms. (374 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 1234 ms. (323 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1853 resets) in 1136 ms. (351 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1878 resets) in 1221 ms. (327 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1908 resets) in 1258 ms. (317 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1915 resets) in 1076 ms. (371 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1880 resets) in 1222 ms. (327 steps per ms) remains 35/35 properties
Invariant property smplace_397 does not hold.
Invariant property smplace_396 does not hold.
Invariant property smplace_395 does not hold.
Invariant property smplace_394 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_378 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_376 does not hold.
Invariant property smplace_374 does not hold.
Invariant property smplace_372 does not hold.
Invariant property smplace_348 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_344 does not hold.
Invariant property smplace_343 does not hold.
Invariant property smplace_342 does not hold.
Invariant property smplace_341 does not hold.
Invariant property smplace_340 does not hold.
Invariant property smplace_339 does not hold.
Invariant property smplace_338 does not hold.
Invariant property smplace_337 does not hold.
BEST_FIRST walk for 400002 steps (1877 resets) in 1154 ms. (346 steps per ms) remains 35/35 properties
Invariant property smplace_336 does not hold.
Invariant property smplace_335 does not hold.
Invariant property smplace_334 does not hold.
Invariant property smplace_333 does not hold.
Invariant property smplace_332 does not hold.
Invariant property smplace_331 does not hold.
Invariant property smplace_330 does not hold.
Invariant property smplace_329 does not hold.
Invariant property smplace_328 does not hold.
Invariant property smplace_327 does not hold.
Invariant property smplace_326 does not hold.
Invariant property smplace_325 does not hold.
Invariant property smplace_324 does not hold.
Invariant property smplace_323 does not hold.
Invariant property smplace_322 does not hold.
Invariant property smplace_321 does not hold.
Invariant property smplace_320 does not hold.
Invariant property smplace_319 does not hold.
Invariant property smplace_318 does not hold.
Invariant property smplace_317 does not hold.
Invariant property smplace_316 does not hold.
Invariant property smplace_315 does not hold.
Invariant property smplace_314 does not hold.
Invariant property smplace_313 does not hold.
Invariant property smplace_312 does not hold.
Invariant property smplace_311 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_309 does not hold.
Invariant property smplace_308 does not hold.
Invariant property smplace_307 does not hold.
Invariant property smplace_289 does not hold.
Invariant property smplace_281 does not hold.
Invariant property smplace_278 does not hold.
Invariant property smplace_277 does not hold.
Invariant property smplace_276 does not hold.
Invariant property smplace_275 does not hold.
Invariant property smplace_274 does not hold.
Invariant property smplace_273 does not hold.
Invariant property smplace_272 does not hold.
Invariant property smplace_271 does not hold.
Invariant property smplace_270 does not hold.
Invariant property smplace_269 does not hold.
Invariant property smplace_250 does not hold.
Invariant property smplace_249 does not hold.
Invariant property smplace_248 does not hold.
Invariant property smplace_247 does not hold.
Invariant property smplace_246 does not hold.
Invariant property smplace_245 does not hold.
SDD proceeding with computation,136 properties remain. new max is 262144
SDD size :7.04526e+10 after 2.23069e+11
BEST_FIRST walk for 400003 steps (1897 resets) in 1237 ms. (323 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1894 resets) in 1127 ms. (354 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1879 resets) in 1232 ms. (324 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (1853 resets) in 1350 ms. (296 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (1869 resets) in 1308 ms. (305 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1900 resets) in 1206 ms. (331 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 1067 ms. (374 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1915 resets) in 1271 ms. (314 steps per ms) remains 35/35 properties
Invariant property smplace_381 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_305 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_303 does not hold.
Invariant property smplace_302 does not hold.
Invariant property smplace_282 does not hold.
SDD proceeding with computation,129 properties remain. new max is 262144
SDD size :2.23069e+11 after 1.35589e+12
Interrupted probabilistic random walk after 5697603 steps, run timeout after 78001 ms. (steps per millisecond=73 ) properties seen :2 out of 35
Probabilistic random walk after 5697603 steps, saw 1699671 distinct states, run finished after 78016 ms. (steps per millisecond=73 ) properties seen :2
[2026-05-24 09:48:35] [INFO ] Flow matrix only has 727 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14190850493837777145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16178415741262512501.kers'
[2026-05-24 09:48:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14190850493837777145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16178415741262512501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 727 rows 209 cols 2747 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-24 09:48:35] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16178415741262512501.kers
Total runtime 4 ms.
[2026-05-24 09:48:35] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 133/194 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 727/921 variables, 194/204 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 97/301 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 15/936 variables, 15/316 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/936 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 936/936 variables, and 316 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 133/194 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 727/921 variables, 194/207 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 97/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 16/320 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 15/936 variables, 15/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/936 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 936/936 variables, and 336 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5523ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1111 ms.
Support contains 16 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 737/737 transitions.
Graph (complete) has 1156 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 208 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 207 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 207 transition count 735
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 206 transition count 735
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 205 transition count 734
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 205 transition count 734
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 203 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 201 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 201 transition count 730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 200 transition count 735
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 199 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 199 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 198 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 198 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 197 transition count 712
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 197 transition count 712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 196 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 196 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 195 transition count 703
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 195 transition count 703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 194 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 194 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 193 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 193 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 192 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 192 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 191 transition count 685
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 191 transition count 685
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 190 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 190 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 189 transition count 679
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 189 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 188 transition count 677
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 188 transition count 677
Applied a total of 41 rules in 135 ms. Remains 188 /209 variables (removed 21) and now considering 677/737 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 188/209 places, 677/737 transitions.
RANDOM walk for 4000000 steps (90253 resets) in 35969 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1904 resets) in 838 ms. (476 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1867 resets) in 1024 ms. (390 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1856 resets) in 845 ms. (472 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (1859 resets) in 911 ms. (438 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1898 resets) in 1005 ms. (397 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 845 ms. (472 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1847 resets) in 960 ms. (416 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1886 resets) in 886 ms. (450 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1863 resets) in 951 ms. (420 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 966 ms. (413 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1871 resets) in 924 ms. (432 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1867 resets) in 946 ms. (422 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1875 resets) in 1047 ms. (381 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1865 resets) in 935 ms. (427 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1883 resets) in 803 ms. (497 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1915 resets) in 985 ms. (405 steps per ms) remains 16/16 properties
Invariant property smplace_601 does not hold.
Invariant property smplace_600 does not hold.
Invariant property smplace_599 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_597 does not hold.
Invariant property smplace_596 does not hold.
Invariant property smplace_593 does not hold.
SDD proceeding with computation,122 properties remain. new max is 262144
SDD size :1.35589e+12 after 2.57957e+12
Interrupted probabilistic random walk after 3609649 steps, run timeout after 45001 ms. (steps per millisecond=80 ) properties seen :0 out of 16
Probabilistic random walk after 3609649 steps, saw 1078035 distinct states, run finished after 45001 ms. (steps per millisecond=80 ) properties seen :0
[2026-05-24 09:49:43] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11708806844561129379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14118811583483729981.kers'
[2026-05-24 09:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11708806844561129379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14118811583483729981.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 667 rows 188 cols 2529 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:49:43] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14118811583483729981.kers
Total runtime 4 ms.
[2026-05-24 09:49:43] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 114/175 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 667/842 variables, 175/185 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 92/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/855 variables, 13/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/855 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 290 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 114/175 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 667/842 variables, 175/188 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 13/855 variables, 13/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/855 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 310 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4287 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5492ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1392 ms.
Support contains 16 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 677/677 transitions.
Applied a total of 0 rules in 12 ms. Remains 188 /188 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 188/188 places, 677/677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 677/677 transitions.
Applied a total of 0 rules in 11 ms. Remains 188 /188 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2026-05-24 09:49:50] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 09:49:50] [INFO ] Invariant cache hit.
[2026-05-24 09:49:50] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-24 09:49:50] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 09:49:50] [INFO ] Invariant cache hit.
[2026-05-24 09:49:50] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:49:51] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2026-05-24 09:49:51] [INFO ] Redundant transitions in 73 ms returned [367, 370]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 667 sub problems to find dead transitions.
[2026-05-24 09:49:51] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2358832986834462268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6621464750454189056.kers'
[2026-05-24 09:49:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2358832986834462268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6621464750454189056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:49:51] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6621464750454189056.kers
Total runtime 4 ms.
[2026-05-24 09:49:51] [INFO ] State equation strengthened by 92 read => feed constraints.
SDD proceeding with computation,122 properties remain. new max is 524288
SDD size :2.57957e+12 after 2.57962e+12
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 4 (OVERLAPS) 665/851 variables, 186/208 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 92/300 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/853 variables, and 300 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 4 (OVERLAPS) 665/851 variables, 186/208 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 92/300 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 658/958 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/853 variables, and 958 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 658/667 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61342ms problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 61351ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 188/188 places, 675/677 transitions.
Applied a total of 0 rules in 11 ms. Remains 188 /188 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62579 ms. Remains : 188/188 places, 675/677 transitions.
RANDOM walk for 4000000 steps (91159 resets) in 34224 ms. (116 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1873 resets) in 1005 ms. (397 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1935 resets) in 1062 ms. (376 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (1910 resets) in 1053 ms. (379 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1911 resets) in 884 ms. (451 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1956 resets) in 1084 ms. (368 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1914 resets) in 851 ms. (469 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1955 resets) in 1011 ms. (395 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1859 resets) in 759 ms. (526 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1908 resets) in 1100 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1899 resets) in 984 ms. (406 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1886 resets) in 1040 ms. (384 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1900 resets) in 879 ms. (454 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1906 resets) in 964 ms. (414 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1920 resets) in 1018 ms. (392 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1916 resets) in 991 ms. (403 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1925 resets) in 1186 ms. (336 steps per ms) remains 16/16 properties
Invariant property smplace_592 does not hold.
Invariant property smplace_591 does not hold.
Invariant property smplace_589 does not hold.
Invariant property smplace_588 does not hold.
Invariant property smplace_587 does not hold.
Invariant property smplace_573 does not hold.
Invariant property smplace_572 does not hold.
Invariant property smplace_571 does not hold.
Invariant property smplace_548 does not hold.
Invariant property smplace_547 does not hold.
Invariant property smplace_546 does not hold.
Invariant property smplace_545 does not hold.
Invariant property smplace_544 does not hold.
Invariant property smplace_543 does not hold.
Invariant property smplace_542 does not hold.
Invariant property smplace_541 does not hold.
Invariant property smplace_540 does not hold.
Invariant property smplace_539 does not hold.
Invariant property smplace_538 does not hold.
Invariant property smplace_486 does not hold.
SDD proceeding with computation,102 properties remain. new max is 524288
SDD size :2.57962e+12 after 2.58168e+12
Interrupted probabilistic random walk after 3425092 steps, run timeout after 45001 ms. (steps per millisecond=76 ) properties seen :0 out of 16
Probabilistic random walk after 3425092 steps, saw 1021830 distinct states, run finished after 45001 ms. (steps per millisecond=76 ) properties seen :0
[2026-05-24 09:51:52] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:51:52] [INFO ] Invariant cache hit.
[2026-05-24 09:51:52] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 114/175 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 665/840 variables, 175/185 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 92/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/853 variables, 13/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 114/175 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 665/840 variables, 175/188 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 13/853 variables, 13/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/853 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 310 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4000 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5191ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1183 ms.
Support contains 16 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Applied a total of 0 rules in 21 ms. Remains 188 /188 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 188/188 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Applied a total of 0 rules in 10 ms. Remains 188 /188 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2026-05-24 09:51:59] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:51:59] [INFO ] Invariant cache hit.
[2026-05-24 09:51:59] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-24 09:51:59] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:51:59] [INFO ] Invariant cache hit.
[2026-05-24 09:51:59] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:52:00] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2026-05-24 09:52:00] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1004 ms. Remains : 188/188 places, 675/675 transitions.
RANDOM walk for 400000 steps (9058 resets) in 10204 ms. (39 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2026-05-24 09:52:03] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:52:03] [INFO ] Invariant cache hit.
[2026-05-24 09:52:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 09:52:03] [INFO ] After 242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2026-05-24 09:52:03] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:52:03] [INFO ] After 206ms SMT Verify possible using 92 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 09:52:04] [INFO ] After 928ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 09:52:04] [INFO ] After 1265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 09:52:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 09:52:04] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2026-05-24 09:52:04] [INFO ] After 195ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 09:52:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
TRAPS : Iteration 1
[2026-05-24 09:52:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
TRAPS : Iteration 2
[2026-05-24 09:52:07] [INFO ] After 2734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2026-05-24 09:52:07] [INFO ] After 3138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 4000000 steps (90810 resets) in 33725 ms. (118 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 860 ms. (464 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1909 resets) in 986 ms. (405 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1910 resets) in 1095 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1907 resets) in 870 ms. (459 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1874 resets) in 1054 ms. (379 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1905 resets) in 920 ms. (434 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1915 resets) in 857 ms. (466 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1916 resets) in 1036 ms. (385 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1890 resets) in 912 ms. (438 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (1909 resets) in 1029 ms. (388 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1906 resets) in 858 ms. (465 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1931 resets) in 1138 ms. (351 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (1904 resets) in 884 ms. (451 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1921 resets) in 1008 ms. (396 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1903 resets) in 897 ms. (445 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (1953 resets) in 983 ms. (406 steps per ms) remains 16/16 properties
Detected timeout of ITS tools.
[2026-05-24 09:53:00] [INFO ] Flatten gal took : 84 ms
[2026-05-24 09:53:00] [INFO ] Applying decomposition
[2026-05-24 09:53:00] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16792373833650196986.txt' '-o' '/tmp/graph16792373833650196986.bin' '-w' '/tmp/graph16792373833650196986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16792373833650196986.bin' '-l' '-1' '-v' '-w' '/tmp/graph16792373833650196986.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:53:01] [INFO ] Decomposing Gal with order
[2026-05-24 09:53:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:53:01] [INFO ] Removed a total of 989 redundant transitions.
[2026-05-24 09:53:01] [INFO ] Flatten gal took : 290 ms
[2026-05-24 09:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 72 ms.
[2026-05-24 09:53:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12540692316305143380.gal : 47 ms
[2026-05-24 09:53:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4290211003503529404.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12540692316305143380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4290211003503529404.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4290211003503529404.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :4 after 4
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4 after 13084
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :13084 after 2.30342e+07
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :2.30342e+07 after 6.63968e+07
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :6.63968e+07 after 2.06971e+08
Interrupted probabilistic random walk after 3186685 steps, run timeout after 42001 ms. (steps per millisecond=75 ) properties seen :0 out of 16
Probabilistic random walk after 3186685 steps, saw 948713 distinct states, run finished after 42001 ms. (steps per millisecond=75 ) properties seen :0
[2026-05-24 09:53:04] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:53:04] [INFO ] Invariant cache hit.
[2026-05-24 09:53:04] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 114/175 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 665/840 variables, 175/185 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 92/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 13/853 variables, 13/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 114/175 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 665/840 variables, 175/188 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :2.06971e+08 after 1.50752e+09
At refinement iteration 11 (OVERLAPS) 13/853 variables, 13/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/853 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 310 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3944 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5111ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 1160 ms.
Support contains 16 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Applied a total of 0 rules in 11 ms. Remains 188 /188 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 188/188 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Applied a total of 0 rules in 10 ms. Remains 188 /188 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2026-05-24 09:53:10] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:53:10] [INFO ] Invariant cache hit.
[2026-05-24 09:53:10] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-24 09:53:10] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:53:10] [INFO ] Invariant cache hit.
[2026-05-24 09:53:10] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:53:11] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2026-05-24 09:53:11] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 991 ms. Remains : 188/188 places, 675/675 transitions.
RANDOM walk for 400000 steps (9115 resets) in 3758 ms. (106 steps per ms) remains 16/16 properties
Running SMT prover for 16 properties.
[2026-05-24 09:53:12] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:53:12] [INFO ] Invariant cache hit.
[2026-05-24 09:53:12] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 09:53:13] [INFO ] After 263ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2026-05-24 09:53:13] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:53:13] [INFO ] After 219ms SMT Verify possible using 92 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 09:53:13] [INFO ] After 940ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 09:53:13] [INFO ] After 1289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 09:53:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 09:53:14] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2026-05-24 09:53:14] [INFO ] After 206ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 09:53:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
TRAPS : Iteration 1
[2026-05-24 09:53:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
TRAPS : Iteration 2
[2026-05-24 09:53:17] [INFO ] After 2745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2026-05-24 09:53:17] [INFO ] After 3167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 40000 steps (905 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (190 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 477519 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 477519 steps, saw 146339 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2026-05-24 09:53:20] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 09:53:20] [INFO ] Invariant cache hit.
[2026-05-24 09:53:20] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 167/198 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 651/849 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 92/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/853 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 167/198 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :1.50752e+09 after 1.13482e+10
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 651/849 variables, 179/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 92/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/853 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/853 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/853 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 187 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 186 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 185 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 185 transition count 673
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 184 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 183 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 183 transition count 671
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 182 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 181 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 181 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 180 transition count 660
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 180 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 179 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 179 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 178 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 178 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 177 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 177 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 176 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 176 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 175 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 175 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 174 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 174 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 173 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 173 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 172 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 172 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 171 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 171 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 170 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 170 transition count 618
Applied a total of 35 rules in 61 ms. Remains 170 /188 variables (removed 18) and now considering 618/675 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 170/188 places, 618/675 transitions.
RANDOM walk for 40000 steps (935 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (196 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 653262 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 653262 steps, saw 150407 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
[2026-05-24 09:53:25] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9810711311389146764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16696838478295274127.kers'
[2026-05-24 09:53:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9810711311389146764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16696838478295274127.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 608 rows 170 cols 2311 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-24 09:53:25] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16696838478295274127.kers
Total runtime 4 ms.
[2026-05-24 09:53:25] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 151/180 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 594/774 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/774 variables, 87/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/778 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/778 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/778 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 778/778 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 151/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/774 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/778 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/778 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/778 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 778/778 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 618/618 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 618/618 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 170/170 places, 618/618 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 618/618 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2026-05-24 09:53:25] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:53:25] [INFO ] Invariant cache hit.
[2026-05-24 09:53:26] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-24 09:53:26] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:53:26] [INFO ] Invariant cache hit.
[2026-05-24 09:53:26] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-24 09:53:26] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2026-05-24 09:53:26] [INFO ] Redundant transitions in 8 ms returned []
Running 610 sub problems to find dead transitions.
[2026-05-24 09:53:26] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:53:26] [INFO ] Invariant cache hit.
[2026-05-24 09:53:26] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (OVERLAPS) 608/777 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 87/276 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/778 variables, and 276 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 608/777 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 87/276 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 602/878 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/778 variables, and 878 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 602/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61444 ms. Remains : 170/170 places, 618/618 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 170 vertex of which 31 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 140 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 140 transition count 447
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 140 transition count 437
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 21 place count 139 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 139 transition count 406
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 4 rules applied. Total rules applied 55 place count 139 transition count 402
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 135 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 135 transition count 400
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 134 transition count 400
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 3 with 2 rules applied. Total rules applied 64 place count 133 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 132 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 132 transition count 390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 131 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 130 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 130 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 105 place count 130 transition count 335
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 130 transition count 330
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 117 place count 125 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 125 transition count 322
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 125 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 122 transition count 319
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 122 transition count 319
Applied a total of 135 rules in 78 ms. Remains 122 /170 variables (removed 48) and now considering 319/618 (removed 299) transitions.
Running SMT prover for 1 properties.
[2026-05-24 09:54:27] [INFO ] Flow matrix only has 315 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2568938122429272216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4431220091312444594.kers'
[2026-05-24 09:54:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2568938122429272216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4431220091312444594.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 122 cols 1253 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 09:54:27] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4431220091312444594.kers
Total runtime 2 ms.
[2026-05-24 09:54:27] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 09:54:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2026-05-24 09:54:27] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 09:54:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 09:54:27] [INFO ] After 35ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 09:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
TRAPS : Iteration 1
[2026-05-24 09:54:28] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 09:54:28] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 759 ms.
RANDOM walk for 40000 steps (909 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (201 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 474398 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 474398 steps, saw 145267 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2026-05-24 09:54:31] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8844136227599229415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14627977700155368094.kers'
[2026-05-24 09:54:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8844136227599229415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14627977700155368094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:54:31] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14627977700155368094.kers
Total runtime 4 ms.
[2026-05-24 09:54:31] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/29 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/32 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 167/199 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 650/849 variables, 178/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 92/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/853 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/29 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/32 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 167/199 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 650/849 variables, 178/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 92/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/853 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 184 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 184 transition count 673
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 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 182 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 182 transition count 671
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 181 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 180 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 180 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 660
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 176 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 176 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 175 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 175 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 174 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 174 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 173 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 173 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 172 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 172 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 171 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 171 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 170 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 170 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 169 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 169 transition count 618
Applied a total of 35 rules in 55 ms. Remains 169 /188 variables (removed 19) and now considering 618/675 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 169/188 places, 618/675 transitions.
RANDOM walk for 40000 steps (918 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 662676 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 662676 steps, saw 151887 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
[2026-05-24 09:54:35] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4480331885685809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12574066238339749355.kers'
[2026-05-24 09:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4480331885685809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12574066238339749355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 608 rows 169 cols 2310 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-24 09:54:35] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12574066238339749355.kers
Total runtime 3 ms.
[2026-05-24 09:54:35] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 151/180 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 593/773 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/773 variables, 87/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/777 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/777 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/777 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 87/87 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 151/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 593/773 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 87/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/773 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/773 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/777 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/777 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/777 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 908ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 618/618 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 618/618 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 169/169 places, 618/618 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 618/618 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2026-05-24 09:54:36] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:54:36] [INFO ] Invariant cache hit.
[2026-05-24 09:54:36] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 09:54:36] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:54:36] [INFO ] Invariant cache hit.
[2026-05-24 09:54:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-24 09:54:37] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2026-05-24 09:54:37] [INFO ] Redundant transitions in 8 ms returned []
Running 610 sub problems to find dead transitions.
[2026-05-24 09:54:37] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:54:37] [INFO ] Invariant cache hit.
[2026-05-24 09:54:37] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (OVERLAPS) 608/777 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 87/276 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 276 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 608/777 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 87/276 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 610/886 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 886 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61350 ms. Remains : 169/169 places, 618/618 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 169 vertex of which 31 / 169 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 139 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 139 transition count 447
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 139 transition count 437
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 21 place count 138 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 138 transition count 406
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 4 rules applied. Total rules applied 55 place count 138 transition count 402
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 134 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 134 transition count 400
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 133 transition count 400
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 3 with 2 rules applied. Total rules applied 64 place count 132 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 131 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 131 transition count 390
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 3 with 2 rules applied. Total rules applied 82 place count 130 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 129 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 129 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 105 place count 129 transition count 335
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 129 transition count 330
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 117 place count 124 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 124 transition count 322
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 124 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 121 transition count 319
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 121 transition count 319
Applied a total of 135 rules in 88 ms. Remains 121 /169 variables (removed 48) and now considering 319/618 (removed 299) transitions.
Running SMT prover for 1 properties.
[2026-05-24 09:55:37] [INFO ] Flow matrix only has 315 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15455965654792076807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4837146950899897755.kers'
[2026-05-24 09:55:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15455965654792076807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4837146950899897755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 121 cols 1252 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 09:55:37] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4837146950899897755.kers
Total runtime 2 ms.
[2026-05-24 09:55:38] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 09:55:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 09:55:38] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 09:55:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 09:55:38] [INFO ] After 35ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 09:55:38] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 09:55:38] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 517 ms.
RANDOM walk for 40000 steps (913 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 483237 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 483237 steps, saw 148013 distinct states, run finished after 3005 ms. (steps per millisecond=160 ) properties seen :0
[2026-05-24 09:55:41] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11262971590960422044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13833939784060493311.kers'
[2026-05-24 09:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11262971590960422044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13833939784060493311.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:55:41] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13833939784060493311.kers
Total runtime 6 ms.
[2026-05-24 09:55:41] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 167/198 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 651/849 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 92/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/853 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 167/198 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 651/849 variables, 179/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 92/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/853 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/853 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/853 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1459ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 187 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 186 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 185 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 185 transition count 673
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 2 with 2 rules applied. Total rules applied 7 place count 184 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 183 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 183 transition count 671
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 182 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 181 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 181 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 180 transition count 660
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 180 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 179 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 179 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 178 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 178 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 177 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 177 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 176 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 176 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 175 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 175 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 174 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 174 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 173 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 173 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 172 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 172 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 171 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 171 transition count 620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 170 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 170 transition count 618
Applied a total of 35 rules in 71 ms. Remains 170 /188 variables (removed 18) and now considering 618/675 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 170/188 places, 618/675 transitions.
RANDOM walk for 40000 steps (899 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (192 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 659185 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 659185 steps, saw 151269 distinct states, run finished after 3005 ms. (steps per millisecond=219 ) properties seen :0
[2026-05-24 09:55:46] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13729183656265970163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3579999762155742333.kers'
[2026-05-24 09:55:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13729183656265970163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3579999762155742333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 608 rows 170 cols 2311 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-24 09:55:46] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3579999762155742333.kers
Total runtime 5 ms.
[2026-05-24 09:55:46] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 151/180 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 594/774 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/774 variables, 87/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/778 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/778 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/778 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 778/778 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 151/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 594/774 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/778 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/778 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/778 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 778/778 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1012ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 618/618 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 618/618 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 170/170 places, 618/618 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 618/618 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2026-05-24 09:55:47] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:55:47] [INFO ] Invariant cache hit.
[2026-05-24 09:55:47] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 09:55:47] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:55:47] [INFO ] Invariant cache hit.
[2026-05-24 09:55:47] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-24 09:55:48] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2026-05-24 09:55:48] [INFO ] Redundant transitions in 9 ms returned []
Running 610 sub problems to find dead transitions.
[2026-05-24 09:55:48] [INFO ] Flow matrix only has 608 transitions (discarded 10 similar events)
[2026-05-24 09:55:48] [INFO ] Invariant cache hit.
[2026-05-24 09:55:48] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (OVERLAPS) 608/777 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 87/276 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/778 variables, and 276 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 608/777 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 87/276 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 602/878 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/778 variables, and 878 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 602/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61409 ms. Remains : 170/170 places, 618/618 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 170 vertex of which 31 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 140 transition count 447
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 140 transition count 447
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 140 transition count 437
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 21 place count 139 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 139 transition count 406
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 4 rules applied. Total rules applied 55 place count 139 transition count 402
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 135 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 135 transition count 400
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 134 transition count 400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 133 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 132 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 132 transition count 390
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 3 with 2 rules applied. Total rules applied 82 place count 131 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 130 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 130 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 105 place count 130 transition count 335
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 130 transition count 330
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 117 place count 125 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 125 transition count 322
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 125 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 122 transition count 319
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 122 transition count 319
Applied a total of 135 rules in 73 ms. Remains 122 /170 variables (removed 48) and now considering 319/618 (removed 299) transitions.
Running SMT prover for 1 properties.
[2026-05-24 09:56:48] [INFO ] Flow matrix only has 315 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8324170132364803420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17703811909941000308.kers'
[2026-05-24 09:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8324170132364803420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17703811909941000308.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 122 cols 1253 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 09:56:48] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17703811909941000308.kers
Total runtime 8 ms.
[2026-05-24 09:56:48] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 09:56:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 09:56:49] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 09:56:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 09:56:49] [INFO ] After 35ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 09:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
TRAPS : Iteration 1
[2026-05-24 09:56:49] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 09:56:49] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 516 ms.
RANDOM walk for 40000 steps (928 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 486817 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 486817 steps, saw 148763 distinct states, run finished after 3005 ms. (steps per millisecond=162 ) properties seen :0
[2026-05-24 09:56:52] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14820674121548627320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1916875129279181337.kers'
[2026-05-24 09:56:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14820674121548627320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1916875129279181337.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:56:52] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1916875129279181337.kers
Total runtime 7 ms.
[2026-05-24 09:56:52] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/837 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/853 variables, 16/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/853 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 184 transition count 673
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 184 transition count 673
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 0 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 182 transition count 671
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 182 transition count 671
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 182 transition count 671
Applied a total of 10 rules in 27 ms. Remains 182 /188 variables (removed 6) and now considering 671/675 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 182/188 places, 671/675 transitions.
RANDOM walk for 40000 steps (907 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (199 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505170 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505170 steps, saw 154022 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-24 09:56:56] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6240496554913645111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13521813033187587953.kers'
[2026-05-24 09:56:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6240496554913645111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13521813033187587953.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 661 rows 182 cols 2509 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-24 09:56:56] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13521813033187587953.kers
Total runtime 4 ms.
[2026-05-24 09:56:56] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 661/831 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 92/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/843 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/843 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 661/831 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/831 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/831 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/843 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/843 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/843 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/843 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1015ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 671/671 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 182/182 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 671/671 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2026-05-24 09:56:57] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
[2026-05-24 09:56:57] [INFO ] Invariant cache hit.
[2026-05-24 09:56:57] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-24 09:56:57] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
[2026-05-24 09:56:57] [INFO ] Invariant cache hit.
[2026-05-24 09:56:58] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:56:59] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
[2026-05-24 09:56:59] [INFO ] Redundant transitions in 10 ms returned []
Running 663 sub problems to find dead transitions.
[2026-05-24 09:56:59] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
[2026-05-24 09:56:59] [INFO ] Invariant cache hit.
[2026-05-24 09:56:59] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (OVERLAPS) 661/843 variables, 182/201 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 92/293 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 843/843 variables, and 293 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (OVERLAPS) 661/843 variables, 182/201 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 92/293 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 663/956 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/843 variables, and 956 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61828 ms. Remains : 182/182 places, 671/671 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 182 vertex of which 31 / 182 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 152 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 152 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 152 transition count 490
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 21 place count 151 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 151 transition count 459
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 4 rules applied. Total rules applied 55 place count 151 transition count 455
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 147 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 147 transition count 453
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 146 transition count 453
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 3 with 2 rules applied. Total rules applied 64 place count 145 transition count 452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 144 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 144 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 143 transition count 442
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 142 transition count 403
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 111 place count 142 transition count 377
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 142 transition count 372
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 123 place count 137 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 137 transition count 364
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 137 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 134 transition count 361
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 140 place count 134 transition count 361
Applied a total of 140 rules in 109 ms. Remains 134 /182 variables (removed 48) and now considering 361/671 (removed 310) transitions.
Running SMT prover for 1 properties.
[2026-05-24 09:57:59] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7333399012207901296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2872665413885605364.kers'
[2026-05-24 09:57:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7333399012207901296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2872665413885605364.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 134 cols 1403 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-24 09:57:59] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2872665413885605364.kers
Total runtime 3 ms.
[2026-05-24 09:57:59] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 09:57:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 09:57:59] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 09:57:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 09:57:59] [INFO ] After 61ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 09:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
TRAPS : Iteration 1
[2026-05-24 09:58:00] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 09:58:00] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 688 ms.
RANDOM walk for 40000 steps (890 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (185 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 504537 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 504537 steps, saw 153843 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-24 09:58:03] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-75460464153300903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6487826979094916284.kers'
[2026-05-24 09:58:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-75460464153300903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6487826979094916284.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:58:03] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6487826979094916284.kers
Total runtime 4 ms.
[2026-05-24 09:58:03] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 677
Applied a total of 9 rules in 15 ms. Remains 182 /188 variables (removed 6) and now considering 677/675 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 182/188 places, 677/675 transitions.
RANDOM walk for 40000 steps (917 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 510763 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 510763 steps, saw 155983 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2026-05-24 09:58:07] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10094682983925459788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5311732770160038388.kers'
[2026-05-24 09:58:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10094682983925459788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5311732770160038388.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 667 rows 182 cols 2533 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-24 09:58:07] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5311732770160038388.kers
Total runtime 3 ms.
[2026-05-24 09:58:07] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 667/837 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 93/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/849 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 93/93 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 667/837 variables, 170/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/849 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 677/677 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 182/182 places, 677/677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 677/677 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2026-05-24 09:58:08] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 09:58:08] [INFO ] Invariant cache hit.
[2026-05-24 09:58:08] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 09:58:08] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 09:58:08] [INFO ] Invariant cache hit.
[2026-05-24 09:58:09] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 09:58:09] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2026-05-24 09:58:09] [INFO ] Redundant transitions in 9 ms returned []
Running 669 sub problems to find dead transitions.
[2026-05-24 09:58:09] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 09:58:09] [INFO ] Invariant cache hit.
[2026-05-24 09:58:09] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 667/849 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 849/849 variables, and 296 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 667/849 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 669/965 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 965 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61310 ms. Remains : 182/182 places, 677/677 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 182 vertex of which 31 / 182 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 152 transition count 506
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 152 transition count 506
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 152 transition count 496
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 21 place count 151 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 151 transition count 465
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 4 rules applied. Total rules applied 55 place count 151 transition count 461
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 147 transition count 460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 147 transition count 459
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 146 transition count 459
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 3 with 2 rules applied. Total rules applied 64 place count 145 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 144 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 87 place count 144 transition count 449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 143 transition count 448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 142 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 142 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 118 place count 142 transition count 381
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 142 transition count 376
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 130 place count 137 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 137 transition count 368
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 137 transition count 365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 142 place count 134 transition count 365
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 149 place count 134 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 134 transition count 364
Applied a total of 150 rules in 65 ms. Remains 134 /182 variables (removed 48) and now considering 364/677 (removed 313) transitions.
Running SMT prover for 1 properties.
[2026-05-24 09:59:09] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13715974017199007798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17870453040490608013.kers'
[2026-05-24 09:59:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13715974017199007798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17870453040490608013.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 360 rows 134 cols 1419 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-24 09:59:09] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17870453040490608013.kers
Total runtime 2 ms.
[2026-05-24 09:59:10] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 09:59:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 09:59:10] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 09:59:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 09:59:10] [INFO ] After 30ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 09:59:10] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 09:59:10] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 367 ms.
RANDOM walk for 40000 steps (929 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 492388 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 492388 steps, saw 149975 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2026-05-24 09:59:13] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3974178462892772739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11573694930976685190.kers'
[2026-05-24 09:59:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3974178462892772739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11573694930976685190.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 09:59:13] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11573694930976685190.kers
Total runtime 4 ms.
[2026-05-24 09:59:13] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 998ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Applied a total of 9 rules in 20 ms. Remains 182 /188 variables (removed 6) and now considering 671/675 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 182/188 places, 671/675 transitions.
RANDOM walk for 40000 steps (919 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (195 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 501072 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 501072 steps, saw 152760 distinct states, run finished after 3004 ms. (steps per millisecond=166 ) properties seen :0
[2026-05-24 09:59:17] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8682955716520162966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11001268104847473690.kers'
[2026-05-24 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8682955716520162966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11001268104847473690.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 661 rows 182 cols 2509 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-24 09:59:17] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11001268104847473690.kers
Total runtime 4 ms.
[2026-05-24 09:59:17] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 661/831 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 92/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/843 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/843 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/843 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 661/831 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/831 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/831 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/843 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/843 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/843 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/843 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 671/671 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 182/182 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 671/671 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2026-05-24 09:59:18] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
[2026-05-24 09:59:18] [INFO ] Invariant cache hit.
[2026-05-24 09:59:18] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-24 09:59:18] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
[2026-05-24 09:59:18] [INFO ] Invariant cache hit.
[2026-05-24 09:59:19] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 09:59:19] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2026-05-24 09:59:19] [INFO ] Redundant transitions in 9 ms returned []
Running 663 sub problems to find dead transitions.
[2026-05-24 09:59:19] [INFO ] Flow matrix only has 661 transitions (discarded 10 similar events)
[2026-05-24 09:59:19] [INFO ] Invariant cache hit.
[2026-05-24 09:59:19] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (OVERLAPS) 661/843 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 92/295 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 843/843 variables, and 295 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (OVERLAPS) 661/843 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 92/295 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 663/958 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/843 variables, and 958 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61625 ms. Remains : 182/182 places, 671/671 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 182 vertex of which 31 / 182 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 152 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 152 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 152 transition count 490
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 21 place count 151 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 151 transition count 459
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 4 rules applied. Total rules applied 55 place count 151 transition count 455
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 147 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 147 transition count 453
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 146 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 145 transition count 452
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 144 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 144 transition count 443
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 3 with 2 rules applied. Total rules applied 83 place count 143 transition count 442
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 142 transition count 403
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 111 place count 142 transition count 377
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 142 transition count 372
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 123 place count 137 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 137 transition count 364
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 137 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 134 transition count 361
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 134 transition count 361
Applied a total of 141 rules in 59 ms. Remains 134 /182 variables (removed 48) and now considering 361/671 (removed 310) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:00:20] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18307572197562401846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9461249057164490624.kers'
[2026-05-24 10:00:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18307572197562401846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9461249057164490624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 134 cols 1405 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-24 10:00:20] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9461249057164490624.kers
Total runtime 3 ms.
[2026-05-24 10:00:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:00:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 10:00:20] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:00:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:00:20] [INFO ] After 46ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:00:20] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:00:20] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 466 ms.
RANDOM walk for 40000 steps (921 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442209 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442209 steps, saw 136356 distinct states, run finished after 3004 ms. (steps per millisecond=147 ) properties seen :0
[2026-05-24 10:00:23] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12542269316763558586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15039055546370576997.kers'
[2026-05-24 10:00:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12542269316763558586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15039055546370576997.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:00:23] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15039055546370576997.kers
Total runtime 4 ms.
[2026-05-24 10:00:23] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Applied a total of 11 rules in 32 ms. Remains 181 /188 variables (removed 7) and now considering 670/675 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 181/188 places, 670/675 transitions.
RANDOM walk for 40000 steps (928 resets) in 497 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (197 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 471410 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 471410 steps, saw 144310 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2026-05-24 10:00:28] [INFO ] Flow matrix only has 660 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10361677074268465184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2219765535396575449.kers'
[2026-05-24 10:00:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10361677074268465184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2219765535396575449.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 181 cols 2505 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-24 10:00:28] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2219765535396575449.kers
Total runtime 4 ms.
[2026-05-24 10:00:28] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 660/829 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 92/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/841 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/841 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 660/829 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 92/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/841 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/841 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/841 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1188ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 670/670 transitions.
Applied a total of 0 rules in 13 ms. Remains 181 /181 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 181/181 places, 670/670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 670/670 transitions.
Applied a total of 0 rules in 13 ms. Remains 181 /181 variables (removed 0) and now considering 670/670 (removed 0) transitions.
[2026-05-24 10:00:29] [INFO ] Flow matrix only has 660 transitions (discarded 10 similar events)
[2026-05-24 10:00:29] [INFO ] Invariant cache hit.
[2026-05-24 10:00:29] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 10:00:29] [INFO ] Flow matrix only has 660 transitions (discarded 10 similar events)
[2026-05-24 10:00:29] [INFO ] Invariant cache hit.
[2026-05-24 10:00:30] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 10:00:31] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2026-05-24 10:00:31] [INFO ] Redundant transitions in 9 ms returned []
Running 662 sub problems to find dead transitions.
[2026-05-24 10:00:31] [INFO ] Flow matrix only has 660 transitions (discarded 10 similar events)
[2026-05-24 10:00:31] [INFO ] Invariant cache hit.
[2026-05-24 10:00:31] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 662 unsolved
SMT process timed out in 30479ms, After SMT, problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 30484ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32028 ms. Remains : 181/181 places, 670/670 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 181 vertex of which 31 / 181 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 151 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 151 transition count 499
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 151 transition count 489
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 21 place count 150 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 1 with 31 rules applied. Total rules applied 52 place count 150 transition count 457
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 4 rules applied. Total rules applied 56 place count 150 transition count 453
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 146 transition count 452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 146 transition count 451
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 145 transition count 451
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 3 with 2 rules applied. Total rules applied 65 place count 144 transition count 450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 143 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 82 place count 143 transition count 441
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 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 440
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 141 transition count 401
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 141 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 112 place count 141 transition count 375
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 141 transition count 370
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 124 place count 136 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 136 transition count 362
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 136 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 136 place count 133 transition count 359
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 142 place count 133 transition count 359
Applied a total of 142 rules in 82 ms. Remains 133 /181 variables (removed 48) and now considering 359/670 (removed 311) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:01:01] [INFO ] Flow matrix only has 355 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14157867058319284763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17356892404814837289.kers'
[2026-05-24 10:01:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14157867058319284763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17356892404814837289.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 355 rows 133 cols 1399 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-24 10:01:01] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17356892404814837289.kers
Total runtime 2 ms.
[2026-05-24 10:01:01] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:01:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 10:01:01] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:01:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:01:01] [INFO ] After 58ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:01:02] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:01:02] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 520 ms.
RANDOM walk for 40000 steps (890 resets) in 405 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (189 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460632 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460632 steps, saw 141506 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2026-05-24 10:01:05] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18401329342231568861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5694811396275720245.kers'
[2026-05-24 10:01:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18401329342231568861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5694811396275720245.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:01:05] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5694811396275720245.kers
Total runtime 6 ms.
[2026-05-24 10:01:05] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1141ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Applied a total of 13 rules in 23 ms. Remains 180 /188 variables (removed 8) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 180/188 places, 675/675 transitions.
RANDOM walk for 40000 steps (928 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (200 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485308 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485308 steps, saw 148502 distinct states, run finished after 3003 ms. (steps per millisecond=161 ) properties seen :0
[2026-05-24 10:01:09] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6126839890279889270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6562643510924265798.kers'
[2026-05-24 10:01:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6126839890279889270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6562643510924265798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 180 cols 2527 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-24 10:01:09] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6562643510924265798.kers
Total runtime 4 ms.
[2026-05-24 10:01:09] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/833 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 93/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/845 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/845 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/845 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/833 variables, 168/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 93/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/833 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/845 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/845 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/845 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 845/845 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 943ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 675/675 transitions.
Applied a total of 0 rules in 14 ms. Remains 180 /180 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 180/180 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 675/675 transitions.
Applied a total of 0 rules in 13 ms. Remains 180 /180 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2026-05-24 10:01:10] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 10:01:10] [INFO ] Invariant cache hit.
[2026-05-24 10:01:10] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-24 10:01:10] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 10:01:10] [INFO ] Invariant cache hit.
[2026-05-24 10:01:11] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 10:01:11] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2026-05-24 10:01:11] [INFO ] Redundant transitions in 14 ms returned []
Running 667 sub problems to find dead transitions.
[2026-05-24 10:01:11] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
[2026-05-24 10:01:11] [INFO ] Invariant cache hit.
[2026-05-24 10:01:11] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/845 variables, and 23 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/180 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 4 (OVERLAPS) 665/845 variables, 180/203 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/845 variables, 667/963 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 963 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61682 ms. Remains : 180/180 places, 675/675 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 180 vertex of which 31 / 180 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 150 transition count 504
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 150 transition count 504
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 150 transition count 494
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 21 place count 149 transition count 493
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 1 with 37 rules applied. Total rules applied 58 place count 149 transition count 456
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 4 rules applied. Total rules applied 62 place count 149 transition count 452
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 67 place count 145 transition count 451
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 145 transition count 450
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 144 transition count 450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 143 transition count 449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 142 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 94 place count 142 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 141 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 140 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 140 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 124 place count 140 transition count 374
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 140 transition count 369
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 136 place count 135 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 142 place count 135 transition count 361
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 145 place count 135 transition count 358
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 132 transition count 358
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 132 transition count 358
Applied a total of 154 rules in 52 ms. Remains 132 /180 variables (removed 48) and now considering 358/675 (removed 317) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:02:12] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1709810447541113898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10997185526960873301.kers'
[2026-05-24 10:02:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1709810447541113898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10997185526960873301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 354 rows 132 cols 1397 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 10:02:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10997185526960873301.kers
Total runtime 15 ms.
[2026-05-24 10:02:12] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:02:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 10:02:12] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:02:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:02:12] [INFO ] After 36ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:02:12] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:02:12] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 406 ms.
RANDOM walk for 40000 steps (900 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475563 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475563 steps, saw 145735 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2026-05-24 10:02:15] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17979065194925433443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13367130313022643458.kers'
[2026-05-24 10:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17979065194925433443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13367130313022643458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:02:15] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13367130313022643458.kers
Total runtime 3 ms.
[2026-05-24 10:02:15] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 991ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Applied a total of 15 rules in 21 ms. Remains 179 /188 variables (removed 9) and now considering 661/675 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 179/188 places, 661/675 transitions.
RANDOM walk for 40000 steps (908 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (196 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 525464 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 525464 steps, saw 160190 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2026-05-24 10:02:19] [INFO ] Flow matrix only has 651 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15152678538940985008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-995022605499781537.kers'
[2026-05-24 10:02:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15152678538940985008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-995022605499781537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 651 rows 179 cols 2475 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-24 10:02:19] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-995022605499781537.kers
Total runtime 3 ms.
[2026-05-24 10:02:19] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 651/818 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 91/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/830 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/830 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 651/818 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 91/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/830 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/830 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/830 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1203ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 661/661 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 661/661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 179/179 places, 661/661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 661/661 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 661/661 (removed 0) transitions.
[2026-05-24 10:02:21] [INFO ] Flow matrix only has 651 transitions (discarded 10 similar events)
[2026-05-24 10:02:21] [INFO ] Invariant cache hit.
[2026-05-24 10:02:21] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 10:02:21] [INFO ] Flow matrix only has 651 transitions (discarded 10 similar events)
[2026-05-24 10:02:21] [INFO ] Invariant cache hit.
[2026-05-24 10:02:21] [INFO ] State equation strengthened by 91 read => feed constraints.
[2026-05-24 10:02:22] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2026-05-24 10:02:22] [INFO ] Redundant transitions in 16 ms returned []
Running 653 sub problems to find dead transitions.
[2026-05-24 10:02:22] [INFO ] Flow matrix only has 651 transitions (discarded 10 similar events)
[2026-05-24 10:02:22] [INFO ] Invariant cache hit.
[2026-05-24 10:02:22] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/830 variables, and 22 constraints, problems are : Problem set: 0 solved, 653 unsolved in 30134 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/179 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 653/653 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 653 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 4 (OVERLAPS) 651/830 variables, 179/201 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 91/292 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/830 variables, 653/945 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 830/830 variables, and 945 constraints, problems are : Problem set: 0 solved, 653 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 653/653 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60798ms problems are : Problem set: 0 solved, 653 unsolved
Search for dead transitions found 0 dead transitions in 60808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62044 ms. Remains : 179/179 places, 661/661 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 179 vertex of which 31 / 179 are part of one of the 5 SCC in 9 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 149 transition count 490
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 149 transition count 490
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 149 transition count 480
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 21 place count 148 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 148 transition count 449
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 4 rules applied. Total rules applied 55 place count 148 transition count 445
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 144 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 144 transition count 443
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 143 transition count 443
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 3 with 2 rules applied. Total rules applied 64 place count 142 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 141 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 141 transition count 433
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 3 with 2 rules applied. Total rules applied 82 place count 140 transition count 432
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 139 transition count 394
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 139 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 109 place count 139 transition count 369
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 139 transition count 364
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 121 place count 134 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 134 transition count 356
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 134 transition count 353
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 131 transition count 353
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 131 transition count 353
Applied a total of 139 rules in 141 ms. Remains 131 /179 variables (removed 48) and now considering 353/661 (removed 308) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:03:23] [INFO ] Flow matrix only has 349 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1817071207334257230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13047424220439516088.kers'
[2026-05-24 10:03:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1817071207334257230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13047424220439516088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 349 rows 131 cols 1379 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-24 10:03:23] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13047424220439516088.kers
Total runtime 5 ms.
[2026-05-24 10:03:23] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:03:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-24 10:03:24] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:03:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:03:24] [INFO ] After 55ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:03:24] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:03:24] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 883 ms.
RANDOM walk for 40000 steps (913 resets) in 366 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (201 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386256 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386256 steps, saw 119876 distinct states, run finished after 3005 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-24 10:03:27] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12881676128343212416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11465352228753628226.kers'
[2026-05-24 10:03:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12881676128343212416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11465352228753628226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:03:27] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11465352228753628226.kers
Total runtime 4 ms.
[2026-05-24 10:03:27] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/853 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1768ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Applied a total of 17 rules in 50 ms. Remains 178 /188 variables (removed 10) and now considering 659/675 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 178/188 places, 659/675 transitions.
RANDOM walk for 40000 steps (936 resets) in 358 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (199 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428449 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428449 steps, saw 132336 distinct states, run finished after 3004 ms. (steps per millisecond=142 ) properties seen :0
[2026-05-24 10:03:32] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7668385209968413201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17044931258003458397.kers'
[2026-05-24 10:03:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7668385209968413201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17044931258003458397.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 649 rows 178 cols 2467 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-24 10:03:32] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17044931258003458397.kers
Total runtime 5 ms.
[2026-05-24 10:03:32] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 649/815 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 91/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/827 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/827 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 827/827 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 649/815 variables, 166/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 91/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/815 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/827 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/827 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/827 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 827/827 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 659/659 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 178/178 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 659/659 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2026-05-24 10:03:34] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
[2026-05-24 10:03:34] [INFO ] Invariant cache hit.
[2026-05-24 10:03:35] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-24 10:03:35] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
[2026-05-24 10:03:35] [INFO ] Invariant cache hit.
[2026-05-24 10:03:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2026-05-24 10:03:36] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
[2026-05-24 10:03:36] [INFO ] Redundant transitions in 15 ms returned []
Running 651 sub problems to find dead transitions.
[2026-05-24 10:03:36] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
[2026-05-24 10:03:36] [INFO ] Invariant cache hit.
[2026-05-24 10:03:36] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 178/827 variables, and 23 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/178 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 649/827 variables, 178/201 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 91/292 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 651/943 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 827/827 variables, and 943 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60664ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62160 ms. Remains : 178/178 places, 659/659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 178 vertex of which 31 / 178 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 148 transition count 488
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 148 transition count 488
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 148 transition count 478
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 21 place count 147 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 147 transition count 447
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 4 rules applied. Total rules applied 55 place count 147 transition count 443
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 143 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 143 transition count 441
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 142 transition count 441
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 3 with 2 rules applied. Total rules applied 64 place count 141 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 140 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 140 transition count 431
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 3 with 2 rules applied. Total rules applied 82 place count 139 transition count 430
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 138 transition count 392
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 138 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 109 place count 138 transition count 367
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 138 transition count 362
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 121 place count 133 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 133 transition count 354
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 133 transition count 351
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 130 transition count 351
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 130 transition count 351
Applied a total of 139 rules in 86 ms. Remains 130 /178 variables (removed 48) and now considering 351/659 (removed 308) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:04:36] [INFO ] Flow matrix only has 347 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15913123857534882969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9883749715924881964.kers'
[2026-05-24 10:04:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15913123857534882969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9883749715924881964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 347 rows 130 cols 1371 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-24 10:04:36] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9883749715924881964.kers
Total runtime 3 ms.
[2026-05-24 10:04:37] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:04:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 10:04:37] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:04:37] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:04:37] [INFO ] After 52ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:04:37] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:04:37] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 518 ms.
RANDOM walk for 40000 steps (899 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (194 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 459959 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 459959 steps, saw 141346 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2026-05-24 10:04:40] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3719679543621652739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3832191191388654577.kers'
[2026-05-24 10:04:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3719679543621652739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3832191191388654577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:04:40] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3832191191388654577.kers
Total runtime 4 ms.
[2026-05-24 10:04:40] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 652
Applied a total of 19 rules in 40 ms. Remains 177 /188 variables (removed 11) and now considering 652/675 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 177/188 places, 652/675 transitions.
RANDOM walk for 40000 steps (909 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (201 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 499391 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 499391 steps, saw 152108 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2026-05-24 10:04:44] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3446959736604731858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2190411929590790826.kers'
[2026-05-24 10:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3446959736604731858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2190411929590790826.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 642 rows 177 cols 2441 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-24 10:04:44] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2190411929590790826.kers
Total runtime 3 ms.
[2026-05-24 10:04:44] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 642/807 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 90/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/819 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/819 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 642/807 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 90/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/819 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/819 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/819 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 652/652 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 652/652 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 177/177 places, 652/652 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 652/652 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 652/652 (removed 0) transitions.
[2026-05-24 10:04:46] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2026-05-24 10:04:46] [INFO ] Invariant cache hit.
[2026-05-24 10:04:47] [INFO ] Implicit Places using invariants in 343 ms returned []
[2026-05-24 10:04:47] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2026-05-24 10:04:47] [INFO ] Invariant cache hit.
[2026-05-24 10:04:47] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-24 10:04:48] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
[2026-05-24 10:04:48] [INFO ] Redundant transitions in 17 ms returned []
Running 644 sub problems to find dead transitions.
[2026-05-24 10:04:48] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2026-05-24 10:04:48] [INFO ] Invariant cache hit.
[2026-05-24 10:04:48] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 177/819 variables, and 22 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/177 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 642/819 variables, 177/199 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 90/289 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 644/933 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 933 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 60618ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62347 ms. Remains : 177/177 places, 652/652 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 177 vertex of which 31 / 177 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 147 transition count 481
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 147 transition count 481
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 147 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 146 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 146 transition count 440
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 4 rules applied. Total rules applied 55 place count 146 transition count 436
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 142 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 142 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 141 transition count 434
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 140 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 139 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 139 transition count 424
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 3 with 2 rules applied. Total rules applied 82 place count 138 transition count 423
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 137 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 137 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 108 place count 137 transition count 362
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 137 transition count 357
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 120 place count 132 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 132 transition count 349
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 132 transition count 346
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 132 place count 129 transition count 346
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 138 place count 129 transition count 346
Applied a total of 138 rules in 47 ms. Remains 129 /177 variables (removed 48) and now considering 346/652 (removed 306) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:05:49] [INFO ] Flow matrix only has 342 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8618471045237360731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10528699575225834107.kers'
[2026-05-24 10:05:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8618471045237360731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10528699575225834107.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 129 cols 1353 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-24 10:05:49] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10528699575225834107.kers
Total runtime 2 ms.
[2026-05-24 10:05:49] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:05:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 10:05:49] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:05:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:05:49] [INFO ] After 49ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:05:49] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:05:49] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 363 ms.
RANDOM walk for 40000 steps (898 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (189 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449070 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449070 steps, saw 138035 distinct states, run finished after 3006 ms. (steps per millisecond=149 ) properties seen :0
[2026-05-24 10:05:52] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5245606019991931293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14059970395565752685.kers'
[2026-05-24 10:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5245606019991931293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14059970395565752685.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:05:52] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14059970395565752685.kers
Total runtime 6 ms.
[2026-05-24 10:05:52] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1440ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 176 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 176 transition count 650
Applied a total of 21 rules in 40 ms. Remains 176 /188 variables (removed 12) and now considering 650/675 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 176/188 places, 650/675 transitions.
RANDOM walk for 40000 steps (915 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 457964 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 457964 steps, saw 140890 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2026-05-24 10:05:57] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9450866850240241633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4513899729127288208.kers'
[2026-05-24 10:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9450866850240241633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4513899729127288208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 640 rows 176 cols 2433 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-24 10:05:57] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4513899729127288208.kers
Total runtime 3 ms.
[2026-05-24 10:05:57] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 640/804 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 90/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/816 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/816 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 90/90 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 640/804 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 90/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/816 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/816 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1691ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 650/650 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 176/176 places, 650/650 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 650/650 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 650/650 (removed 0) transitions.
[2026-05-24 10:05:58] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
[2026-05-24 10:05:58] [INFO ] Invariant cache hit.
[2026-05-24 10:05:59] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-24 10:05:59] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
[2026-05-24 10:05:59] [INFO ] Invariant cache hit.
[2026-05-24 10:05:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-24 10:06:00] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
[2026-05-24 10:06:00] [INFO ] Redundant transitions in 12 ms returned []
Running 642 sub problems to find dead transitions.
[2026-05-24 10:06:00] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
[2026-05-24 10:06:00] [INFO ] Invariant cache hit.
[2026-05-24 10:06:00] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/816 variables, and 20 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/176 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (OVERLAPS) 640/816 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 90/286 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 642/928 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/816 variables, and 928 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62228 ms. Remains : 176/176 places, 650/650 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 176 vertex of which 31 / 176 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 146 transition count 479
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 146 transition count 479
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 146 transition count 469
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 21 place count 145 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 145 transition count 438
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 4 rules applied. Total rules applied 55 place count 145 transition count 434
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 141 transition count 433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 141 transition count 432
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 140 transition count 432
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 3 with 2 rules applied. Total rules applied 64 place count 139 transition count 431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 138 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 138 transition count 422
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 3 with 2 rules applied. Total rules applied 82 place count 137 transition count 421
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 136 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 136 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 108 place count 136 transition count 360
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 136 transition count 355
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 120 place count 131 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 131 transition count 347
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 131 transition count 344
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 132 place count 128 transition count 344
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 138 place count 128 transition count 344
Applied a total of 138 rules in 52 ms. Remains 128 /176 variables (removed 48) and now considering 344/650 (removed 306) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:07:01] [INFO ] Flow matrix only has 340 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5893291838617450686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6733231104250185905.kers'
[2026-05-24 10:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5893291838617450686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6733231104250185905.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 128 cols 1345 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-24 10:07:01] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6733231104250185905.kers
Total runtime 2 ms.
[2026-05-24 10:07:01] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:07:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 10:07:01] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:07:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:07:01] [INFO ] After 41ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:07:01] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:07:01] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 404 ms.
RANDOM walk for 40000 steps (908 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 472914 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 472914 steps, saw 144729 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2026-05-24 10:07:04] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17359446937632694928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-304595469358874120.kers'
[2026-05-24 10:07:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17359446937632694928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-304595469358874120.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:07:04] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-304595469358874120.kers
Total runtime 4 ms.
[2026-05-24 10:07:04] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1265ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 176 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 176 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 175 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 175 transition count 643
Applied a total of 23 rules in 43 ms. Remains 175 /188 variables (removed 13) and now considering 643/675 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 175/188 places, 643/675 transitions.
RANDOM walk for 40000 steps (916 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (175 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370128 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370128 steps, saw 115183 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2026-05-24 10:07:09] [INFO ] Flow matrix only has 633 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10471202734766614267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8245914378012593007.kers'
[2026-05-24 10:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10471202734766614267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8245914378012593007.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 633 rows 175 cols 2407 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-24 10:07:09] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8245914378012593007.kers
Total runtime 3 ms.
[2026-05-24 10:07:09] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/796 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 89/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/808 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/808 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/808 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/796 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 89/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/796 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/808 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/808 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/808 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1414ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 643/643 transitions.
Applied a total of 0 rules in 12 ms. Remains 175 /175 variables (removed 0) and now considering 643/643 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 175/175 places, 643/643 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 643/643 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 643/643 (removed 0) transitions.
[2026-05-24 10:07:10] [INFO ] Flow matrix only has 633 transitions (discarded 10 similar events)
[2026-05-24 10:07:10] [INFO ] Invariant cache hit.
[2026-05-24 10:07:11] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-24 10:07:11] [INFO ] Flow matrix only has 633 transitions (discarded 10 similar events)
[2026-05-24 10:07:11] [INFO ] Invariant cache hit.
[2026-05-24 10:07:11] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 10:07:12] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2026-05-24 10:07:12] [INFO ] Redundant transitions in 8 ms returned []
Running 635 sub problems to find dead transitions.
[2026-05-24 10:07:12] [INFO ] Flow matrix only has 633 transitions (discarded 10 similar events)
[2026-05-24 10:07:12] [INFO ] Invariant cache hit.
[2026-05-24 10:07:12] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 635 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/808 variables, and 22 constraints, problems are : Problem set: 0 solved, 635 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/175 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 635/635 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 635 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 4 (OVERLAPS) 633/808 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 89/286 constraints. Problems are: Problem set: 0 solved, 635 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 635/921 constraints. Problems are: Problem set: 0 solved, 635 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 808/808 variables, and 921 constraints, problems are : Problem set: 0 solved, 635 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 635/635 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 635 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62071 ms. Remains : 175/175 places, 643/643 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 175 vertex of which 31 / 175 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 145 transition count 472
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 145 transition count 472
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 145 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 144 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 144 transition count 431
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 4 rules applied. Total rules applied 55 place count 144 transition count 427
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 140 transition count 426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 140 transition count 425
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 139 transition count 425
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 3 with 2 rules applied. Total rules applied 64 place count 138 transition count 424
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 137 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 137 transition count 415
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 3 with 2 rules applied. Total rules applied 82 place count 136 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 135 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 135 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 107 place count 135 transition count 355
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 135 transition count 350
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 119 place count 130 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 130 transition count 342
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 130 transition count 339
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 127 transition count 339
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 127 transition count 339
Applied a total of 137 rules in 50 ms. Remains 127 /175 variables (removed 48) and now considering 339/643 (removed 304) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:08:12] [INFO ] Flow matrix only has 335 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8235425957821419817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1656497687749242511.kers'
[2026-05-24 10:08:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8235425957821419817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1656497687749242511.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 335 rows 127 cols 1327 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 10:08:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1656497687749242511.kers
Total runtime 2 ms.
[2026-05-24 10:08:12] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:08:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 10:08:13] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:08:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:08:13] [INFO ] After 54ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:08:13] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:08:13] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 425 ms.
RANDOM walk for 40000 steps (913 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (189 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 477886 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 477886 steps, saw 146475 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2026-05-24 10:08:16] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4212211503674457061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13016121161947357459.kers'
[2026-05-24 10:08:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4212211503674457061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13016121161947357459.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:08:16] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13016121161947357459.kers
Total runtime 4 ms.
[2026-05-24 10:08:16] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 793ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 176 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 176 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 175 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 175 transition count 643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 174 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 174 transition count 641
Applied a total of 25 rules in 37 ms. Remains 174 /188 variables (removed 14) and now considering 641/675 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 174/188 places, 641/675 transitions.
RANDOM walk for 40000 steps (895 resets) in 367 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (186 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519714 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519714 steps, saw 158790 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2026-05-24 10:08:20] [INFO ] Flow matrix only has 631 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16280260236640769345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12152503307210148740.kers'
[2026-05-24 10:08:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16280260236640769345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12152503307210148740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 631 rows 174 cols 2399 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 10:08:20] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12152503307210148740.kers
Total runtime 3 ms.
[2026-05-24 10:08:20] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 631/793 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 89/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/805 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/805 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 89/89 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 631/793 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 89/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/793 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/805 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/805 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/805 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 641/641 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 174/174 places, 641/641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 641/641 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 641/641 (removed 0) transitions.
[2026-05-24 10:08:21] [INFO ] Flow matrix only has 631 transitions (discarded 10 similar events)
[2026-05-24 10:08:21] [INFO ] Invariant cache hit.
[2026-05-24 10:08:22] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-24 10:08:22] [INFO ] Flow matrix only has 631 transitions (discarded 10 similar events)
[2026-05-24 10:08:22] [INFO ] Invariant cache hit.
[2026-05-24 10:08:22] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 10:08:23] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2026-05-24 10:08:23] [INFO ] Redundant transitions in 12 ms returned []
Running 633 sub problems to find dead transitions.
[2026-05-24 10:08:23] [INFO ] Flow matrix only has 631 transitions (discarded 10 similar events)
[2026-05-24 10:08:23] [INFO ] Invariant cache hit.
[2026-05-24 10:08:23] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/805 variables, and 23 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/174 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 4 (OVERLAPS) 631/805 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 89/286 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 633/919 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 919 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60650ms problems are : Problem set: 0 solved, 633 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62172 ms. Remains : 174/174 places, 641/641 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 174 vertex of which 31 / 174 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 144 transition count 470
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 144 transition count 470
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 144 transition count 460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 143 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 143 transition count 429
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 4 rules applied. Total rules applied 55 place count 143 transition count 425
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 139 transition count 424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 139 transition count 423
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 138 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 137 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 136 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 136 transition count 413
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 3 with 2 rules applied. Total rules applied 82 place count 135 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 134 transition count 376
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 134 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 107 place count 134 transition count 353
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 134 transition count 348
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 119 place count 129 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 129 transition count 340
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 129 transition count 337
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 126 transition count 337
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 126 transition count 337
Applied a total of 137 rules in 57 ms. Remains 126 /174 variables (removed 48) and now considering 337/641 (removed 304) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:09:23] [INFO ] Flow matrix only has 333 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15547378612840245868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13583165449698139850.kers'
[2026-05-24 10:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15547378612840245868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13583165449698139850.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 126 cols 1319 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 10:09:23] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13583165449698139850.kers
Total runtime 2 ms.
[2026-05-24 10:09:24] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:09:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 10:09:24] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:09:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:09:24] [INFO ] After 37ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:09:24] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:09:24] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 347 ms.
RANDOM walk for 40000 steps (884 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (192 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 381701 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 381701 steps, saw 118349 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2026-05-24 10:09:27] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13137607074872109290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10550853151560115109.kers'
[2026-05-24 10:09:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13137607074872109290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10550853151560115109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:09:27] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10550853151560115109.kers
Total runtime 4 ms.
[2026-05-24 10:09:27] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1194ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 176 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 176 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 175 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 175 transition count 643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 174 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 174 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 173 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 173 transition count 634
Applied a total of 27 rules in 101 ms. Remains 173 /188 variables (removed 15) and now considering 634/675 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 173/188 places, 634/675 transitions.
RANDOM walk for 40000 steps (909 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (193 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506986 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506986 steps, saw 154749 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-24 10:09:31] [INFO ] Flow matrix only has 624 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8392737619549928770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13534634341309828133.kers'
[2026-05-24 10:09:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8392737619549928770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13534634341309828133.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 624 rows 173 cols 2373 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-24 10:09:31] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13534634341309828133.kers
Total runtime 3 ms.
[2026-05-24 10:09:31] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 624/785 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 88/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/797 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/797 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/797 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 797/797 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 88/88 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 624/785 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 88/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/785 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/785 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/797 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/797 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/797 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 797/797 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 634/634 transitions.
Applied a total of 0 rules in 14 ms. Remains 173 /173 variables (removed 0) and now considering 634/634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 173/173 places, 634/634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 634/634 transitions.
Applied a total of 0 rules in 12 ms. Remains 173 /173 variables (removed 0) and now considering 634/634 (removed 0) transitions.
[2026-05-24 10:09:33] [INFO ] Flow matrix only has 624 transitions (discarded 10 similar events)
[2026-05-24 10:09:33] [INFO ] Invariant cache hit.
[2026-05-24 10:09:34] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-24 10:09:34] [INFO ] Flow matrix only has 624 transitions (discarded 10 similar events)
[2026-05-24 10:09:34] [INFO ] Invariant cache hit.
[2026-05-24 10:09:34] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 10:09:35] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2026-05-24 10:09:35] [INFO ] Redundant transitions in 8 ms returned []
Running 626 sub problems to find dead transitions.
[2026-05-24 10:09:35] [INFO ] Flow matrix only has 624 transitions (discarded 10 similar events)
[2026-05-24 10:09:35] [INFO ] Invariant cache hit.
[2026-05-24 10:09:35] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 626 unsolved
SMT process timed out in 30370ms, After SMT, problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 30373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32170 ms. Remains : 173/173 places, 634/634 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 173 vertex of which 31 / 173 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 143 transition count 463
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 143 transition count 463
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 143 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 142 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 142 transition count 422
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 4 rules applied. Total rules applied 55 place count 142 transition count 418
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 138 transition count 417
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 138 transition count 416
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 137 transition count 416
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 3 with 2 rules applied. Total rules applied 64 place count 136 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 135 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 135 transition count 406
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 3 with 2 rules applied. Total rules applied 82 place count 134 transition count 405
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 133 transition count 370
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 133 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 133 transition count 348
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 133 transition count 343
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 118 place count 128 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 128 transition count 335
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 128 transition count 332
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 125 transition count 332
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 136 place count 125 transition count 332
Applied a total of 136 rules in 74 ms. Remains 125 /173 variables (removed 48) and now considering 332/634 (removed 302) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:10:05] [INFO ] Flow matrix only has 328 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17959703197909394708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11973622163871023430.kers'
[2026-05-24 10:10:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17959703197909394708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11973622163871023430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 125 cols 1301 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 10:10:05] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11973622163871023430.kers
Total runtime 3 ms.
[2026-05-24 10:10:05] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:10:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 10:10:06] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:10:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:10:06] [INFO ] After 43ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:10:06] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:10:06] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 500 ms.
RANDOM walk for 40000 steps (944 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (182 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 389201 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389201 steps, saw 120766 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2026-05-24 10:10:09] [INFO ] Flow matrix only has 665 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2002575579295283860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1146031630959346851.kers'
[2026-05-24 10:10:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2002575579295283860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1146031630959346851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 188 cols 2521 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 10:10:09] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1146031630959346851.kers
Total runtime 6 ms.
[2026-05-24 10:10:09] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 665/837 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 92/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/853 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/172 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 665/837 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 92/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/853 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 675/675 transitions.
Graph (complete) has 1063 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 2 place count 186 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 183 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 183 transition count 672
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 2 with 2 rules applied. Total rules applied 9 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 181 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 181 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 180 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 179 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 179 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 178 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 178 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 176 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 176 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 175 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 175 transition count 643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 174 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 174 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 173 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 173 transition count 634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 172 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 172 transition count 632
Applied a total of 29 rules in 64 ms. Remains 172 /188 variables (removed 16) and now considering 632/675 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 172/188 places, 632/675 transitions.
RANDOM walk for 40000 steps (889 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (196 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 438152 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438152 steps, saw 135506 distinct states, run finished after 3004 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-24 10:10:13] [INFO ] Flow matrix only has 622 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8179004490241472259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9095068003469349707.kers'
[2026-05-24 10:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8179004490241472259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9095068003469349707.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 622 rows 172 cols 2365 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 10:10:14] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9095068003469349707.kers
Total runtime 4 ms.
[2026-05-24 10:10:14] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/782 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 88/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/794 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/794 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 622/782 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 88/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/794 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/794 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/794 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 632/632 transitions.
Applied a total of 0 rules in 18 ms. Remains 172 /172 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 172/172 places, 632/632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 632/632 transitions.
Applied a total of 0 rules in 12 ms. Remains 172 /172 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2026-05-24 10:10:15] [INFO ] Flow matrix only has 622 transitions (discarded 10 similar events)
[2026-05-24 10:10:15] [INFO ] Invariant cache hit.
[2026-05-24 10:10:15] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-24 10:10:15] [INFO ] Flow matrix only has 622 transitions (discarded 10 similar events)
[2026-05-24 10:10:15] [INFO ] Invariant cache hit.
[2026-05-24 10:10:15] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 10:10:16] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2026-05-24 10:10:16] [INFO ] Redundant transitions in 12 ms returned []
Running 624 sub problems to find dead transitions.
[2026-05-24 10:10:16] [INFO ] Flow matrix only has 622 transitions (discarded 10 similar events)
[2026-05-24 10:10:16] [INFO ] Invariant cache hit.
[2026-05-24 10:10:16] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 624 unsolved
SMT process timed out in 30525ms, After SMT, problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 30527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32166 ms. Remains : 172/172 places, 632/632 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 172 vertex of which 31 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 142 transition count 461
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 142 transition count 461
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 142 transition count 451
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 21 place count 141 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 141 transition count 420
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 4 rules applied. Total rules applied 55 place count 141 transition count 416
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 137 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 137 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 136 transition count 414
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 3 with 2 rules applied. Total rules applied 64 place count 135 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 134 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 134 transition count 404
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 3 with 2 rules applied. Total rules applied 82 place count 133 transition count 403
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 132 transition count 368
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 132 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 132 transition count 346
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 132 transition count 341
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 118 place count 127 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 127 transition count 333
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 127 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 124 transition count 330
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 136 place count 124 transition count 330
Applied a total of 136 rules in 80 ms. Remains 124 /172 variables (removed 48) and now considering 330/632 (removed 302) transitions.
Running SMT prover for 1 properties.
[2026-05-24 10:10:47] [INFO ] Flow matrix only has 326 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15459745354408110472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12893775844593446241.kers'
[2026-05-24 10:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15459745354408110472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12893775844593446241.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 124 cols 1293 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 10:10:47] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12893775844593446241.kers
Total runtime 5 ms.
[2026-05-24 10:10:47] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:10:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 10:10:47] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:10:47] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:10:47] [INFO ] After 51ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:10:47] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:10:47] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 527 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 188 vertex of which 31 / 188 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 158 transition count 504
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 158 transition count 504
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 158 transition count 494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 157 transition count 493
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 51 place count 157 transition count 463
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 4 rules applied. Total rules applied 55 place count 157 transition count 459
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 60 place count 153 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 153 transition count 457
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 152 transition count 457
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 3 with 2 rules applied. Total rules applied 64 place count 151 transition count 456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 150 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 81 place count 150 transition count 447
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 3 with 2 rules applied. Total rules applied 83 place count 149 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 148 transition count 407
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 148 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 111 place count 148 transition count 381
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 148 transition count 376
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 123 place count 143 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 143 transition count 368
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 143 transition count 365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 140 transition count 365
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 140 place count 140 transition count 365
Applied a total of 140 rules in 92 ms. Remains 140 /188 variables (removed 48) and now considering 365/675 (removed 310) transitions.
Running SMT prover for 16 properties.
[2026-05-24 10:10:47] [INFO ] Flow matrix only has 361 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12816411213912337798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7426195356733059718.kers'
[2026-05-24 10:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12816411213912337798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7426195356733059718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 361 rows 140 cols 1415 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 10:10:47] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7426195356733059718.kers
Total runtime 5 ms.
[2026-05-24 10:10:48] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2026-05-24 10:10:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-24 10:10:48] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2026-05-24 10:10:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 10:10:49] [INFO ] After 352ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2026-05-24 10:10:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 1
[2026-05-24 10:10:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
TRAPS : Iteration 2
[2026-05-24 10:10:51] [INFO ] After 2501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2026-05-24 10:10:51] [INFO ] After 3584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
[2026-05-24 10:10:51] [INFO ] Flatten gal took : 48 ms
[2026-05-24 10:10:51] [INFO ] Flatten gal took : 39 ms
[2026-05-24 10:10:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3754033101429288461.gal : 14 ms
[2026-05-24 10:10:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14706159519684969684.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3754033101429288461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14706159519684969684.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14706159519684969684.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :11 after 17
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :17 after 25
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :25 after 31
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :31 after 273
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :273 after 1097
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1097 after 1765
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1765 after 2364
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :2364 after 4319
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :4319 after 7977
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :7977 after 12316
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :12316 after 46381
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :46381 after 292827
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :292827 after 1.23062e+06
Detected timeout of ITS tools.
[2026-05-24 10:11:06] [INFO ] Flatten gal took : 25 ms
[2026-05-24 10:11:06] [INFO ] Applying decomposition
[2026-05-24 10:11:06] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3580650356299413039.txt' '-o' '/tmp/graph3580650356299413039.bin' '-w' '/tmp/graph3580650356299413039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3580650356299413039.bin' '-l' '-1' '-v' '-w' '/tmp/graph3580650356299413039.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:11:07] [INFO ] Decomposing Gal with order
[2026-05-24 10:11:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:11:07] [INFO ] Removed a total of 667 redundant transitions.
[2026-05-24 10:11:07] [INFO ] Flatten gal took : 160 ms
[2026-05-24 10:11:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 13 ms.
[2026-05-24 10:11:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2677086075306809812.gal : 6 ms
[2026-05-24 10:11:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14774996203994427620.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2677086075306809812.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14774996203994427620.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14774996203994427620.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :65 after 378433
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :378433 after 2.70672e+06
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :2.70672e+06 after 1.44567e+08
Invariant property smplace_436 does not hold.
Invariant property smplace_434 does not hold.
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :1.44567e+08 after 3.47449e+09
Invariant property smplace_433 does not hold.
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :3.47449e+09 after 5.24145e+09
Invariant property smplace_512 does not hold.
Invariant property smplace_511 does not hold.
Invariant property smplace_510 does not hold.
Invariant property smplace_509 does not hold.
Invariant property smplace_508 does not hold.
Invariant property smplace_507 does not hold.
Invariant property smplace_506 does not hold.
Invariant property smplace_505 does not hold.
Invariant property smplace_504 does not hold.
Invariant property smplace_503 does not hold.
Invariant property smplace_502 does not hold.
Invariant property smplace_501 does not hold.
Invariant property smplace_500 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.04634e+09,10.5789,199744,1252,150,355618,2046,718,737792,106,7679,0
Total reachable state count : 7046338170

Verifying 16 reachability properties.
Invariant property smplace_433 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_433,2.93595e+06,10.6088,199744,426,78,355618,2046,726,737792,110,7679,0
Invariant property smplace_434 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_434,2.93595e+06,10.6118,199744,426,79,355618,2046,734,737792,113,7679,0
Invariant property smplace_436 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_436,2.93595e+06,10.6125,199744,426,78,355618,2046,742,737792,116,7679,0
Invariant property smplace_500 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_500,2.05197e+07,10.6131,199744,436,80,355618,2046,748,737792,116,7679,0
Invariant property smplace_501 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_501,1.13399e+06,10.6137,199744,79,68,355618,2046,752,737792,116,7679,0
Invariant property smplace_502 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_502,2.05197e+07,10.6145,199744,436,80,355618,2046,756,737792,116,7679,0
Invariant property smplace_503 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_503,2.17088e+07,10.6151,199744,404,78,355618,2046,760,737792,116,7679,0
Invariant property smplace_504 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_504,2.05197e+07,10.6157,199744,436,80,355618,2046,768,737792,119,7679,0
Invariant property smplace_505 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_505,2.17514e+07,10.6162,199744,394,78,355618,2046,770,737792,119,7679,0
Invariant property smplace_506 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_506,2.05517e+07,10.6168,199744,426,80,355618,2046,774,737792,119,7679,0
Invariant property smplace_507 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_507,2.28929e+07,10.6173,199744,353,73,355618,2046,776,737792,119,7679,0
Invariant property smplace_508 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_508,2.01513e+07,10.6179,199744,468,80,355618,2046,778,737792,119,7679,0
Invariant property smplace_509 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_509,2.32933e+07,10.6184,199744,305,72,355618,2046,780,737792,119,7679,0
Invariant property smplace_510 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_510,2.05517e+07,10.619,199744,426,80,355618,2046,782,737792,119,7679,0
Invariant property smplace_511 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_511,2.32933e+07,10.6194,199744,304,72,355618,2046,784,737792,119,7679,0
Invariant property smplace_512 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_512,2.05517e+07,10.62,199744,426,80,355618,2046,786,737792,119,7679,0
Over-approximation ignoring read arcs solved 0 properties in 30099 ms.
[2026-05-24 10:11:18] [INFO ] Flatten gal took : 23 ms
[2026-05-24 10:11:18] [INFO ] Flatten gal took : 21 ms
[2026-05-24 10:11:18] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7181353254610970190.gal : 5 ms
[2026-05-24 10:11:18] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10739552409735257922.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7181353254610970190.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10739552409735257922.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability10739552409735257922.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :17 after 20
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :23 after 26
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :26 after 29
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :29 after 91
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :91 after 144
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :144 after 1369
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1369 after 2482
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :2482 after 5707
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :5707 after 20551
SDD proceeding with computation,16 properties remain. new max is 8192
Detected timeout of ITS tools.
[2026-05-24 10:11:21] [INFO ] Flatten gal took : 21 ms
[2026-05-24 10:11:21] [INFO ] Applying decomposition
[2026-05-24 10:11:21] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3989076286450863079.txt' '-o' '/tmp/graph3989076286450863079.bin' '-w' '/tmp/graph3989076286450863079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3989076286450863079.bin' '-l' '-1' '-v' '-w' '/tmp/graph3989076286450863079.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:11:21] [INFO ] Decomposing Gal with order
[2026-05-24 10:11:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:11:21] [INFO ] Removed a total of 1252 redundant transitions.
[2026-05-24 10:11:21] [INFO ] Flatten gal took : 62 ms
[2026-05-24 10:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 21 ms.
[2026-05-24 10:11:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18176735236963819805.gal : 8 ms
[2026-05-24 10:11:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17591995482863670242.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18176735236963819805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17591995482863670242.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability17591995482863670242.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 73
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :73 after 817
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :817 after 817
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :817 after 6657
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :6657 after 314369
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :314369 after 1.47167e+07
Detected timeout of ITS tools.
[2026-05-24 10:11:24] [INFO ] Flatten gal took : 39 ms
[2026-05-24 10:11:24] [INFO ] Flatten gal took : 19 ms
[2026-05-24 10:11:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18256364194062892444.gal : 4 ms
[2026-05-24 10:11:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9395780613839282247.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18256364194062892444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9395780613839282247.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability9395780613839282247.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :17 after 20
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :23 after 26
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :26 after 29
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :29 after 91
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :91 after 144
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :144 after 1369
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1369 after 2482
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :2482 after 5707
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :5707 after 20551
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :20551 after 46403
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :46403 after 98852
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :98852 after 266528
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :266528 after 487872
Detected timeout of ITS tools.
[2026-05-24 10:11:54] [INFO ] Flatten gal took : 18 ms
[2026-05-24 10:11:54] [INFO ] Applying decomposition
[2026-05-24 10:11:54] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11958358416140916069.txt' '-o' '/tmp/graph11958358416140916069.bin' '-w' '/tmp/graph11958358416140916069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11958358416140916069.bin' '-l' '-1' '-v' '-w' '/tmp/graph11958358416140916069.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:11:54] [INFO ] Decomposing Gal with order
[2026-05-24 10:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:11:54] [INFO ] Removed a total of 1252 redundant transitions.
[2026-05-24 10:11:54] [INFO ] Flatten gal took : 75 ms
[2026-05-24 10:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 36 ms.
[2026-05-24 10:11:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3045492520755047015.gal : 7 ms
[2026-05-24 10:11:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9826067619878700407.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3045492520755047015.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9826067619878700407.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability9826067619878700407.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :1 after 25
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :25 after 97
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :97 after 4609
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :4609 after 31745
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :31745 after 798721
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :798721 after 1.35129e+07
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1.35129e+07 after 2.35285e+09
Detected timeout of ITS tools.
[2026-05-24 10:12:24] [INFO ] Flatten gal took : 24 ms
[2026-05-24 10:12:24] [INFO ] Flatten gal took : 20 ms
[2026-05-24 10:12:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8373713018112991178.gal : 5 ms
[2026-05-24 10:12:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1369690228244694479.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8373713018112991178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1369690228244694479.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability1369690228244694479.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :17 after 20
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :20 after 23
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :23 after 26
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :26 after 29
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :29 after 91
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :91 after 144
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :144 after 1369
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1369 after 2482
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :2482 after 5707
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :5707 after 20551
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :20551 after 46403
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :46403 after 98852
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :98852 after 266528
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :266528 after 487872

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="FireWire-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 FireWire-PT-20, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-smll-177955811000188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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