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.r194-tall-177969914000364.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 NoC3x3-PT-7B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.1K Mar 8 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 8 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 8 06:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 8 06:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 16 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 8 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 8 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 8 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:16 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 2.0M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779765168125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 03:12:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 03:12:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 03:12:49] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2026-05-26 03:12:49] [INFO ] Transformed 7014 places.
[2026-05-26 03:12:49] [INFO ] Transformed 8833 transitions.
[2026-05-26 03:12:49] [INFO ] Found NUPN structural information;
[2026-05-26 03:12:49] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 41 out of 7014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1855 places :
Symmetric choice reduction at 0 with 1855 rule applications. Total rules 1855 place count 5159 transition count 6978
Iterating global reduction 0 with 1855 rules applied. Total rules applied 3710 place count 5159 transition count 6978
Discarding 488 places :
Symmetric choice reduction at 0 with 488 rule applications. Total rules 4198 place count 4671 transition count 6490
Iterating global reduction 0 with 488 rules applied. Total rules applied 4686 place count 4671 transition count 6490
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 4768 place count 4589 transition count 6326
Iterating global reduction 0 with 82 rules applied. Total rules applied 4850 place count 4589 transition count 6326
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 4932 place count 4507 transition count 6244
Iterating global reduction 0 with 82 rules applied. Total rules applied 5014 place count 4507 transition count 6244
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 5095 place count 4426 transition count 6163
Iterating global reduction 0 with 81 rules applied. Total rules applied 5176 place count 4426 transition count 6163
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 5257 place count 4345 transition count 6034
Iterating global reduction 0 with 81 rules applied. Total rules applied 5338 place count 4345 transition count 6034
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 5415 place count 4268 transition count 5880
Iterating global reduction 0 with 77 rules applied. Total rules applied 5492 place count 4268 transition count 5880
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 5510 place count 4268 transition count 5862
Applied a total of 5510 rules in 4503 ms. Remains 4268 /7014 variables (removed 2746) and now considering 5862/8833 (removed 2971) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12804343658193074344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10118082032739735377.kers'
[2026-05-26 03:12:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12804343658193074344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10118082032739735377.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5862 rows 4268 cols 13051 entries
Finished phase 1 with 4202 SingleSign rule and 0 generalized
[2026-05-26 03:12:54] [INFO ] Computed 66 invariants in 23 ms
Computed 66 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-10118082032739735377.kers
Total runtime 28 ms.
[2026-05-26 03:12:56] [INFO ] Implicit Places using invariants in 2017 ms returned []
[2026-05-26 03:12:56] [INFO ] Invariant cache hit.
[2026-05-26 03:13:00] [INFO ] Implicit Places using invariants and state equation in 4181 ms returned []
Implicit Place search using SMT with State Equation took 6239 ms to find 0 implicit places.
Running 5861 sub problems to find dead transitions.
[2026-05-26 03:13:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4267/10130 variables, and 0 constraints, problems are : Problem set: 0 solved, 5861 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4268 constraints, PredecessorRefiner: 5861/5861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5861 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4267/10130 variables, and 0 constraints, problems are : Problem set: 0 solved, 5861 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4268 constraints, PredecessorRefiner: 0/5861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63328ms problems are : Problem set: 0 solved, 5861 unsolved
Search for dead transitions found 0 dead transitions in 63392ms
Starting structural reductions in LTL mode, iteration 1 : 4268/7014 places, 5862/8833 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74229 ms. Remains : 4268/7014 places, 5862/8833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Applied a total of 0 rules in 306 ms. Remains 4268 /4268 variables (removed 0) and now considering 5862/5862 (removed 0) transitions.
[2026-05-26 03:14:04] [INFO ] Invariant cache hit.
[2026-05-26 03:14:06] [INFO ] Implicit Places using invariants in 1474 ms returned []
[2026-05-26 03:14:06] [INFO ] Invariant cache hit.
[2026-05-26 03:14:10] [INFO ] Implicit Places using invariants and state equation in 3920 ms returned []
Implicit Place search using SMT with State Equation took 5408 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5725 ms. Remains : 4268/4268 places, 5862/5862 transitions.
Support contains 41 out of 4268 places after structural reductions.
[2026-05-26 03:14:10] [INFO ] Flatten gal took : 255 ms
[2026-05-26 03:14:10] [INFO ] Flatten gal took : 148 ms
[2026-05-26 03:14:11] [INFO ] Input system was already deterministic with 5862 transitions.
Support contains 40 out of 4268 places (down from 41) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 42 to 41
RANDOM walk for 40000 steps (13 resets) in 2281 ms. (17 steps per ms) remains 21/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
[2026-05-26 03:14:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 2112/2134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2134/4268 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4268 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 5862/10130 variables, 4268/4334 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10130/10130 variables, and 4334 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4268/4268 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 2112/2134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2134/4268 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4268 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4268/10130 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/4268 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10069ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 4268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Graph (trivial) has 5117 edges and 4268 vertex of which 3178 / 4268 are part of one of the 33 SCC in 18 ms
Free SCC test removed 3145 places
Drop transitions (Empty/Sink Transition effects.) removed 4094 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 4252 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 1123 transition count 1592
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 36 rules applied. Total rules applied 55 place count 1105 transition count 1574
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 68 place count 1094 transition count 1572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 1093 transition count 1572
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 69 place count 1093 transition count 1524
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 165 place count 1045 transition count 1524
Discarding 266 places :
Symmetric choice reduction at 4 with 266 rule applications. Total rules 431 place count 779 transition count 1126
Iterating global reduction 4 with 266 rules applied. Total rules applied 697 place count 779 transition count 1126
Discarding 192 places :
Symmetric choice reduction at 4 with 192 rule applications. Total rules 889 place count 587 transition count 891
Iterating global reduction 4 with 192 rules applied. Total rules applied 1081 place count 587 transition count 891
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 4 with 192 rules applied. Total rules applied 1273 place count 587 transition count 699
Performed 152 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 5 with 304 rules applied. Total rules applied 1577 place count 435 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1579 place count 435 transition count 538
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1580 place count 434 transition count 537
Iterating global reduction 6 with 1 rules applied. Total rules applied 1581 place count 434 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1582 place count 434 transition count 536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1588 place count 431 transition count 533
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1590 place count 431 transition count 531
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1594 place count 429 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1595 place count 429 transition count 528
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 1609 place count 422 transition count 546
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1618 place count 422 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 1638 place count 422 transition count 517
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1641 place count 419 transition count 514
Iterating global reduction 10 with 3 rules applied. Total rules applied 1644 place count 419 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1646 place count 418 transition count 525
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1649 place count 418 transition count 522
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1650 place count 417 transition count 521
Iterating global reduction 10 with 1 rules applied. Total rules applied 1651 place count 417 transition count 521
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1652 place count 417 transition count 520
Free-agglomeration rule applied 202 times.
Iterating global reduction 10 with 202 rules applied. Total rules applied 1854 place count 417 transition count 318
Reduce places removed 202 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 577 edges and 215 vertex of which 150 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Iterating post reduction 10 with 240 rules applied. Total rules applied 2094 place count 150 transition count 260
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 11 with 68 rules applied. Total rules applied 2162 place count 150 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 12 with 11 rules applied. Total rules applied 2173 place count 150 transition count 181
Graph (complete) has 373 edges and 150 vertex of which 136 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 2174 place count 136 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 2184 place count 136 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2184 place count 136 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2186 place count 135 transition count 164
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 2192 place count 135 transition count 158
Reduce places removed 6 places and 0 transitions.
Graph (complete) has 323 edges and 129 vertex of which 102 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Iterating post reduction 14 with 7 rules applied. Total rules applied 2199 place count 102 transition count 143
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 15 with 29 rules applied. Total rules applied 2228 place count 102 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2229 place count 101 transition count 113
Reduce places removed 10 places and 0 transitions.
Graph (trivial) has 25 edges and 91 vertex of which 7 / 91 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 16 with 19 rules applied. Total rules applied 2248 place count 86 transition count 105
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 17 with 19 rules applied. Total rules applied 2267 place count 78 transition count 94
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 18 with 2 rules applied. Total rules applied 2269 place count 77 transition count 93
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2271 place count 77 transition count 91
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2274 place count 75 transition count 90
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 2277 place count 75 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 2280 place count 75 transition count 87
Applied a total of 2280 rules in 461 ms. Remains 75 /4268 variables (removed 4193) and now considering 87/5862 (removed 5775) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 75/4268 places, 87/5862 transitions.
RANDOM walk for 8252 steps (2 resets) in 50 ms. (161 steps per ms) remains 0/21 properties
FORMULA NoC3x3-PT-7B-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-7B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Graph (trivial) has 5163 edges and 4268 vertex of which 3268 / 4268 are part of one of the 33 SCC in 5 ms
Free SCC test removed 3235 places
Ensure Unique test removed 4360 transitions
Reduce isomorphic transitions removed 4360 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1032 transition count 1499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1030 transition count 1499
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 5 place count 1030 transition count 1462
Deduced a syphon composed of 37 places in 8 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 79 place count 993 transition count 1462
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 356 place count 716 transition count 1053
Iterating global reduction 2 with 277 rules applied. Total rules applied 633 place count 716 transition count 1053
Discarding 203 places :
Symmetric choice reduction at 2 with 203 rule applications. Total rules 836 place count 513 transition count 805
Iterating global reduction 2 with 203 rules applied. Total rules applied 1039 place count 513 transition count 805
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 2 with 203 rules applied. Total rules applied 1242 place count 513 transition count 602
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 1500 place count 384 transition count 473
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1502 place count 382 transition count 471
Iterating global reduction 3 with 2 rules applied. Total rules applied 1504 place count 382 transition count 471
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1506 place count 382 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1507 place count 381 transition count 468
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 372 vertex of which 48 / 372 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1517 place count 348 transition count 468
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1565 place count 348 transition count 420
Applied a total of 1565 rules in 204 ms. Remains 348 /4268 variables (removed 3920) and now considering 420/5862 (removed 5442) transitions.
[2026-05-26 03:14:23] [INFO ] Flow matrix only has 387 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13447670209367256568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2234023659367773960.kers'
[2026-05-26 03:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13447670209367256568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2234023659367773960.kers]
Normalized transition count is 386 out of 387 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 348 cols 1142 entries
Finished phase 1 with 291 SingleSign rule and 0 generalized
[2026-05-26 03:14:23] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2234023659367773960.kers
Total runtime 1 ms.
[2026-05-26 03:14:23] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-26 03:14:23] [INFO ] Flow matrix only has 387 transitions (discarded 33 similar events)
[2026-05-26 03:14:23] [INFO ] Invariant cache hit.
[2026-05-26 03:14:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 03:14:23] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2026-05-26 03:14:23] [INFO ] Redundant transitions in 30 ms returned []
Running 202 sub problems to find dead transitions.
[2026-05-26 03:14:23] [INFO ] Flow matrix only has 387 transitions (discarded 33 similar events)
[2026-05-26 03:14:23] [INFO ] Invariant cache hit.
[2026-05-26 03:14:23] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 33/348 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 386/734 variables, 348/405 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/734 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/735 variables, and 419 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16466 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 348/348 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 33/348 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 386/734 variables, 348/405 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 202/621 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/734 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/735 variables, and 621 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16918 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 348/348 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33436ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 33437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 348/4268 places, 420/5862 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34108 ms. Remains : 348/4268 places, 420/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-00 finished in 34471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&(p1 U (G(p1)||(p1&&G(p2))))))))'
Support contains 3 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4246 transition count 5834
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4246 transition count 5834
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4246 transition count 5833
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 4238 transition count 5824
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 4238 transition count 5824
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 4233 transition count 5819
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 4233 transition count 5819
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 4228 transition count 5813
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 4228 transition count 5813
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 4224 transition count 5806
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 4224 transition count 5806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 4223 transition count 5804
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 4223 transition count 5804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 4223 transition count 5803
Applied a total of 92 rules in 2911 ms. Remains 4223 /4268 variables (removed 45) and now considering 5803/5862 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7816951942030701365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15754586767497585836.kers'
[2026-05-26 03:15:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7816951942030701365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15754586767497585836.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5803 rows 4223 cols 12923 entries
Finished phase 1 with 4157 SingleSign rule and 0 generalized
[2026-05-26 03:15:00] [INFO ] Computed 66 invariants in 25 ms
Computed 66 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-15754586767497585836.kers
Total runtime 34 ms.
[2026-05-26 03:15:02] [INFO ] Implicit Places using invariants in 1473 ms returned []
[2026-05-26 03:15:02] [INFO ] Invariant cache hit.
[2026-05-26 03:15:06] [INFO ] Implicit Places using invariants and state equation in 4039 ms returned []
Implicit Place search using SMT with State Equation took 5526 ms to find 0 implicit places.
Running 5802 sub problems to find dead transitions.
[2026-05-26 03:15:06] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4222/10026 variables, and 0 constraints, problems are : Problem set: 0 solved, 5802 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4223 constraints, PredecessorRefiner: 5802/5802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5802 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4222/10026 variables, and 0 constraints, problems are : Problem set: 0 solved, 5802 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4223 constraints, PredecessorRefiner: 0/5802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63225ms problems are : Problem set: 0 solved, 5802 unsolved
Search for dead transitions found 0 dead transitions in 63255ms
Starting structural reductions in LTL mode, iteration 1 : 4223/4268 places, 5803/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71717 ms. Remains : 4223/4268 places, 5803/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&(p1 U (G(p1)||(p1&&G(p2))))))))'
Stuttering acceptance computed with spot in 1215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-01
Stuttering criterion allowed to conclude after 2734 steps with 0 reset in 26 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-01 finished in 73069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 4268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Graph (trivial) has 5163 edges and 4268 vertex of which 3202 / 4268 are part of one of the 33 SCC in 5 ms
Free SCC test removed 3169 places
Ensure Unique test removed 4264 transitions
Reduce isomorphic transitions removed 4264 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 1098 transition count 1582
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 28 rules applied. Total rules applied 44 place count 1083 transition count 1569
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 52 place count 1075 transition count 1569
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 52 place count 1075 transition count 1518
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 154 place count 1024 transition count 1518
Discarding 272 places :
Symmetric choice reduction at 3 with 272 rule applications. Total rules 426 place count 752 transition count 1114
Iterating global reduction 3 with 272 rules applied. Total rules applied 698 place count 752 transition count 1114
Discarding 199 places :
Symmetric choice reduction at 3 with 199 rule applications. Total rules 897 place count 553 transition count 869
Iterating global reduction 3 with 199 rules applied. Total rules applied 1096 place count 553 transition count 869
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 1294 place count 553 transition count 671
Performed 150 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 4 with 300 rules applied. Total rules applied 1594 place count 403 transition count 517
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1598 place count 403 transition count 513
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1600 place count 401 transition count 511
Iterating global reduction 5 with 2 rules applied. Total rules applied 1602 place count 401 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1604 place count 401 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1610 place count 398 transition count 506
Performed 11 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 11 places in 10 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1632 place count 387 transition count 538
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 36 rules applied. Total rules applied 1668 place count 387 transition count 502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1670 place count 386 transition count 516
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1683 place count 386 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1689 place count 386 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1690 place count 385 transition count 496
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 264 edges and 376 vertex of which 48 / 376 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 8 with 10 rules applied. Total rules applied 1700 place count 352 transition count 496
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 1748 place count 352 transition count 448
Applied a total of 1748 rules in 357 ms. Remains 352 /4268 variables (removed 3916) and now considering 448/5862 (removed 5414) transitions.
[2026-05-26 03:16:11] [INFO ] Flow matrix only has 416 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1584401783602551413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8656220014221346868.kers'
[2026-05-26 03:16:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1584401783602551413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8656220014221346868.kers]
Normalized transition count is 415 out of 416 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 415 rows 352 cols 1248 entries
Finished phase 1 with 295 SingleSign rule and 0 generalized
[2026-05-26 03:16:11] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8656220014221346868.kers
Total runtime 2 ms.
[2026-05-26 03:16:11] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-26 03:16:11] [INFO ] Flow matrix only has 416 transitions (discarded 32 similar events)
[2026-05-26 03:16:11] [INFO ] Invariant cache hit.
[2026-05-26 03:16:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 03:16:11] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2026-05-26 03:16:11] [INFO ] Redundant transitions in 7 ms returned []
Running 232 sub problems to find dead transitions.
[2026-05-26 03:16:11] [INFO ] Flow matrix only has 416 transitions (discarded 32 similar events)
[2026-05-26 03:16:11] [INFO ] Invariant cache hit.
[2026-05-26 03:16:11] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 33/352 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 415/767 variables, 352/409 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 14/423 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/767 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 767/768 variables, and 423 constraints, problems are : Problem set: 0 solved, 232 unsolved in 19348 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 352/352 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 33/352 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 415/767 variables, 352/409 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 14/423 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 232/655 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/767 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/767 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/768 variables, and 655 constraints, problems are : Problem set: 0 solved, 232 unsolved in 19913 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 352/352 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39284ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 39289ms
Starting structural reductions in SI_LTL mode, iteration 1 : 352/4268 places, 448/5862 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40452 ms. Remains : 352/4268 places, 448/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-02 finished in 40547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(p1&&G(p2))))))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4245 transition count 5832
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4245 transition count 5832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4245 transition count 5831
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 4237 transition count 5822
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 4237 transition count 5822
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 4232 transition count 5817
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 4232 transition count 5817
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 4227 transition count 5811
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 4227 transition count 5811
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 4223 transition count 5804
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 4223 transition count 5804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 4222 transition count 5802
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 4222 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 4222 transition count 5801
Applied a total of 94 rules in 2622 ms. Remains 4222 /4268 variables (removed 46) and now considering 5801/5862 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7713671868427147626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2953856611227930872.kers'
[2026-05-26 03:16:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7713671868427147626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2953856611227930872.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5801 rows 4222 cols 12919 entries
Finished phase 1 with 4156 SingleSign rule and 0 generalized
[2026-05-26 03:16:53] [INFO ] Computed 66 invariants in 23 ms
Computed 66 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-2953856611227930872.kers
Total runtime 30 ms.
[2026-05-26 03:16:55] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2026-05-26 03:16:55] [INFO ] Invariant cache hit.
[2026-05-26 03:16:59] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned []
Implicit Place search using SMT with State Equation took 5434 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2026-05-26 03:16:59] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4221/10023 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4221/10023 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62755ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 62769ms
Starting structural reductions in LTL mode, iteration 1 : 4222/4268 places, 5801/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70838 ms. Remains : 4222/4268 places, 5801/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-03
Product exploration explored 100000 steps with 45 reset in 468 ms.
Product exploration explored 100000 steps with 42 reset in 568 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 12 factoid took 82 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (14 resets) in 1067 ms. (37 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
[2026-05-26 03:18:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3926/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5801/10023 variables, 4222/4288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10023 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/10023 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10023/10023 variables, and 4288 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3042 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3926/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5801/10023 variables, 4222/4289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10023 variables, 4/4293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10023 variables, 0/4293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10023/10023 variables, and 4293 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8098ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 4222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Graph (trivial) has 5106 edges and 4222 vertex of which 3231 / 4222 are part of one of the 33 SCC in 1 ms
Free SCC test removed 3198 places
Drop transitions (Empty/Sink Transition effects.) removed 4185 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 4344 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 1024 transition count 1419
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 986 transition count 1419
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 349 place count 714 transition count 1011
Iterating global reduction 0 with 272 rules applied. Total rules applied 621 place count 714 transition count 1011
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 820 place count 515 transition count 770
Iterating global reduction 0 with 199 rules applied. Total rules applied 1019 place count 515 transition count 770
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 1218 place count 515 transition count 571
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 1 with 264 rules applied. Total rules applied 1482 place count 383 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
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 1484 place count 382 transition count 453
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1486 place count 382 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 1493 place count 382 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1495 place count 381 transition count 455
Free-agglomeration rule applied 201 times.
Iterating global reduction 2 with 201 rules applied. Total rules applied 1696 place count 381 transition count 254
Reduce places removed 201 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 492 edges and 180 vertex of which 16 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.0 ms
Discarding 164 places :
Also discarding 167 output transitions
Drop transitions (Output transitions of discarded places.) removed 167 transitions
Iterating post reduction 2 with 238 rules applied. Total rules applied 1934 place count 16 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 1969 place count 16 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1970 place count 16 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1971 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 1973 place count 5 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1975 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1976 place count 4 transition count 4
Applied a total of 1976 rules in 177 ms. Remains 4 /4222 variables (removed 4218) and now considering 4/5801 (removed 5797) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 4/4222 places, 4/5801 transitions.
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/4 properties
Knowledge based reduction with 12 factoid took 222 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 9623 ms.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 4222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Applied a total of 0 rules in 349 ms. Remains 4222 /4222 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
[2026-05-26 03:18:13] [INFO ] Invariant cache hit.
[2026-05-26 03:18:14] [INFO ] Implicit Places using invariants in 1450 ms returned []
[2026-05-26 03:18:14] [INFO ] Invariant cache hit.
[2026-05-26 03:18:18] [INFO ] Implicit Places using invariants and state equation in 3959 ms returned []
Implicit Place search using SMT with State Equation took 5411 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5764 ms. Remains : 4222/4222 places, 5801/5801 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (12 resets) in 613 ms. (65 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
[2026-05-26 03:18:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3926/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5801/10023 variables, 4222/4288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10023 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/10023 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10023/10023 variables, and 4288 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3926/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5801/10023 variables, 4222/4289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10023 variables, 4/4293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10023 variables, 0/4293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10023/10023 variables, and 4293 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8027ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 4222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Graph (trivial) has 5106 edges and 4222 vertex of which 3231 / 4222 are part of one of the 33 SCC in 5 ms
Free SCC test removed 3198 places
Drop transitions (Empty/Sink Transition effects.) removed 4185 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 4344 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 1024 transition count 1419
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 986 transition count 1419
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 349 place count 714 transition count 1011
Iterating global reduction 0 with 272 rules applied. Total rules applied 621 place count 714 transition count 1011
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 820 place count 515 transition count 770
Iterating global reduction 0 with 199 rules applied. Total rules applied 1019 place count 515 transition count 770
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 1218 place count 515 transition count 571
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 1 with 264 rules applied. Total rules applied 1482 place count 383 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
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 1484 place count 382 transition count 453
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1486 place count 382 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 1493 place count 382 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1495 place count 381 transition count 455
Free-agglomeration rule applied 201 times.
Iterating global reduction 2 with 201 rules applied. Total rules applied 1696 place count 381 transition count 254
Reduce places removed 201 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 492 edges and 180 vertex of which 16 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.0 ms
Discarding 164 places :
Also discarding 167 output transitions
Drop transitions (Output transitions of discarded places.) removed 167 transitions
Iterating post reduction 2 with 238 rules applied. Total rules applied 1934 place count 16 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 1969 place count 16 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1970 place count 16 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1971 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 1973 place count 5 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1975 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1976 place count 4 transition count 4
Applied a total of 1976 rules in 105 ms. Remains 4 /4222 variables (removed 4218) and now considering 4/5801 (removed 5797) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 4/4222 places, 4/5801 transitions.
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 9084 ms.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 44 reset in 400 ms.
Product exploration explored 100000 steps with 45 reset in 487 ms.
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1761714891187789429
[2026-05-26 03:18:29] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1761714891187789429
Running compilation step : cd /tmp/ltsmin1761714891187789429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1761714891187789429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1761714891187789429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 4222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Applied a total of 0 rules in 347 ms. Remains 4222 /4222 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
[2026-05-26 03:18:32] [INFO ] Invariant cache hit.
[2026-05-26 03:18:34] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2026-05-26 03:18:34] [INFO ] Invariant cache hit.
[2026-05-26 03:18:38] [INFO ] Implicit Places using invariants and state equation in 4150 ms returned []
Implicit Place search using SMT with State Equation took 5481 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5832 ms. Remains : 4222/4222 places, 5801/5801 transitions.
Built C files in :
/tmp/ltsmin13886728861147691724
[2026-05-26 03:18:38] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13886728861147691724
Running compilation step : cd /tmp/ltsmin13886728861147691724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13886728861147691724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13886728861147691724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 03:18:41] [INFO ] Flatten gal took : 105 ms
[2026-05-26 03:18:41] [INFO ] Flatten gal took : 88 ms
[2026-05-26 03:18:41] [INFO ] Time to serialize gal into /tmp/LTL5453490866882329246.gal : 36 ms
[2026-05-26 03:18:41] [INFO ] Time to serialize properties into /tmp/LTL14853588404086086145.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5453490866882329246.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7178808065674412349.hoa' '-atoms' '/tmp/LTL14853588404086086145.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14853588404086086145.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7178808065674412349.hoa
Detected timeout of ITS tools.
[2026-05-26 03:18:57] [INFO ] Flatten gal took : 75 ms
[2026-05-26 03:18:57] [INFO ] Flatten gal took : 75 ms
[2026-05-26 03:18:57] [INFO ] Time to serialize gal into /tmp/LTL16360317300480966638.gal : 24 ms
[2026-05-26 03:18:57] [INFO ] Time to serialize properties into /tmp/LTL9899079779776302910.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16360317300480966638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9899079779776302910.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p1159==1)"))||(("(p3169==0)")&&(G("(p3169!=1)")))))))
Formula 0 simplified : XG(X!"(p1159==1)" & (!"(p3169==0)" | F!"(p3169!=1)"))
Detected timeout of ITS tools.
[2026-05-26 03:19:12] [INFO ] Flatten gal took : 75 ms
[2026-05-26 03:19:12] [INFO ] Applying decomposition
[2026-05-26 03:19:12] [INFO ] Flatten gal took : 75 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/graph751841069252212948.txt' '-o' '/tmp/graph751841069252212948.bin' '-w' '/tmp/graph751841069252212948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph751841069252212948.bin' '-l' '-1' '-v' '-w' '/tmp/graph751841069252212948.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:19:12] [INFO ] Decomposing Gal with order
[2026-05-26 03:19:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:19:13] [INFO ] Removed a total of 1853 redundant transitions.
[2026-05-26 03:19:14] [INFO ] Flatten gal took : 298 ms
[2026-05-26 03:19:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 44 ms.
[2026-05-26 03:19:14] [INFO ] Time to serialize gal into /tmp/LTL15736629992327944064.gal : 41 ms
[2026-05-26 03:19:14] [INFO ] Time to serialize properties into /tmp/LTL13294240245648431232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15736629992327944064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13294240245648431232.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i6.u329.p1159==1)"))||(("(i15.u778.p3169==0)")&&(G("(i15.u778.p3169!=1)")))))))
Formula 0 simplified : XG(X!"(i6.u329.p1159==1)" & (!"(i15.u778.p3169==0)" | F!"(i15.u778.p3169!=1)"))
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-7B-LTLFireability-03 finished in 157978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(X(X(F((F(p0)&&p1)))))) U p2))'
Support contains 3 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4246 transition count 5834
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4246 transition count 5834
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4246 transition count 5833
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 4241 transition count 5828
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 4241 transition count 5828
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 4238 transition count 5825
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 4238 transition count 5825
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 4235 transition count 5821
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 4235 transition count 5821
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 4233 transition count 5817
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 4233 transition count 5817
Applied a total of 71 rules in 2202 ms. Remains 4233 /4268 variables (removed 35) and now considering 5817/5862 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14582357180187882247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12625996965144940509.kers'
[2026-05-26 03:19:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14582357180187882247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12625996965144940509.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5817 rows 4233 cols 12955 entries
Finished phase 1 with 4167 SingleSign rule and 0 generalized
[2026-05-26 03:19:31] [INFO ] Computed 66 invariants in 26 ms
Computed 66 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-12625996965144940509.kers
Total runtime 35 ms.
[2026-05-26 03:19:32] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2026-05-26 03:19:32] [INFO ] Invariant cache hit.
[2026-05-26 03:19:36] [INFO ] Implicit Places using invariants and state equation in 3986 ms returned []
Implicit Place search using SMT with State Equation took 5397 ms to find 0 implicit places.
Running 5816 sub problems to find dead transitions.
[2026-05-26 03:19:36] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4232/10050 variables, and 0 constraints, problems are : Problem set: 0 solved, 5816 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4233 constraints, PredecessorRefiner: 5816/5816 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5816 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4232/10050 variables, and 0 constraints, problems are : Problem set: 0 solved, 5816 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4233 constraints, PredecessorRefiner: 0/5816 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63193ms problems are : Problem set: 0 solved, 5816 unsolved
Search for dead transitions found 0 dead transitions in 63204ms
Starting structural reductions in LTL mode, iteration 1 : 4233/4268 places, 5817/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70821 ms. Remains : 4233/4268 places, 5817/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(X(X(F((F(p0)&&p1)))))) U p2))'
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), true, p0]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-04
Product exploration explored 100000 steps with 36 reset in 433 ms.
Product exploration explored 100000 steps with 38 reset in 514 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (14 resets) in 443 ms. (90 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
[2026-05-26 03:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 302/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3929/4233 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4233 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4233 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5817/10050 variables, 4233/4303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10050 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10050 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Real declared 10050/10050 variables, and 4303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4233/4233 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 302/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3929/4233 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4233 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4233 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4233 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5817/10050 variables, 4233/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10050 variables, 3/4307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10050 variables, 0/4307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/10050 variables, 0/4307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10050/10050 variables, and 4307 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4233/4233 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9865ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1112 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=158 )
Parikh walk visited 3 properties in 612 ms.
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), true, p0]
[2026-05-26 03:20:52] [INFO ] Invariant cache hit.
[2026-05-26 03:20:56] [INFO ] [Real]Absence check using 66 positive place invariants in 1821 ms returned sat
[2026-05-26 03:21:07] [INFO ] [Real]Absence check using state equation in 10792 ms returned unknown
Could not prove EG (NOT p2)
Knowledge-based reduction took 26280 ms.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), true, p0]
Support contains 3 out of 4233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4233/4233 places, 5817/5817 transitions.
Applied a total of 0 rules in 355 ms. Remains 4233 /4233 variables (removed 0) and now considering 5817/5817 (removed 0) transitions.
[2026-05-26 03:21:08] [INFO ] Invariant cache hit.
[2026-05-26 03:21:09] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2026-05-26 03:21:09] [INFO ] Invariant cache hit.
[2026-05-26 03:21:13] [INFO ] Implicit Places using invariants and state equation in 4150 ms returned []
Implicit Place search using SMT with State Equation took 5414 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5770 ms. Remains : 4233/4233 places, 5817/5817 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (12 resets) in 322 ms. (123 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
[2026-05-26 03:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 302/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3929/4233 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4233 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4233 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5817/10050 variables, 4233/4303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10050 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10050 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Real declared 10050/10050 variables, and 4303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4233/4233 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 302/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3929/4233 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4233 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4233 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4233 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5817/10050 variables, 4233/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10050 variables, 3/4307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10050 variables, 0/4307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/10050 variables, 0/4307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10050/10050 variables, and 4307 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4233/4233 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9724ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1165 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=166 )
Parikh walk visited 3 properties in 574 ms.
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), true, p0]
[2026-05-26 03:21:24] [INFO ] Invariant cache hit.
[2026-05-26 03:21:28] [INFO ] [Real]Absence check using 66 positive place invariants in 1783 ms returned sat
[2026-05-26 03:21:39] [INFO ] [Real]Absence check using state equation in 10812 ms returned unknown
Could not prove EG (NOT p2)
Knowledge-based reduction took 26039 ms.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), true, p0]
Product exploration explored 100000 steps with 37 reset in 522 ms.
Product exploration explored 100000 steps with 37 reset in 551 ms.
Spot run failed in 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin7729694085874924160
[2026-05-26 03:21:41] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7729694085874924160
Running compilation step : cd /tmp/ltsmin7729694085874924160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7729694085874924160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7729694085874924160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 4233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4233/4233 places, 5817/5817 transitions.
Applied a total of 0 rules in 348 ms. Remains 4233 /4233 variables (removed 0) and now considering 5817/5817 (removed 0) transitions.
[2026-05-26 03:21:44] [INFO ] Invariant cache hit.
[2026-05-26 03:21:46] [INFO ] Implicit Places using invariants in 1343 ms returned []
[2026-05-26 03:21:46] [INFO ] Invariant cache hit.
[2026-05-26 03:21:50] [INFO ] Implicit Places using invariants and state equation in 4200 ms returned []
Implicit Place search using SMT with State Equation took 5545 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5894 ms. Remains : 4233/4233 places, 5817/5817 transitions.
Built C files in :
/tmp/ltsmin8017886352622924741
[2026-05-26 03:21:50] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8017886352622924741
Running compilation step : cd /tmp/ltsmin8017886352622924741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8017886352622924741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8017886352622924741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 03:21:53] [INFO ] Flatten gal took : 80 ms
[2026-05-26 03:21:53] [INFO ] Flatten gal took : 73 ms
[2026-05-26 03:21:53] [INFO ] Time to serialize gal into /tmp/LTL17124051946253532963.gal : 17 ms
[2026-05-26 03:21:53] [INFO ] Time to serialize properties into /tmp/LTL11860039645409338143.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17124051946253532963.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12038397907118433451.hoa' '-atoms' '/tmp/LTL11860039645409338143.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11860039645409338143.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12038397907118433451.hoa
Detected timeout of ITS tools.
[2026-05-26 03:22:08] [INFO ] Flatten gal took : 64 ms
[2026-05-26 03:22:08] [INFO ] Flatten gal took : 69 ms
[2026-05-26 03:22:08] [INFO ] Time to serialize gal into /tmp/LTL5285037308000427368.gal : 17 ms
[2026-05-26 03:22:08] [INFO ] Time to serialize properties into /tmp/LTL2601314332294874724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5285037308000427368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2601314332294874724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((!(X(F(X(X(F((F("(p562==1)"))&&("(p1802==1)"))))))))U("((p4231==1)||(p562==1))")))
Formula 0 simplified : !"((p4231==1)||(p562==1))" & X(!"((p4231==1)||(p562==1))" W XXF("(p1802==1)" & F"(p562==1)"))
Detected timeout of ITS tools.
[2026-05-26 03:22:23] [INFO ] Flatten gal took : 80 ms
[2026-05-26 03:22:23] [INFO ] Applying decomposition
[2026-05-26 03:22:24] [INFO ] Flatten gal took : 60 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/graph2192606485536983367.txt' '-o' '/tmp/graph2192606485536983367.bin' '-w' '/tmp/graph2192606485536983367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2192606485536983367.bin' '-l' '-1' '-v' '-w' '/tmp/graph2192606485536983367.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:22:24] [INFO ] Decomposing Gal with order
[2026-05-26 03:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:22:25] [INFO ] Removed a total of 1848 redundant transitions.
[2026-05-26 03:22:25] [INFO ] Flatten gal took : 153 ms
[2026-05-26 03:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 29 ms.
[2026-05-26 03:22:25] [INFO ] Time to serialize gal into /tmp/LTL15662192749389764398.gal : 39 ms
[2026-05-26 03:22:25] [INFO ] Time to serialize properties into /tmp/LTL4804346124403233523.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15662192749389764398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4804346124403233523.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!(X(F(X(X(F((F("(i2.u152.p562==1)"))&&("(i8.u445.p1802==1)"))))))))U("((i18.u1028.p4231==1)||(i2.u152.p562==1))")))
Formula 0 simplified : !"((i18.u1028.p4231==1)||(i2.u152.p562==1))" & X(!"((i18.u1028.p4231==1)||(i2.u152.p562==1))" W XXF("(i8.u445.p1802==1)" & F"(i2.u15...168
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-7B-LTLFireability-04 finished in 191109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4243 transition count 5830
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4243 transition count 5830
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 4243 transition count 5829
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 4235 transition count 5820
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 4235 transition count 5820
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 4230 transition count 5815
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 4230 transition count 5815
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 4225 transition count 5809
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 4225 transition count 5809
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 4221 transition count 5802
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 4221 transition count 5802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 4220 transition count 5800
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 4220 transition count 5800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 4220 transition count 5799
Applied a total of 98 rules in 2659 ms. Remains 4220 /4268 variables (removed 48) and now considering 5799/5862 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15968260253627039525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4809558908738988727.kers'
[2026-05-26 03:22:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15968260253627039525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4809558908738988727.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5799 rows 4220 cols 12915 entries
Finished phase 1 with 4154 SingleSign rule and 0 generalized
[2026-05-26 03:22:43] [INFO ] Computed 66 invariants in 32 ms
Computed 66 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-4809558908738988727.kers
Total runtime 37 ms.
[2026-05-26 03:22:44] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2026-05-26 03:22:44] [INFO ] Invariant cache hit.
[2026-05-26 03:22:48] [INFO ] Implicit Places using invariants and state equation in 3820 ms returned []
Implicit Place search using SMT with State Equation took 5208 ms to find 0 implicit places.
Running 5798 sub problems to find dead transitions.
[2026-05-26 03:22:48] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4219/10019 variables, and 0 constraints, problems are : Problem set: 0 solved, 5798 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4220 constraints, PredecessorRefiner: 5798/5798 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5798 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4219/10019 variables, and 0 constraints, problems are : Problem set: 0 solved, 5798 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4220 constraints, PredecessorRefiner: 0/5798 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62889ms problems are : Problem set: 0 solved, 5798 unsolved
Search for dead transitions found 0 dead transitions in 62898ms
Starting structural reductions in LTL mode, iteration 1 : 4220/4268 places, 5799/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70782 ms. Remains : 4220/4268 places, 5799/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-05 finished in 71018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(X((p1&&G(p2))) U (F(p3) U p4)))))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Graph (trivial) has 5154 edges and 4268 vertex of which 3237 / 4268 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3204 places
Ensure Unique test removed 4312 transitions
Reduce isomorphic transitions removed 4312 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 1063 transition count 1544
Reduce places removed 5 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 7 rules applied. Total rules applied 13 place count 1058 transition count 1542
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 1057 transition count 1541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 1056 transition count 1541
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 16 place count 1056 transition count 1498
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 102 place count 1013 transition count 1498
Discarding 272 places :
Symmetric choice reduction at 4 with 272 rule applications. Total rules 374 place count 741 transition count 1094
Iterating global reduction 4 with 272 rules applied. Total rules applied 646 place count 741 transition count 1094
Discarding 198 places :
Symmetric choice reduction at 4 with 198 rule applications. Total rules 844 place count 543 transition count 850
Iterating global reduction 4 with 198 rules applied. Total rules applied 1042 place count 543 transition count 850
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 4 with 197 rules applied. Total rules applied 1239 place count 543 transition count 653
Performed 143 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 1525 place count 400 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1526 place count 400 transition count 508
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1527 place count 399 transition count 507
Iterating global reduction 6 with 1 rules applied. Total rules applied 1528 place count 399 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1529 place count 399 transition count 506
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1541 place count 393 transition count 509
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1551 place count 393 transition count 499
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1558 place count 393 transition count 492
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1561 place count 390 transition count 489
Iterating global reduction 8 with 3 rules applied. Total rules applied 1564 place count 390 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1567 place count 390 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1568 place count 389 transition count 485
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 272 edges and 380 vertex of which 48 / 380 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 8 with 10 rules applied. Total rules applied 1578 place count 356 transition count 485
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 1626 place count 356 transition count 437
Applied a total of 1626 rules in 150 ms. Remains 356 /4268 variables (removed 3912) and now considering 437/5862 (removed 5425) transitions.
[2026-05-26 03:23:51] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14172931036565813948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5394477042262564951.kers'
[2026-05-26 03:23:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14172931036565813948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5394477042262564951.kers]
Normalized transition count is 404 out of 405 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 356 cols 1192 entries
Finished phase 1 with 299 SingleSign rule and 0 generalized
[2026-05-26 03:23:51] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5394477042262564951.kers
Total runtime 3 ms.
[2026-05-26 03:23:51] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-26 03:23:51] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2026-05-26 03:23:51] [INFO ] Invariant cache hit.
[2026-05-26 03:23:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 03:23:51] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2026-05-26 03:23:51] [INFO ] Redundant transitions in 6 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-26 03:23:51] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2026-05-26 03:23:51] [INFO ] Invariant cache hit.
[2026-05-26 03:23:51] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 33/356 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 404/760 variables, 356/413 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 14/427 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/760 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/761 variables, and 427 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17050 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 356/356 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 33/356 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 404/760 variables, 356/413 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 14/427 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 213/640 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/760 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/761 variables, and 640 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17566 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 356/356 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34637ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 34638ms
Starting structural reductions in SI_LTL mode, iteration 1 : 356/4268 places, 437/5862 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35225 ms. Remains : 356/4268 places, 437/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(X((p1&&G(p2))) U (F(p3) U p4)))))'
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p4))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-07 finished in 35328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(F(p1))))) U (!p1 U X(p2))))'
Support contains 3 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4245 transition count 5833
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4245 transition count 5833
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4245 transition count 5832
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 4237 transition count 5823
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 4237 transition count 5823
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 4232 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 4232 transition count 5818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 4227 transition count 5812
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 4227 transition count 5812
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 4223 transition count 5805
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 4223 transition count 5805
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 4222 transition count 5803
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 4222 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 4222 transition count 5802
Applied a total of 94 rules in 2687 ms. Remains 4222 /4268 variables (removed 46) and now considering 5802/5862 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14203021555688241671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5669064524995253625.kers'
[2026-05-26 03:24:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14203021555688241671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5669064524995253625.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5802 rows 4222 cols 12921 entries
Finished phase 1 with 4156 SingleSign rule and 0 generalized
[2026-05-26 03:24:29] [INFO ] Computed 66 invariants in 30 ms
Computed 66 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-5669064524995253625.kers
Total runtime 35 ms.
[2026-05-26 03:24:30] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2026-05-26 03:24:30] [INFO ] Invariant cache hit.
[2026-05-26 03:24:34] [INFO ] Implicit Places using invariants and state equation in 3987 ms returned []
Implicit Place search using SMT with State Equation took 5316 ms to find 0 implicit places.
Running 5801 sub problems to find dead transitions.
[2026-05-26 03:24:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4221/10024 variables, and 0 constraints, problems are : Problem set: 0 solved, 5801 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 5801/5801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4221/10024 variables, and 0 constraints, problems are : Problem set: 0 solved, 5801 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 0/5801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62874ms problems are : Problem set: 0 solved, 5801 unsolved
Search for dead transitions found 0 dead transitions in 62884ms
Starting structural reductions in LTL mode, iteration 1 : 4222/4268 places, 5802/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70901 ms. Remains : 4222/4268 places, 5802/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(F(p1))))) U (!p1 U X(p2))))'
Stuttering acceptance computed with spot in 362 ms :[(NOT p2), false, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-08
Product exploration explored 100000 steps with 25070 reset in 604 ms.
Product exploration explored 100000 steps with 24996 reset in 627 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 13 factoid took 67 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (13 resets) in 438 ms. (91 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
[2026-05-26 03:25:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 401/404 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3818/4222 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5802/10024 variables, 4222/4288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/10024 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/10024 variables, 0/4288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10024/10024 variables, and 4288 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3888 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 401/404 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3818/4222 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5802/10024 variables, 4222/4292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10024 variables, 6/4298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10024/10024 variables, and 4298 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8937ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 4222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4222/4222 places, 5802/5802 transitions.
Graph (trivial) has 5103 edges and 4222 vertex of which 3231 / 4222 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3198 places
Drop transitions (Empty/Sink Transition effects.) removed 4184 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 4344 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 1 place count 1024 transition count 1420
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 986 transition count 1420
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 349 place count 714 transition count 1012
Iterating global reduction 0 with 272 rules applied. Total rules applied 621 place count 714 transition count 1012
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 820 place count 515 transition count 771
Iterating global reduction 0 with 199 rules applied. Total rules applied 1019 place count 515 transition count 771
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 1218 place count 515 transition count 572
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 1 with 262 rules applied. Total rules applied 1480 place count 384 transition count 441
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1484 place count 382 transition count 455
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1486 place count 382 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 1494 place count 382 transition count 445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1495 place count 381 transition count 444
Iterating global reduction 2 with 1 rules applied. Total rules applied 1496 place count 381 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1498 place count 380 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1499 place count 380 transition count 454
Free-agglomeration rule applied 198 times.
Iterating global reduction 2 with 198 rules applied. Total rules applied 1697 place count 380 transition count 256
Reduce places removed 198 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 496 edges and 182 vertex of which 19 are kept as prefixes of interest. Removing 163 places using SCC suffix rule.0 ms
Discarding 163 places :
Also discarding 163 output transitions
Drop transitions (Output transitions of discarded places.) removed 163 transitions
Iterating post reduction 2 with 235 rules applied. Total rules applied 1932 place count 19 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1971 place count 19 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1972 place count 18 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 7 edges and 14 vertex of which 5 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 5 rules applied. Total rules applied 1977 place count 10 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1984 place count 10 transition count 10
Applied a total of 1984 rules in 110 ms. Remains 10 /4222 variables (removed 4212) and now considering 10/5802 (removed 5792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 10/4222 places, 10/5802 transitions.
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/6 properties
Knowledge based reduction with 13 factoid took 169 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(NOT p2), false, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), false, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
[2026-05-26 03:25:49] [INFO ] Invariant cache hit.
[2026-05-26 03:25:52] [INFO ] [Real]Absence check using 66 positive place invariants in 449 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 13070 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-08 finished in 85635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0) U p1))||G(X(p2))))'
Support contains 3 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4245 transition count 5833
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4245 transition count 5833
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4245 transition count 5832
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4238 transition count 5824
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4238 transition count 5824
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 4234 transition count 5820
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 4234 transition count 5820
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 4230 transition count 5815
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 4230 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 4227 transition count 5810
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 4227 transition count 5810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 4226 transition count 5808
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 4226 transition count 5808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 4226 transition count 5807
Applied a total of 86 rules in 2645 ms. Remains 4226 /4268 variables (removed 42) and now considering 5807/5862 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7660804322912135338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7354094924787006141.kers'
[2026-05-26 03:25:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7660804322912135338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7354094924787006141.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5807 rows 4226 cols 12931 entries
Finished phase 1 with 4160 SingleSign rule and 0 generalized
[2026-05-26 03:25:55] [INFO ] Computed 66 invariants in 25 ms
Computed 66 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-7354094924787006141.kers
Total runtime 31 ms.
[2026-05-26 03:25:56] [INFO ] Implicit Places using invariants in 1473 ms returned []
[2026-05-26 03:25:56] [INFO ] Invariant cache hit.
[2026-05-26 03:26:00] [INFO ] Implicit Places using invariants and state equation in 4289 ms returned []
Implicit Place search using SMT with State Equation took 5768 ms to find 0 implicit places.
Running 5806 sub problems to find dead transitions.
[2026-05-26 03:26:00] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 5806/5806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 0/5806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62771ms problems are : Problem set: 0 solved, 5806 unsolved
Search for dead transitions found 0 dead transitions in 62779ms
Starting structural reductions in LTL mode, iteration 1 : 4226/4268 places, 5807/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71217 ms. Remains : 4226/4268 places, 5807/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0) U p1))||G(X(p2))))'
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-09 finished in 71451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1&&(p2||X(X(F(p1)))))))))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 4244 transition count 5831
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 4244 transition count 5831
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 4244 transition count 5830
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 4236 transition count 5821
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 4236 transition count 5821
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 4231 transition count 5816
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 4231 transition count 5816
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 4226 transition count 5810
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 4226 transition count 5810
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 4222 transition count 5803
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 4222 transition count 5803
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 4221 transition count 5801
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 4221 transition count 5801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 4221 transition count 5800
Applied a total of 96 rules in 2597 ms. Remains 4221 /4268 variables (removed 47) and now considering 5800/5862 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-321806357525058598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8877645971780055317.kers'
[2026-05-26 03:27:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-321806357525058598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8877645971780055317.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5800 rows 4221 cols 12917 entries
Finished phase 1 with 4155 SingleSign rule and 0 generalized
[2026-05-26 03:27:06] [INFO ] Computed 66 invariants in 24 ms
Computed 66 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-8877645971780055317.kers
Total runtime 37 ms.
[2026-05-26 03:27:07] [INFO ] Implicit Places using invariants in 1450 ms returned []
[2026-05-26 03:27:07] [INFO ] Invariant cache hit.
[2026-05-26 03:27:11] [INFO ] Implicit Places using invariants and state equation in 4035 ms returned []
Implicit Place search using SMT with State Equation took 5495 ms to find 0 implicit places.
Running 5799 sub problems to find dead transitions.
[2026-05-26 03:27:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10021 variables, and 0 constraints, problems are : Problem set: 0 solved, 5799 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5799/5799 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5799 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10021 variables, and 0 constraints, problems are : Problem set: 0 solved, 5799 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5799 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62740ms problems are : Problem set: 0 solved, 5799 unsolved
Search for dead transitions found 0 dead transitions in 62749ms
Starting structural reductions in LTL mode, iteration 1 : 4221/4268 places, 5800/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70856 ms. Remains : 4221/4268 places, 5800/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1&&(p2||X(X(F(p1)))))))))'
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-11
Stuttering criterion allowed to conclude after 3492 steps with 0 reset in 16 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-11 finished in 71092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))'
Support contains 4 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 4244 transition count 5832
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 4244 transition count 5832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 4244 transition count 5831
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 4236 transition count 5822
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 4236 transition count 5822
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 4231 transition count 5817
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 4231 transition count 5817
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 4226 transition count 5811
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 4226 transition count 5811
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 4222 transition count 5804
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 4222 transition count 5804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 4221 transition count 5802
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 4221 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 4221 transition count 5801
Applied a total of 96 rules in 2604 ms. Remains 4221 /4268 variables (removed 47) and now considering 5801/5862 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-718726781283399980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8008927280340549447.kers'
[2026-05-26 03:28:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-718726781283399980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8008927280340549447.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5801 rows 4221 cols 12919 entries
Finished phase 1 with 4155 SingleSign rule and 0 generalized
[2026-05-26 03:28:17] [INFO ] Computed 66 invariants in 24 ms
Computed 66 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-8008927280340549447.kers
Total runtime 35 ms.
[2026-05-26 03:28:18] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2026-05-26 03:28:18] [INFO ] Invariant cache hit.
[2026-05-26 03:28:22] [INFO ] Implicit Places using invariants and state equation in 4147 ms returned []
Implicit Place search using SMT with State Equation took 5495 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2026-05-26 03:28:23] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62760ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 62770ms
Starting structural reductions in LTL mode, iteration 1 : 4221/4268 places, 5801/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70879 ms. Remains : 4221/4268 places, 5801/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))'
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-12 finished in 71247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 4268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Graph (trivial) has 5163 edges and 4268 vertex of which 3266 / 4268 are part of one of the 33 SCC in 1 ms
Free SCC test removed 3233 places
Ensure Unique test removed 4357 transitions
Reduce isomorphic transitions removed 4357 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1034 transition count 1502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1032 transition count 1502
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 5 place count 1032 transition count 1465
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 79 place count 995 transition count 1465
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 356 place count 718 transition count 1056
Iterating global reduction 2 with 277 rules applied. Total rules applied 633 place count 718 transition count 1056
Discarding 203 places :
Symmetric choice reduction at 2 with 203 rule applications. Total rules 836 place count 515 transition count 807
Iterating global reduction 2 with 203 rules applied. Total rules applied 1039 place count 515 transition count 807
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 1241 place count 515 transition count 605
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 1503 place count 384 transition count 474
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1505 place count 382 transition count 472
Iterating global reduction 3 with 2 rules applied. Total rules applied 1507 place count 382 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1509 place count 382 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1510 place count 382 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1511 place count 381 transition count 468
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 267 edges and 372 vertex of which 48 / 372 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1521 place count 348 transition count 468
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1569 place count 348 transition count 420
Applied a total of 1569 rules in 124 ms. Remains 348 /4268 variables (removed 3920) and now considering 420/5862 (removed 5442) transitions.
[2026-05-26 03:29:26] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10524942647602412101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10629030520926058796.kers'
[2026-05-26 03:29:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10524942647602412101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10629030520926058796.kers]
Normalized transition count is 387 out of 388 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 387 rows 348 cols 1144 entries
Finished phase 1 with 291 SingleSign rule and 0 generalized
[2026-05-26 03:29:26] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10629030520926058796.kers
Total runtime 9 ms.
[2026-05-26 03:29:26] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-26 03:29:26] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2026-05-26 03:29:26] [INFO ] Invariant cache hit.
[2026-05-26 03:29:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-26 03:29:26] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2026-05-26 03:29:26] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2026-05-26 03:29:26] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2026-05-26 03:29:26] [INFO ] Invariant cache hit.
[2026-05-26 03:29:26] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 33/348 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 387/735 variables, 348/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/735 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 735/736 variables, and 419 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15873 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 348/348 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 33/348 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 387/735 variables, 348/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 201/620 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/735 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 735/736 variables, and 620 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16652 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 348/348 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32551ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 32551ms
Starting structural reductions in SI_LTL mode, iteration 1 : 348/4268 places, 420/5862 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33283 ms. Remains : 348/4268 places, 420/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-13 finished in 33354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F((p1&&X(X(F(p2))))))||p0))))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4245 transition count 5832
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4245 transition count 5832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4245 transition count 5831
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 4237 transition count 5822
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 4237 transition count 5822
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 4232 transition count 5817
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 4232 transition count 5817
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 4227 transition count 5811
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 4227 transition count 5811
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 4223 transition count 5804
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 4223 transition count 5804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 4222 transition count 5802
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 4222 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 4222 transition count 5801
Applied a total of 94 rules in 2624 ms. Remains 4222 /4268 variables (removed 46) and now considering 5801/5862 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2798563043949915177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3194079324556002899.kers'
[2026-05-26 03:30:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2798563043949915177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3194079324556002899.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5801 rows 4222 cols 12919 entries
Finished phase 1 with 4156 SingleSign rule and 0 generalized
[2026-05-26 03:30:02] [INFO ] Computed 66 invariants in 24 ms
Computed 66 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-3194079324556002899.kers
Total runtime 36 ms.
[2026-05-26 03:30:03] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2026-05-26 03:30:03] [INFO ] Invariant cache hit.
[2026-05-26 03:30:07] [INFO ] Implicit Places using invariants and state equation in 3928 ms returned []
Implicit Place search using SMT with State Equation took 5287 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2026-05-26 03:30:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4221/10023 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4221/10023 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62737ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 62751ms
Starting structural reductions in LTL mode, iteration 1 : 4222/4268 places, 5801/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70679 ms. Remains : 4222/4268 places, 5801/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F((p1&&X(X(F(p2))))))||p0))))'
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-14
Product exploration explored 100000 steps with 36 reset in 586 ms.
Product exploration explored 100000 steps with 35 reset in 626 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (13 resets) in 243 ms. (163 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2026-05-26 03:31:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3924/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10023/10023 variables, and 4289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2491 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3924/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5801/10023 variables, 4222/4289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10023 variables, 1/4290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10023 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/10023 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10023/10023 variables, and 4290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2950 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5456ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1111 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=123 )
Parikh walk visited 1 properties in 9 ms.
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Knowledge-based reduction took 6029 ms.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 2 out of 4222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Applied a total of 0 rules in 346 ms. Remains 4222 /4222 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
[2026-05-26 03:31:18] [INFO ] Invariant cache hit.
[2026-05-26 03:31:19] [INFO ] Implicit Places using invariants in 1271 ms returned []
[2026-05-26 03:31:19] [INFO ] Invariant cache hit.
[2026-05-26 03:31:23] [INFO ] Implicit Places using invariants and state equation in 3893 ms returned []
Implicit Place search using SMT with State Equation took 5170 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5516 ms. Remains : 4222/4222 places, 5801/5801 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (12 resets) in 242 ms. (164 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2026-05-26 03:31:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3924/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10023/10023 variables, and 4289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2545 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3924/4222 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4222 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4222 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10023/10023 variables, and 4289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4222/4222 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4739ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1101 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=157 )
Parikh walk visited 1 properties in 7 ms.
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Knowledge-based reduction took 5341 ms.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 36 reset in 589 ms.
Product exploration explored 100000 steps with 36 reset in 617 ms.
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1802353022357836366
[2026-05-26 03:31:30] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1802353022357836366
Running compilation step : cd /tmp/ltsmin1802353022357836366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1802353022357836366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1802353022357836366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 4222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Applied a total of 0 rules in 373 ms. Remains 4222 /4222 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
[2026-05-26 03:31:33] [INFO ] Invariant cache hit.
[2026-05-26 03:31:35] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2026-05-26 03:31:35] [INFO ] Invariant cache hit.
[2026-05-26 03:31:39] [INFO ] Implicit Places using invariants and state equation in 4008 ms returned []
Implicit Place search using SMT with State Equation took 5332 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5707 ms. Remains : 4222/4222 places, 5801/5801 transitions.
Built C files in :
/tmp/ltsmin13032922140778745764
[2026-05-26 03:31:39] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13032922140778745764
Running compilation step : cd /tmp/ltsmin13032922140778745764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13032922140778745764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13032922140778745764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 03:31:42] [INFO ] Flatten gal took : 63 ms
[2026-05-26 03:31:42] [INFO ] Flatten gal took : 66 ms
[2026-05-26 03:31:42] [INFO ] Time to serialize gal into /tmp/LTL9702760070764790536.gal : 22 ms
[2026-05-26 03:31:42] [INFO ] Time to serialize properties into /tmp/LTL5925182944777139847.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9702760070764790536.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12478314725946129378.hoa' '-atoms' '/tmp/LTL5925182944777139847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5925182944777139847.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12478314725946129378.hoa
Detected timeout of ITS tools.
[2026-05-26 03:31:57] [INFO ] Flatten gal took : 65 ms
[2026-05-26 03:31:57] [INFO ] Flatten gal took : 69 ms
[2026-05-26 03:31:57] [INFO ] Time to serialize gal into /tmp/LTL4233420618919978475.gal : 17 ms
[2026-05-26 03:31:57] [INFO ] Time to serialize properties into /tmp/LTL17340800226708776452.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4233420618919978475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17340800226708776452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p316!=1)||(p2285!=1))")||(X(F(("((p316!=1)||(p2285!=1))")&&(X(X(F("(p2285==1)")))))))))))
Formula 0 simplified : XF(!"((p316!=1)||(p2285!=1))" & XG(!"((p316!=1)||(p2285!=1))" | XXG!"(p2285==1)"))
Detected timeout of ITS tools.
[2026-05-26 03:32:12] [INFO ] Flatten gal took : 65 ms
[2026-05-26 03:32:12] [INFO ] Applying decomposition
[2026-05-26 03:32:13] [INFO ] Flatten gal took : 68 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/graph11366819161178809783.txt' '-o' '/tmp/graph11366819161178809783.bin' '-w' '/tmp/graph11366819161178809783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11366819161178809783.bin' '-l' '-1' '-v' '-w' '/tmp/graph11366819161178809783.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:32:13] [INFO ] Decomposing Gal with order
[2026-05-26 03:32:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:32:14] [INFO ] Removed a total of 1815 redundant transitions.
[2026-05-26 03:32:14] [INFO ] Flatten gal took : 128 ms
[2026-05-26 03:32:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 26 ms.
[2026-05-26 03:32:14] [INFO ] Time to serialize gal into /tmp/LTL13727930542376057818.gal : 32 ms
[2026-05-26 03:32:14] [INFO ] Time to serialize properties into /tmp/LTL471632677811041668.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13727930542376057818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL471632677811041668.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i1.i0.i1.i1.u84.p316!=1)||(i11.u545.p2285!=1))")||(X(F(("((i1.i0.i1.i1.u84.p316!=1)||(i11.u545.p2285!=1))")&&(X(X(F("(i11.u...180
Formula 0 simplified : XF(!"((i1.i0.i1.i1.u84.p316!=1)||(i11.u545.p2285!=1))" & XG(!"((i1.i0.i1.i1.u84.p316!=1)||(i11.u545.p2285!=1))" | XXG!"(i11.u545.p22...164
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-7B-LTLFireability-14 finished in 149932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&F(p1)) U G(p2)) U (p3||X(p4))))'
Support contains 5 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5862/5862 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4246 transition count 5835
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4246 transition count 5835
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 4239 transition count 5827
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 4239 transition count 5827
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 4235 transition count 5823
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 4235 transition count 5823
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 4231 transition count 5818
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 4231 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 4228 transition count 5813
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 4228 transition count 5813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 4227 transition count 5811
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 4227 transition count 5811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 83 place count 4227 transition count 5810
Applied a total of 83 rules in 2671 ms. Remains 4227 /4268 variables (removed 41) and now considering 5810/5862 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4655576262600438487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11672177154738353626.kers'
[2026-05-26 03:32:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4655576262600438487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11672177154738353626.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5810 rows 4227 cols 12939 entries
Finished phase 1 with 4161 SingleSign rule and 0 generalized
[2026-05-26 03:32:32] [INFO ] Computed 66 invariants in 36 ms
Computed 66 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-11672177154738353626.kers
Total runtime 41 ms.
[2026-05-26 03:32:33] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2026-05-26 03:32:33] [INFO ] Invariant cache hit.
[2026-05-26 03:32:37] [INFO ] Implicit Places using invariants and state equation in 3967 ms returned []
Implicit Place search using SMT with State Equation took 5330 ms to find 0 implicit places.
Running 5809 sub problems to find dead transitions.
[2026-05-26 03:32:37] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4226/10037 variables, and 0 constraints, problems are : Problem set: 0 solved, 5809 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4227 constraints, PredecessorRefiner: 5809/5809 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5809 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4226/10037 variables, and 0 constraints, problems are : Problem set: 0 solved, 5809 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4227 constraints, PredecessorRefiner: 0/5809 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63070ms problems are : Problem set: 0 solved, 5809 unsolved
Search for dead transitions found 0 dead transitions in 63077ms
Starting structural reductions in LTL mode, iteration 1 : 4227/4268 places, 5810/5862 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71090 ms. Remains : 4227/4268 places, 5810/5862 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&F(p1)) U G(p2)) U (p3||X(p4))))'
Stuttering acceptance computed with spot in 434 ms :[(AND (NOT p3) (NOT p4)), (NOT p4), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p1) p2 (NOT p4))), (AND (NOT p2) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-15 finished in 71616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(p1&&G(p2))))))'
Spot run failed in 137 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(X(X(F((F(p0)&&p1)))))) U p2))'
Spot run failed in 46 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F((p1&&X(X(F(p2))))))||p0))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 03:33:41] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5902521385433954203
[2026-05-26 03:33:41] [INFO ] Too many transitions (5862) to apply POR reductions. Disabling POR matrices.
[2026-05-26 03:33:41] [INFO ] Applying decomposition
[2026-05-26 03:33:41] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5902521385433954203
Running compilation step : cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 03:33:41] [INFO ] Flatten gal took : 71 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/graph6746839041580372486.txt' '-o' '/tmp/graph6746839041580372486.bin' '-w' '/tmp/graph6746839041580372486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6746839041580372486.bin' '-l' '-1' '-v' '-w' '/tmp/graph6746839041580372486.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:33:41] [INFO ] Decomposing Gal with order
[2026-05-26 03:33:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:33:42] [INFO ] Removed a total of 1820 redundant transitions.
[2026-05-26 03:33:42] [INFO ] Flatten gal took : 146 ms
[2026-05-26 03:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 61 ms.
[2026-05-26 03:33:42] [INFO ] Time to serialize gal into /tmp/LTLFireability6842663869089458345.gal : 38 ms
[2026-05-26 03:33:42] [INFO ] Time to serialize properties into /tmp/LTLFireability9020475101584496611.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6842663869089458345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9020475101584496611.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X(F((X("(i6.u290.p1159==1)"))||(("(i15.u783.p3169==0)")&&(G("(i15.u783.p3169!=1)")))))))
Formula 0 simplified : XG(X!"(i6.u290.p1159==1)" & (!"(i15.u783.p3169==0)" | F!"(i15.u783.p3169!=1)"))
Compilation finished in 21609 ms.
Running link step : cd /tmp/ltsmin5902521385433954203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(!X(<>(X(X(<>((<>((LTLAPp3==true))&&(LTLAPp4==true))))))) U (LTLAPp5==true))' '--buchi-type=spotba'
LTSmin run took 3236 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((X(<>(((LTLAPp7==true)&&X(X(<>((LTLAPp8==true)))))))||(LTLAPp6==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t901, t1060, t1357, t1506, t2582, t2900, t3205, t3818, t3967, t4415, t4571, t4576, t4880, t50...5314
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((X(<>(((LTLAPp7==true)&&X(X(<>((LTLAPp8==true)))))))||(LTLAPp6==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin5902521385433954203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Computing Next relation with stutter on 4.79184e+50 deadlock states
Detected timeout of ITS tools.
[2026-05-26 04:00:52] [INFO ] Applying decomposition
[2026-05-26 04:00:55] [INFO ] Flatten gal took : 2647 ms
[2026-05-26 04:00:56] [INFO ] Decomposing Gal with order
[2026-05-26 04:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 04:00:58] [INFO ] Removed a total of 593 redundant transitions.
[2026-05-26 04:00:58] [INFO ] Flatten gal took : 102 ms
[2026-05-26 04:00:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1277 labels/synchronizations in 401 ms.
[2026-05-26 04:00:58] [INFO ] Time to serialize gal into /tmp/LTLFireability3678678349091170139.gal : 21 ms
[2026-05-26 04:00:58] [INFO ] Time to serialize properties into /tmp/LTLFireability1520538852107433270.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3678678349091170139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1520538852107433270.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(F((X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...449
Formula 0 simplified : XG(X!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...439

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-7B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;