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.r146-tall-177961074400748.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 HirschbergSinclair-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400748
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:49 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 173K 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 HirschbergSinclair-PT-15-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779751222823

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 23:20:23] [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-25 23:20:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:20:24] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-25 23:20:24] [INFO ] Transformed 330 places.
[2026-05-25 23:20:24] [INFO ] Transformed 296 transitions.
[2026-05-25 23:20:24] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-15-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 28 place count 302 transition count 283
Iterating global reduction 1 with 13 rules applied. Total rules applied 41 place count 302 transition count 283
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 290 transition count 271
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 290 transition count 271
Applied a total of 65 rules in 73 ms. Remains 290 /330 variables (removed 40) and now considering 271/296 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6621957530742134235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1537652362897444724.kers'
[2026-05-25 23:20:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6621957530742134235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1537652362897444724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 290 cols 816 entries
Finished phase 1 with 267 SingleSign rule and 4 generalized
[2026-05-25 23:20:24] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1537652362897444724.kers
Total runtime 2 ms.
[2026-05-25 23:20:24] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-25 23:20:24] [INFO ] Invariant cache hit.
[2026-05-25 23:20:25] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-25 23:20:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 15/290 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 271/561 variables, 290/309 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/561 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 309 constraints, problems are : Problem set: 0 solved, 256 unsolved in 28491 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 15/290 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 271/561 variables, 290/309 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 256/565 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 565 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58611ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 58622ms
Starting structural reductions in LTL mode, iteration 1 : 290/330 places, 271/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59850 ms. Remains : 290/330 places, 271/296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Applied a total of 0 rules in 6 ms. Remains 290 /290 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2026-05-25 23:21:24] [INFO ] Invariant cache hit.
[2026-05-25 23:21:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 23:21:24] [INFO ] Invariant cache hit.
[2026-05-25 23:21:25] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 864 ms. Remains : 290/290 places, 271/271 transitions.
Support contains 51 out of 290 places after structural reductions.
[2026-05-25 23:21:25] [INFO ] Flatten gal took : 52 ms
[2026-05-25 23:21:25] [INFO ] Flatten gal took : 22 ms
[2026-05-25 23:21:25] [INFO ] Input system was already deterministic with 271 transitions.
Reduction of identical properties reduced properties to check from 38 to 36
RANDOM walk for 40000 steps (133 resets) in 1420 ms. (28 steps per ms) remains 3/36 properties
BEST_FIRST walk for 40004 steps (16 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
[2026-05-25 23:21:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/261 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 532/561 variables, and 280 constraints, problems are : Problem set: 3 solved, 0 unsolved in 326 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 261/290 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-15-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA HirschbergSinclair-PT-15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 290 stabilizing places and 271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 290 transition count 271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((X(G((p1||G(p2))))&&p0))))))'
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 28 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7208358912802887226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11330540799072140127.kers'
[2026-05-25 23:21:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7208358912802887226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11330540799072140127.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:21:26] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11330540799072140127.kers
Total runtime 1 ms.
[2026-05-25 23:21:26] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 23:21:26] [INFO ] Invariant cache hit.
[2026-05-25 23:21:28] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26897 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56957ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56961ms
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58562 ms. Remains : 285/290 places, 266/271 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((X(G((p1||G(p2))))&&p0))))))'
Stuttering acceptance computed with spot in 362 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-00
Entered a terminal (fully accepting) state of product in 121 steps with 0 reset in 11 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-00 finished in 59019 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 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Reduce places removed 13 places and 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 277 transition count 158
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 177 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 174 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 174 transition count 155
Applied a total of 206 rules in 27 ms. Remains 174 /290 variables (removed 116) and now considering 155/271 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4078510626146819435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3588018188833037499.kers'
[2026-05-25 23:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4078510626146819435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3588018188833037499.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 174 cols 358 entries
Finished phase 1 with 151 SingleSign rule and 4 generalized
[2026-05-25 23:22:25] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3588018188833037499.kers
Total runtime 1 ms.
[2026-05-25 23:22:25] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 23:22:25] [INFO ] Invariant cache hit.
[2026-05-25 23:22:26] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2026-05-25 23:22:26] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-25 23:22:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 3/153 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 134/287 variables, 153/172 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 2/289 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/329 variables, and 173 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8731 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 154/174 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 3/153 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 134/287 variables, 153/172 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 119/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 2/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 12/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/329 variables, and 304 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 154/174 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38756ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 38757ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/290 places, 155/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39294 ms. Remains : 174/290 places, 155/271 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 : HirschbergSinclair-PT-15-LTLFireability-02
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-02 finished in 39366 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))'
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 288 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 288 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 287 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 287 transition count 268
Applied a total of 6 rules in 22 ms. Remains 287 /290 variables (removed 3) and now considering 268/271 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11571734448082718193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5681987423007135885.kers'
[2026-05-25 23:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11571734448082718193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5681987423007135885.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 287 cols 807 entries
Finished phase 1 with 264 SingleSign rule and 4 generalized
[2026-05-25 23:23:05] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5681987423007135885.kers
Total runtime 4 ms.
[2026-05-25 23:23:05] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-25 23:23:05] [INFO ] Invariant cache hit.
[2026-05-25 23:23:06] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-25 23:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27225 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57276ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57278ms
Starting structural reductions in LTL mode, iteration 1 : 287/290 places, 268/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59055 ms. Remains : 287/290 places, 268/271 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))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 11 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 96 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 59674 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)||G(p1)))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 276 transition count 149
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 168 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 165 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 165 transition count 146
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 2 with 1 rules applied. Total rules applied 223 place count 165 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 164 transition count 145
Applied a total of 224 rules in 19 ms. Remains 164 /290 variables (removed 126) and now considering 145/271 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18376808478209698129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9654324949326753697.kers'
[2026-05-25 23:24:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18376808478209698129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9654324949326753697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 164 cols 318 entries
Finished phase 1 with 141 SingleSign rule and 4 generalized
[2026-05-25 23:24:04] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9654324949326753697.kers
Total runtime 1 ms.
[2026-05-25 23:24:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-25 23:24:04] [INFO ] Invariant cache hit.
[2026-05-25 23:24:05] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2026-05-25 23:24:05] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-25 23:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 3/141 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/309 variables, and 160 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5454 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 141/164 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 3/141 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 119/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/309 variables, and 279 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11020 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 141/164 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16482ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 16482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/290 places, 145/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17105 ms. Remains : 164/290 places, 145/271 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)||G(p1)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 840 reset in 254 ms.
Product exploration explored 100000 steps with 840 reset in 294 ms.
Computed a total of 164 stabilizing places and 145 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 145
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 614 steps (0 resets) in 9 ms. (61 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 284 ms.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 145/145 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2026-05-25 23:24:22] [INFO ] Invariant cache hit.
[2026-05-25 23:24:23] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 23:24:23] [INFO ] Invariant cache hit.
[2026-05-25 23:24:23] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2026-05-25 23:24:23] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 572 ms. Remains : 164/164 places, 145/145 transitions.
Computed a total of 164 stabilizing places and 145 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 145
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 610 steps (0 resets) in 15 ms. (38 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 299 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 840 reset in 167 ms.
Product exploration explored 100000 steps with 840 reset in 177 ms.
Built C files in :
/tmp/ltsmin9090617730610621939
[2026-05-25 23:24:24] [INFO ] Computing symmetric may disable matrix : 145 transitions.
[2026-05-25 23:24:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:24] [INFO ] Computing symmetric may enable matrix : 145 transitions.
[2026-05-25 23:24:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:24] [INFO ] Computing Do-Not-Accords matrix : 145 transitions.
[2026-05-25 23:24:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:24] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9090617730610621939
Running compilation step : cd /tmp/ltsmin9090617730610621939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 394 ms.
Running link step : cd /tmp/ltsmin9090617730610621939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9090617730610621939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12576710193410212102.hoa' '--buchi-type=spotba'
LTSmin run took 100 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-04 finished in 20150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(!p0)) U (G(p1)||(!p2&&F(p1))))))'
Support contains 5 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 16 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1592437354819406715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6786678961865601417.kers'
[2026-05-25 23:24:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1592437354819406715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6786678961865601417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:24:24] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6786678961865601417.kers
Total runtime 2 ms.
[2026-05-25 23:24:25] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 23:24:25] [INFO ] Invariant cache hit.
[2026-05-25 23:24:26] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26866 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56904ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56906ms
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58439 ms. Remains : 285/290 places, 266/271 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(!p0)) U (G(p1)||(!p2&&F(p1))))))'
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0, true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 780 reset in 203 ms.
Product exploration explored 100000 steps with 773 reset in 257 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 14 factoid took 26 ms. Proved property starting from automaton with 9 states, 20 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 101 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-05 finished in 59368 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||G(F(p1))) U (F(p2) U X(p3))))'
Support contains 6 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 11 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
[2026-05-25 23:25:24] [INFO ] Invariant cache hit.
[2026-05-25 23:25:24] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 23:25:24] [INFO ] Invariant cache hit.
[2026-05-25 23:25:25] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1468 ms. Remains : 285/290 places, 266/271 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||G(F(p1))) U (F(p2) U X(p3))))'
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-06
Product exploration explored 100000 steps with 6088 reset in 281 ms.
Product exploration explored 100000 steps with 6141 reset in 263 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 25 factoid took 262 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 4 AP (stutter sensitive).
RANDOM walk for 708 steps (0 resets) in 17 ms. (39 steps per ms) remains 0/13 properties
Knowledge based reduction with 25 factoid took 489 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2026-05-25 23:25:27] [INFO ] Invariant cache hit.
[2026-05-25 23:25:28] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 14 ms returned sat
[2026-05-25 23:25:29] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2026-05-25 23:25:29] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 15 ms.
[2026-05-25 23:25:31] [INFO ] Added : 52 causal constraints over 11 iterations in 1408 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 4377 ms.
Stuttering acceptance computed with spot in 344 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2026-05-25 23:25:31] [INFO ] Invariant cache hit.
[2026-05-25 23:25:31] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 23:25:31] [INFO ] Invariant cache hit.
[2026-05-25 23:25:32] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1464 ms. Remains : 285/285 places, 266/266 transitions.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 23 factoid took 227 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 4 AP (stutter sensitive).
RANDOM walk for 702 steps (0 resets) in 16 ms. (41 steps per ms) remains 0/13 properties
Knowledge based reduction with 23 factoid took 521 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2026-05-25 23:25:34] [INFO ] Invariant cache hit.
[2026-05-25 23:25:34] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 14 ms returned sat
[2026-05-25 23:25:35] [INFO ] [Real]Absence check using state equation in 1652 ms returned sat
[2026-05-25 23:25:35] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 13 ms.
[2026-05-25 23:25:37] [INFO ] Added : 52 causal constraints over 11 iterations in 1396 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 4409 ms.
Stuttering acceptance computed with spot in 290 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4703 reset in 247 ms.
Product exploration explored 100000 steps with 4753 reset in 268 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/ltsmin18054671480332447067
[2026-05-25 23:25:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18054671480332447067
Running compilation step : cd /tmp/ltsmin18054671480332447067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin18054671480332447067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18054671480332447067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10143020143725553996.hoa' '--buchi-type=spotba'
LTSmin run took 63 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-06 finished in 14696 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) U X(p1)))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 17 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
[2026-05-25 23:25:39] [INFO ] Invariant cache hit.
[2026-05-25 23:25:39] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 23:25:39] [INFO ] Invariant cache hit.
[2026-05-25 23:25:40] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1664 ms. Remains : 285/290 places, 266/271 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) U X(p1)))'
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 2262 reset in 301 ms.
Product exploration explored 100000 steps with 2242 reset in 261 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 9 factoid took 48 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 1010 steps (0 resets) in 17 ms. (56 steps per ms) remains 0/3 properties
Knowledge based reduction with 9 factoid took 74 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-25 23:25:41] [INFO ] Invariant cache hit.
[2026-05-25 23:25:41] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 8 ms returned sat
[2026-05-25 23:25:42] [INFO ] [Real]Absence check using state equation in 153 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 628 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-08 finished in 3050 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 U p1))))'
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 275 transition count 141
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 160 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 233 place count 157 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 236 place count 157 transition count 138
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 2 with 1 rules applied. Total rules applied 237 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 156 transition count 137
Applied a total of 238 rules in 20 ms. Remains 156 /290 variables (removed 134) and now considering 137/271 (removed 134) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12125910577791037551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6282324503752925021.kers'
[2026-05-25 23:25:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12125910577791037551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6282324503752925021.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 156 cols 286 entries
Finished phase 1 with 133 SingleSign rule and 4 generalized
[2026-05-25 23:25:42] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6282324503752925021.kers
Total runtime 1 ms.
[2026-05-25 23:25:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 23:25:42] [INFO ] Invariant cache hit.
[2026-05-25 23:25:42] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2026-05-25 23:25:42] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-25 23:25:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 3/243 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/293 variables, and 150 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5825 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 111/240 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 101/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 3/243 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 7/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/293 variables, and 258 constraints, problems are : Problem set: 0 solved, 108 unsolved in 17033 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22867ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 22868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/290 places, 137/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23360 ms. Remains : 156/290 places, 137/271 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 U p1))))'
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-09
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-09 finished in 23462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 276 transition count 148
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 218 place count 167 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 221 place count 164 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 224 place count 164 transition count 145
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 2 with 1 rules applied. Total rules applied 225 place count 164 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 163 transition count 144
Applied a total of 226 rules in 14 ms. Remains 163 /290 variables (removed 127) and now considering 144/271 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7256600683026674442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6335855257768687053.kers'
[2026-05-25 23:26:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7256600683026674442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6335855257768687053.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 163 cols 314 entries
Finished phase 1 with 140 SingleSign rule and 4 generalized
[2026-05-25 23:26:05] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6335855257768687053.kers
Total runtime 1 ms.
[2026-05-25 23:26:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 23:26:05] [INFO ] Invariant cache hit.
[2026-05-25 23:26:06] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2026-05-25 23:26:06] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2026-05-25 23:26:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 3/140 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 121/261 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/307 variables, and 159 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5546 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 140/163 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 3/140 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 121/261 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 118/277 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/307 variables, and 277 constraints, problems are : Problem set: 0 solved, 118 unsolved in 15737 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 140/163 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21309ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 21310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/290 places, 144/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21831 ms. Remains : 163/290 places, 144/271 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 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 690 reset in 168 ms.
Product exploration explored 100000 steps with 687 reset in 203 ms.
Computed a total of 163 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 163 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 9 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 58 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-10 finished in 22350 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(p0)||X(((p1&&F(G(p2))) U (G((p1&&F(G(p2))))||(p1&&X((!p3&&F(G(p2)))))))))))'
Support contains 5 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 13 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8595264996430184433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-550697517222719613.kers'
[2026-05-25 23:26:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8595264996430184433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-550697517222719613.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:26:27] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-550697517222719613.kers
Total runtime 1 ms.
[2026-05-25 23:26:28] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 23:26:28] [INFO ] Invariant cache hit.
[2026-05-25 23:26:29] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:26:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 27167 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57206ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57207ms
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58760 ms. Remains : 285/290 places, 266/271 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(p0)||X(((p1&&F(G(p2))) U (G((p1&&F(G(p2))))||(p1&&X((!p3&&F(G(p2)))))))))))'
Stuttering acceptance computed with spot in 384 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 p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p2) (AND (NOT p1) p3)), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-11
Product exploration explored 100000 steps with 339 reset in 242 ms.
Product exploration explored 100000 steps with 339 reset in 208 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 154 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (132 resets) in 256 ms. (155 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
[2026-05-25 23:27:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/258 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 5 (OVERLAPS) 266/524 variables, 258/277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/551 variables, 27/304 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 3 solved, 1 unsolved in 296 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/161 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/258 variables, 15/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 266/524 variables, 258/277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/551 variables, 27/304 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 1/305 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/305 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/551 variables, 0/305 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 305 constraints, problems are : Problem set: 3 solved, 1 unsolved in 321 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 621ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 266/266 transitions.
Graph (complete) has 539 edges and 285 vertex of which 271 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 271 transition count 148
Reduce places removed 104 places and 0 transitions.
Graph (complete) has 290 edges and 167 vertex of which 142 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 105 rules applied. Total rules applied 224 place count 142 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 249 place count 142 transition count 123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 142 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 141 transition count 122
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 264 place count 128 transition count 109
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 59 rules applied. Total rules applied 323 place count 116 transition count 62
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 370 place count 69 transition count 62
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 370 place count 69 transition count 40
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 414 place count 47 transition count 40
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 416 place count 45 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 416 place count 45 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 420 place count 43 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 426 place count 40 transition count 35
Applied a total of 426 rules in 31 ms. Remains 40 /285 variables (removed 245) and now considering 35/266 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 40/285 places, 35/266 transitions.
RANDOM walk for 40000 steps (1072 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 20538 steps (280 resets) in 27 ms. (733 steps per ms) remains 0/1 properties
Found 3 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 11 ms. Proved property starting from automaton with 8 states, 15 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1244 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-11 finished in 60886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X((G(p2) U X(p0)))))'
Support contains 5 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 288 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 288 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 286 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 286 transition count 267
Applied a total of 8 rules in 33 ms. Remains 286 /290 variables (removed 4) and now considering 267/271 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8254958927374978700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10934297813329682191.kers'
[2026-05-25 23:27:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8254958927374978700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10934297813329682191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 286 cols 805 entries
Finished phase 1 with 263 SingleSign rule and 4 generalized
[2026-05-25 23:27:28] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10934297813329682191.kers
Total runtime 3 ms.
[2026-05-25 23:27:28] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 23:27:28] [INFO ] Invariant cache hit.
[2026-05-25 23:27:30] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 23:27:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 27584 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57638ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 57639ms
Starting structural reductions in LTL mode, iteration 1 : 286/290 places, 267/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59198 ms. Remains : 286/290 places, 267/271 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X((G(p2) U X(p0)))))'
Stuttering acceptance computed with spot in 616 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-12 finished in 59874 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&&(p1||F(G(p2))))))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 18 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6695871294763699655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14768093448334604299.kers'
[2026-05-25 23:28:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6695871294763699655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14768093448334604299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:28:28] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14768093448334604299.kers
Total runtime 4 ms.
[2026-05-25 23:28:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 23:28:28] [INFO ] Invariant cache hit.
[2026-05-25 23:28:30] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:28:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26768 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56815ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56816ms
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58548 ms. Remains : 285/290 places, 266/271 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||F(G(p2))))))'
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-13 finished in 58705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (G((X(X(p0))||G(p1)))||((X(X(p0))||G(p1))&&(G(!p0)||p2)))))'
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 271/271 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 287 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 285 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 285 transition count 266
Applied a total of 10 rules in 14 ms. Remains 285 /290 variables (removed 5) and now considering 266/271 (removed 5) transitions.
[2026-05-25 23:29:27] [INFO ] Invariant cache hit.
[2026-05-25 23:29:27] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 23:29:27] [INFO ] Invariant cache hit.
[2026-05-25 23:29:28] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 285/290 places, 266/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1588 ms. Remains : 285/290 places, 266/271 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (G((X(X(p0))||G(p1)))||((X(X(p0))||G(p1))&&(G(!p0)||p2)))))'
Stuttering acceptance computed with spot in 499 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), false, (AND (NOT p0) (NOT p1)), (NOT p0), true, false, false, (AND (NOT p1) (NOT p0)), false, false, (NOT p1), p0, (AND (NOT p1) p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-15 finished in 2140 ms.
All properties solved by simple procedures.
Total runtime 545498 ms.

BK_STOP 1779751769857

--------------------
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="HirschbergSinclair-PT-15"
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 HirschbergSinclair-PT-15, 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 r146-tall-177961074400748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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