Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200324.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.0K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 544K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779472791513

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 17:59:52] [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-22 17:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:59:53] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2026-05-22 17:59:53] [INFO ] Transformed 1638 places.
[2026-05-22 17:59:53] [INFO ] Transformed 2094 transitions.
[2026-05-22 17:59:53] [INFO ] Found NUPN structural information;
[2026-05-22 17:59:53] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 269 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 ASLink-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 1638 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 1543 transition count 1999
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 1543 transition count 1999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 191 place count 1543 transition count 1998
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 222 place count 1512 transition count 1962
Iterating global reduction 1 with 31 rules applied. Total rules applied 253 place count 1512 transition count 1962
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 263 place count 1512 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 267 place count 1508 transition count 1948
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 1508 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 274 place count 1505 transition count 1945
Iterating global reduction 2 with 3 rules applied. Total rules applied 277 place count 1505 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 279 place count 1503 transition count 1943
Iterating global reduction 2 with 2 rules applied. Total rules applied 281 place count 1503 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 283 place count 1501 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 1501 transition count 1941
Applied a total of 285 rules in 1113 ms. Remains 1501 /1638 variables (removed 137) and now considering 1941/2094 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7362158294764262570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15123768189300417644.kers'
[2026-05-22 17:59:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7362158294764262570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15123768189300417644.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1941 rows 1501 cols 6138 entries
Finished phase 1 with 957 SingleSign rule and 384 generalized
[2026-05-22 17:59:54] [INFO ] Computed 160 invariants in 12 ms
Computed 160 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15123768189300417644.kers
Total runtime 14 ms.
[2026-05-22 17:59:56] [INFO ] Implicit Places using invariants in 1420 ms returned [1334, 1345, 1364, 1380, 1388, 1399, 1407, 1415, 1426]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1468 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1492/1638 places, 1941/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1481 transition count 1930
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1481 transition count 1930
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 1472 transition count 1921
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 1472 transition count 1921
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1465 transition count 1914
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1465 transition count 1914
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1461 transition count 1910
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1461 transition count 1910
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 1459 transition count 1908
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 1459 transition count 1908
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 1457 transition count 1906
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 1457 transition count 1906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1455 transition count 1904
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1455 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1454 transition count 1903
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1454 transition count 1903
Applied a total of 76 rules in 671 ms. Remains 1454 /1492 variables (removed 38) and now considering 1903/1941 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5634407097920831569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1995025291843541475.kers'
[2026-05-22 17:59:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5634407097920831569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1995025291843541475.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1903 rows 1454 cols 6017 entries
Finished phase 1 with 948 SingleSign rule and 355 generalized
[2026-05-22 17:59:56] [INFO ] Computed 151 invariants in 10 ms
Computed 151 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1995025291843541475.kers
Total runtime 13 ms.
[2026-05-22 17:59:57] [INFO ] Implicit Places using invariants in 943 ms returned []
[2026-05-22 17:59:57] [INFO ] Invariant cache hit.
[2026-05-22 18:00:01] [INFO ] Implicit Places using invariants and state equation in 4178 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1454/1638 places, 1903/2094 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8419 ms. Remains : 1454/1638 places, 1903/2094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Applied a total of 0 rules in 126 ms. Remains 1454 /1454 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2026-05-22 18:00:01] [INFO ] Invariant cache hit.
[2026-05-22 18:00:03] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2026-05-22 18:00:03] [INFO ] Invariant cache hit.
[2026-05-22 18:00:07] [INFO ] Implicit Places using invariants and state equation in 4099 ms returned []
Implicit Place search using SMT with State Equation took 5339 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2026-05-22 18:00:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1453 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1453/3357 variables, and 88 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 88/118 constraints, State Equation: 0/1454 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1453 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 1902 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1453/3357 variables, and 88 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 88/118 constraints, State Equation: 0/1454 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60836ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60888ms
Finished structural reductions in LTL mode , in 1 iterations and 66422 ms. Remains : 1454/1454 places, 1903/1903 transitions.
Support contains 61 out of 1454 places after structural reductions.
[2026-05-22 18:01:08] [INFO ] Flatten gal took : 160 ms
[2026-05-22 18:01:08] [INFO ] Flatten gal took : 88 ms
[2026-05-22 18:01:09] [INFO ] Input system was already deterministic with 1903 transitions.
Support contains 58 out of 1454 places (down from 61) after GAL structural reductions.
RANDOM walk for 40000 steps (118 resets) in 1480 ms. (27 steps per ms) remains 12/36 properties
BEST_FIRST walk for 40004 steps (19 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (19 resets) in 411 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (18 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (22 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (20 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
[2026-05-22 18:01:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 195/220 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 325/545 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 843/1388 variables, 98/131 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1388 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 66/1454 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1454 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1903/3357 variables, 1454/1605 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3357 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/3357 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3357/3357 variables, and 1605 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3927 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 1454/1454 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 195/220 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 325/545 variables, 25/33 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 843/1388 variables, 98/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1388 variables, 5/136 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1388 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 66/1454 variables, 20/156 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1454/3357 variables, and 156 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5070 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 118/118 constraints, State Equation: 0/1454 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9022ms problems are : Problem set: 2 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1454 transition count 1651
Reduce places removed 252 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 258 rules applied. Total rules applied 510 place count 1202 transition count 1645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 513 place count 1199 transition count 1645
Performed 383 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 383 Pre rules applied. Total rules applied 513 place count 1199 transition count 1262
Deduced a syphon composed of 383 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 417 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1313 place count 782 transition count 1262
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1338 place count 779 transition count 1240
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1360 place count 757 transition count 1240
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1360 place count 757 transition count 1227
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1399 place count 731 transition count 1227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1399 place count 731 transition count 1215
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1423 place count 719 transition count 1215
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1428 place count 714 transition count 1202
Iterating global reduction 5 with 5 rules applied. Total rules applied 1433 place count 714 transition count 1202
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1433 place count 714 transition count 1199
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1439 place count 711 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1440 place count 710 transition count 1191
Iterating global reduction 5 with 1 rules applied. Total rules applied 1441 place count 710 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1442 place count 709 transition count 1183
Iterating global reduction 5 with 1 rules applied. Total rules applied 1443 place count 709 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1444 place count 708 transition count 1175
Iterating global reduction 5 with 1 rules applied. Total rules applied 1445 place count 708 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1446 place count 707 transition count 1167
Iterating global reduction 5 with 1 rules applied. Total rules applied 1447 place count 707 transition count 1167
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 227 rules applied. Total rules applied 1674 place count 593 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1678 place count 589 transition count 1050
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1683 place count 588 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1683 place count 588 transition count 1049
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1685 place count 587 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1687 place count 585 transition count 1047
Iterating global reduction 5 with 2 rules applied. Total rules applied 1689 place count 585 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1691 place count 585 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1692 place count 584 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1694 place count 583 transition count 1051
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1698 place count 583 transition count 1047
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1702 place count 579 transition count 1047
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1704 place count 579 transition count 1045
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1706 place count 577 transition count 1045
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1707 place count 577 transition count 1045
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1708 place count 576 transition count 1044
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 9 rules applied. Total rules applied 1717 place count 570 transition count 1041
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1720 place count 567 transition count 1041
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 9 Pre rules applied. Total rules applied 1720 place count 567 transition count 1032
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 19 rules applied. Total rules applied 1739 place count 557 transition count 1032
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 11 with 4 rules applied. Total rules applied 1743 place count 553 transition count 1032
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1743 place count 553 transition count 1031
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1745 place count 552 transition count 1031
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1759 place count 545 transition count 1024
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1762 place count 542 transition count 1021
Iterating global reduction 12 with 3 rules applied. Total rules applied 1765 place count 542 transition count 1021
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1767 place count 540 transition count 1019
Iterating global reduction 12 with 2 rules applied. Total rules applied 1769 place count 540 transition count 1019
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1771 place count 540 transition count 1017
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1772 place count 540 transition count 1016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1773 place count 539 transition count 1016
Applied a total of 1773 rules in 684 ms. Remains 539 /1454 variables (removed 915) and now considering 1016/1903 (removed 887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 685 ms. Remains : 539/1454 places, 1016/1903 transitions.
RANDOM walk for 40000 steps (442 resets) in 395 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (123 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (125 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (131 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (131 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (133 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (132 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (132 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (90 resets) in 148 ms. (268 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (130 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3528680940315087860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5597079147110135198.kers'
[2026-05-22 18:01:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3528680940315087860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5597079147110135198.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 1016 rows 530 cols 3975 entries
Finished phase 1 with 131 SingleSign rule and 320 generalized
[2026-05-22 18:01:20] [INFO ] Computed 88 invariants in 6 ms
Computed 88 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5597079147110135198.kers
Total runtime 7 ms.
[2026-05-22 18:01:20] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 54/134 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 250/386 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 50/436 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 33/469 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/469 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 17/486 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/486 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 51/537 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/539 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 1016/1555 variables, 539/627 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1555 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1555 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 0/1555 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1555/1555 variables, and 629 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 539/539 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 54/134 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 250/386 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 50/436 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 33/469 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 17/486 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/486 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 51/537 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/539 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/539 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 23 (OVERLAPS) 1016/1555 variables, 539/629 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1555 variables, 2/631 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1555 variables, 2/633 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1555 variables, 3/636 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1555 variables, 0/636 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1555 variables, 0/636 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1555/1555 variables, and 636 constraints, problems are : Problem set: 7 solved, 2 unsolved in 6508 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 539/539 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8508ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 224 ms.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 1016/1016 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 539 transition count 1008
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 531 transition count 1008
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 529 transition count 994
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 529 transition count 994
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 528 transition count 994
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 527 transition count 986
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 527 transition count 986
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 526 transition count 978
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 526 transition count 978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 525 transition count 970
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 525 transition count 970
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 524 transition count 962
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 524 transition count 962
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 523 transition count 954
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 523 transition count 954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 522 transition count 946
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 522 transition count 946
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 521 transition count 938
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 521 transition count 938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 520 transition count 930
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 520 transition count 930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 519 transition count 922
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 519 transition count 922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 518 transition count 914
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 518 transition count 914
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 517 transition count 906
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 517 transition count 906
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 515 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 514 transition count 903
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 514 transition count 903
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 514 transition count 902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 513 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 512 transition count 901
Applied a total of 52 rules in 328 ms. Remains 512 /539 variables (removed 27) and now considering 901/1016 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 512/539 places, 901/1016 transitions.
RANDOM walk for 40000 steps (591 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (158 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 531924 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :1 out of 2
Probabilistic random walk after 531924 steps, saw 149548 distinct states, run finished after 3019 ms. (steps per millisecond=176 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9200837641255489478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6456062441493281719.kers'
[2026-05-22 18:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9200837641255489478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6456062441493281719.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 901 rows 501 cols 3524 entries
Finished phase 1 with 131 SingleSign rule and 294 generalized
[2026-05-22 18:01:33] [INFO ] Computed 87 invariants in 8 ms
Computed 87 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6456062441493281719.kers
Total runtime 9 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/207 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/245 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/271 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/333 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/365 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/391 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/391 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/427 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/440 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 59/499 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/499 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/499 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 3/502 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/502 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/503 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/503 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 9/512 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/512 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 901/1413 variables, 512/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1413 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/1413 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1413/1413 variables, and 600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1475 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/207 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/245 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/271 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/333 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/365 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/391 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/391 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/427 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/440 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 59/499 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/499 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/499 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/499 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 3/502 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/502 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/503 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/503 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 9/512 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/512 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 901/1413 variables, 512/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1413 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1413 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/1413 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1413/1413 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2717ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 901/901 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 512 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 511 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 511 transition count 899
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 510 transition count 899
Applied a total of 4 rules in 22 ms. Remains 510 /512 variables (removed 2) and now considering 899/901 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 510/512 places, 899/901 transitions.
RANDOM walk for 40000 steps (554 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (158 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 550891 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 550891 steps, saw 152226 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17664072004834665957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2006847808068673492.kers'
[2026-05-22 18:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17664072004834665957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2006847808068673492.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 1 ms.
// Phase 1: matrix 899 rows 499 cols 3520 entries
Finished phase 1 with 129 SingleSign rule and 294 generalized
[2026-05-22 18:01:38] [INFO ] Computed 87 invariants in 17 ms
Computed 87 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2006847808068673492.kers
Total runtime 20 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/207 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/245 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/271 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/331 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/363 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/389 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/425 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/438 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/438 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 59/497 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/497 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/500 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/500 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/500 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/501 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/501 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 9/510 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/510 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 899/1409 variables, 510/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1409 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/1409 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1409/1409 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/207 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/245 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/271 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 60/331 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/363 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/389 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/425 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/438 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/438 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 59/497 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/497 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/500 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/500 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/500 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/501 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/501 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 9/510 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/510 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/510 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 899/1409 variables, 510/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1409 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1409 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/1409 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2721ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 899/899 transitions.
Applied a total of 0 rules in 28 ms. Remains 510 /510 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 510/510 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 899/899 transitions.
Applied a total of 0 rules in 24 ms. Remains 510 /510 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2026-05-22 18:01:41] [INFO ] Invariant cache hit.
[2026-05-22 18:01:42] [INFO ] Implicit Places using invariants in 462 ms returned [1, 18, 19, 50, 68, 88, 137, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 331, 381, 382, 385, 396, 397, 398, 416, 420, 438, 439, 440, 441, 458, 466]
[2026-05-22 18:01:42] [INFO ] Actually due to overlaps returned [416, 398, 50, 171, 294, 154, 151, 274, 277, 396, 438, 152, 275, 397, 439, 1, 18, 262, 263, 381, 382, 420, 189, 440, 19, 68, 88, 137, 312, 331, 385, 441, 458, 466]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 466 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/510 places, 899/899 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 475 transition count 843
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 419 transition count 841
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 115 place count 419 transition count 820
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 158 place count 397 transition count 820
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 170 place count 393 transition count 812
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 178 place count 385 transition count 812
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 184 place count 379 transition count 806
Iterating global reduction 4 with 6 rules applied. Total rules applied 190 place count 379 transition count 806
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 193 place count 379 transition count 803
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 378 transition count 801
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 378 transition count 801
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 247 place count 352 transition count 775
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 249 place count 350 transition count 772
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 350 transition count 772
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 252 place count 350 transition count 771
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 256 place count 348 transition count 772
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 348 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 258 place count 347 transition count 771
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 265 place count 347 transition count 764
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 273 place count 339 transition count 764
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 282 place count 339 transition count 764
Applied a total of 282 rules in 143 ms. Remains 339 /476 variables (removed 137) and now considering 764/899 (removed 135) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17276412235900246888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11870845391609644568.kers'
[2026-05-22 18:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17276412235900246888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11870845391609644568.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 764 rows 338 cols 3129 entries
Finished phase 1 with 85 SingleSign rule and 208 generalized
[2026-05-22 18:01:42] [INFO ] Computed 46 invariants in 4 ms
Computed 46 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11870845391609644568.kers
Total runtime 5 ms.
[2026-05-22 18:01:42] [INFO ] Implicit Places using invariants in 307 ms returned [96, 102, 105, 107, 108, 111, 112, 165, 181, 187, 190, 192, 197, 198, 264, 270, 273, 275]
[2026-05-22 18:01:42] [INFO ] Actually due to overlaps returned [111, 197, 112, 198, 96, 102, 107, 181, 187, 192, 264, 270, 275, 108, 165]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 319 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 324/510 places, 764/899 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 312 transition count 752
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 312 transition count 752
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 309 transition count 749
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 309 transition count 749
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 305 transition count 745
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 305 transition count 736
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 296 transition count 736
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 296 transition count 735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 295 transition count 735
Applied a total of 58 rules in 44 ms. Remains 295 /324 variables (removed 29) and now considering 735/764 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5976124157665696056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13932608505785531196.kers'
[2026-05-22 18:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5976124157665696056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13932608505785531196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 735 rows 295 cols 2990 entries
Finished phase 1 with 63 SingleSign rule and 201 generalized
[2026-05-22 18:01:42] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13932608505785531196.kers
Total runtime 5 ms.
[2026-05-22 18:01:42] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-22 18:01:42] [INFO ] Invariant cache hit.
[2026-05-22 18:01:43] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 295/510 places, 735/899 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1867 ms. Remains : 295/510 places, 735/899 transitions.
RANDOM walk for 40000 steps (866 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (275 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 670669 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 670669 steps, saw 207609 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2026-05-22 18:01:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/66 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/200 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/206 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 83/289 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/295 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/295 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 735/1030 variables, 295/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1030 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1030 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/66 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/117 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/200 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/206 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 83/289 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/295 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/295 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 735/1030 variables, 295/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1030 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1030 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1030 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 735/735 transitions.
Applied a total of 0 rules in 9 ms. Remains 295 /295 variables (removed 0) and now considering 735/735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 295/295 places, 735/735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 735/735 transitions.
Applied a total of 0 rules in 8 ms. Remains 295 /295 variables (removed 0) and now considering 735/735 (removed 0) transitions.
[2026-05-22 18:01:47] [INFO ] Invariant cache hit.
[2026-05-22 18:01:48] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-22 18:01:48] [INFO ] Invariant cache hit.
[2026-05-22 18:01:48] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2026-05-22 18:01:48] [INFO ] Redundant transitions in 29 ms returned []
Running 714 sub problems to find dead transitions.
[2026-05-22 18:01:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Problem TDEAD245 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 2/31 constraints. Problems are: Problem set: 4 solved, 710 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/1030 variables, and 31 constraints, problems are : Problem set: 4 solved, 710 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 19/29 constraints. Problems are: Problem set: 4 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 2/31 constraints. Problems are: Problem set: 4 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 2/33 constraints. Problems are: Problem set: 4 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 1/34 constraints. Problems are: Problem set: 4 solved, 710 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/1030 variables, and 34 constraints, problems are : Problem set: 4 solved, 710 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 0/714 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 4 solved, 710 unsolved
Search for dead transitions found 4 dead transitions in 60215ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 295/295 places, 731/735 transitions.
Applied a total of 0 rules in 16 ms. Remains 295 /295 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2026-05-22 18:02:49] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61349 ms. Remains : 295/295 places, 731/735 transitions.
FORMULA ASLink-PT-03b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-03b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-03b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 57 stabilizing places and 57 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(!((G(p1) U X(p2)) U !p3))))'
Support contains 5 out of 1454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1444 transition count 1875
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1444 transition count 1875
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1444 transition count 1874
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 1440 transition count 1870
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 1440 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1439 transition count 1862
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1439 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1438 transition count 1861
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1438 transition count 1861
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1437 transition count 1853
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1437 transition count 1853
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1436 transition count 1845
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1436 transition count 1845
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1435 transition count 1844
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1435 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1434 transition count 1836
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1434 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1433 transition count 1828
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1433 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1432 transition count 1827
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1432 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1431 transition count 1819
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1431 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1430 transition count 1811
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1430 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1429 transition count 1810
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1429 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1428 transition count 1802
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1428 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1427 transition count 1794
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1427 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1426 transition count 1793
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1426 transition count 1793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1425 transition count 1785
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1425 transition count 1785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1424 transition count 1777
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1424 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1423 transition count 1776
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1423 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1422 transition count 1768
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1422 transition count 1768
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1421 transition count 1760
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1421 transition count 1760
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1420 transition count 1759
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1420 transition count 1759
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1419 transition count 1751
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1419 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1418 transition count 1743
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1418 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1417 transition count 1742
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1417 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 1416 transition count 1734
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 1416 transition count 1734
Applied a total of 77 rules in 1747 ms. Remains 1416 /1454 variables (removed 38) and now considering 1734/1903 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1833981013165543340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12300335159930125314.kers'
[2026-05-22 18:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1833981013165543340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12300335159930125314.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1734 rows 1416 cols 5381 entries
Finished phase 1 with 912 SingleSign rule and 353 generalized
[2026-05-22 18:02:51] [INFO ] Computed 151 invariants in 34 ms
Computed 151 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-12300335159930125314.kers
Total runtime 39 ms.
[2026-05-22 18:02:52] [INFO ] Implicit Places using invariants in 995 ms returned [1312, 1325]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 999 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1414/1454 places, 1734/1903 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1411 transition count 1731
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1411 transition count 1731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1408 transition count 1728
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1408 transition count 1728
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1405 transition count 1725
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1405 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1404 transition count 1724
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1404 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1403 transition count 1723
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1403 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1402 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1402 transition count 1722
Applied a total of 24 rules in 404 ms. Remains 1402 /1414 variables (removed 12) and now considering 1722/1734 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17990491149075476601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8153565364958081615.kers'
[2026-05-22 18:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17990491149075476601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8153565364958081615.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1722 rows 1402 cols 5342 entries
Finished phase 1 with 907 SingleSign rule and 346 generalized
[2026-05-22 18:02:52] [INFO ] Computed 149 invariants in 11 ms
Computed 149 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8153565364958081615.kers
Total runtime 12 ms.
[2026-05-22 18:02:53] [INFO ] Implicit Places using invariants in 873 ms returned []
[2026-05-22 18:02:53] [INFO ] Invariant cache hit.
[2026-05-22 18:02:57] [INFO ] Implicit Places using invariants and state equation in 4014 ms returned []
Implicit Place search using SMT with State Equation took 4911 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1402/1454 places, 1722/1903 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8061 ms. Remains : 1402/1454 places, 1722/1903 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(!((G(p1) U X(p2)) U !p3))))'
Stuttering acceptance computed with spot in 1127 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3) p2), false, (AND p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND (NOT p0) p1 p3 p2), (AND (NOT p0) (NOT p3) p1 p2), (AND p1 p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-00
Stuttering criterion allowed to conclude after 458 steps with 0 reset in 6 ms.
FORMULA ASLink-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLFireability-00 finished in 9346 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((false U G(p0)))) U p1))'
Support contains 6 out of 1454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1443 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1443 transition count 1874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1443 transition count 1872
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1439 transition count 1868
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1439 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 1438 transition count 1860
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 1438 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 1437 transition count 1859
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 1437 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1436 transition count 1851
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1436 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 1435 transition count 1843
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 1435 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 1434 transition count 1842
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 1434 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 1433 transition count 1834
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 1433 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 1432 transition count 1826
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 1432 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1431 transition count 1825
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1431 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1430 transition count 1817
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1430 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1429 transition count 1809
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1429 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1428 transition count 1808
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1428 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1427 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1427 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1426 transition count 1792
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1426 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1425 transition count 1791
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1425 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1424 transition count 1783
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1424 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1423 transition count 1775
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1423 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1422 transition count 1774
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1422 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1421 transition count 1766
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1421 transition count 1766
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1420 transition count 1758
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1420 transition count 1758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 1419 transition count 1757
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 1419 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 1418 transition count 1749
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 1418 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 1417 transition count 1741
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 1417 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1416 transition count 1740
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1416 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 1415 transition count 1732
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 1415 transition count 1732
Applied a total of 80 rules in 1906 ms. Remains 1415 /1454 variables (removed 39) and now considering 1732/1903 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16899585603950320611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17333398414953404833.kers'
[2026-05-22 18:03:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16899585603950320611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17333398414953404833.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1732 rows 1415 cols 5377 entries
Finished phase 1 with 911 SingleSign rule and 353 generalized
[2026-05-22 18:03:01] [INFO ] Computed 151 invariants in 11 ms
Computed 151 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17333398414953404833.kers
Total runtime 14 ms.
[2026-05-22 18:03:02] [INFO ] Implicit Places using invariants in 1038 ms returned [1312]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1414/1454 places, 1732/1903 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1412 transition count 1730
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1412 transition count 1730
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1410 transition count 1728
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1410 transition count 1728
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1408 transition count 1726
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1408 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1407 transition count 1725
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1407 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1406 transition count 1724
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1406 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1405 transition count 1723
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1405 transition count 1723
Applied a total of 18 rules in 440 ms. Remains 1405 /1414 variables (removed 9) and now considering 1723/1732 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7205911123198255566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1491851490540145948.kers'
[2026-05-22 18:03:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7205911123198255566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1491851490540145948.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1723 rows 1405 cols 5349 entries
Finished phase 1 with 906 SingleSign rule and 349 generalized
[2026-05-22 18:03:02] [INFO ] Computed 150 invariants in 10 ms
Computed 150 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1491851490540145948.kers
Total runtime 15 ms.
[2026-05-22 18:03:03] [INFO ] Implicit Places using invariants in 963 ms returned []
[2026-05-22 18:03:03] [INFO ] Invariant cache hit.
[2026-05-22 18:03:06] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 4436 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1405/1454 places, 1723/1903 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7835 ms. Remains : 1405/1454 places, 1723/1903 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((false U G(p0)))) U p1))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLFireability-01 finished in 8010 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(F((p0&&X(X(p0)))))||(F((p0&&X(X(p0))))&&X(p1)))))'
Support contains 2 out of 1454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1445 transition count 1876
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1445 transition count 1876
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1445 transition count 1875
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 1442 transition count 1872
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 1442 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1441 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1441 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1440 transition count 1863
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1440 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1439 transition count 1855
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1439 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1438 transition count 1847
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1438 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1437 transition count 1846
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1437 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1436 transition count 1838
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1436 transition count 1838
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1435 transition count 1830
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1435 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1434 transition count 1829
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1434 transition count 1829
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1433 transition count 1821
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1433 transition count 1821
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1432 transition count 1813
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1432 transition count 1813
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1431 transition count 1812
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1431 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1430 transition count 1804
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1430 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1429 transition count 1796
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1429 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1428 transition count 1795
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1428 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1427 transition count 1787
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1427 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1426 transition count 1779
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1426 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1425 transition count 1778
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1425 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1424 transition count 1770
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1424 transition count 1770
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1423 transition count 1762
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1423 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1422 transition count 1761
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1422 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1421 transition count 1753
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1421 transition count 1753
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1420 transition count 1745
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1420 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1419 transition count 1744
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1419 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1418 transition count 1736
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1418 transition count 1736
Applied a total of 73 rules in 1785 ms. Remains 1418 /1454 variables (removed 36) and now considering 1736/1903 (removed 167) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16022631016633364151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16314414515823019473.kers'
[2026-05-22 18:03:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16022631016633364151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16314414515823019473.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1736 rows 1418 cols 5385 entries
Finished phase 1 with 915 SingleSign rule and 352 generalized
[2026-05-22 18:03:08] [INFO ] Computed 151 invariants in 32 ms
Computed 151 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-16314414515823019473.kers
Total runtime 37 ms.
[2026-05-22 18:03:09] [INFO ] Implicit Places using invariants in 1005 ms returned [1315, 1328]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1416/1454 places, 1736/1903 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1413 transition count 1733
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1413 transition count 1733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1410 transition count 1730
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1410 transition count 1730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1407 transition count 1727
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1407 transition count 1727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1406 transition count 1726
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1406 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1405 transition count 1725
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1405 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1404 transition count 1724
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1404 transition count 1724
Applied a total of 24 rules in 435 ms. Remains 1404 /1416 variables (removed 12) and now considering 1724/1736 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15499297574588838110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14781466096444652728.kers'
[2026-05-22 18:03:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15499297574588838110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14781466096444652728.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1724 rows 1404 cols 5346 entries
Finished phase 1 with 910 SingleSign rule and 345 generalized
[2026-05-22 18:03:10] [INFO ] Computed 149 invariants in 10 ms
Computed 149 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-14781466096444652728.kers
Total runtime 12 ms.
[2026-05-22 18:03:11] [INFO ] Implicit Places using invariants in 875 ms returned []
[2026-05-22 18:03:11] [INFO ] Invariant cache hit.
[2026-05-22 18:03:16] [INFO ] Implicit Places using invariants and state equation in 4919 ms returned []
Implicit Place search using SMT with State Equation took 5821 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1404/1454 places, 1724/1903 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9049 ms. Remains : 1404/1454 places, 1724/1903 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(F((p0&&X(X(p0)))))||(F((p0&&X(X(p0))))&&X(p1)))))'
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-03
Stuttering criterion allowed to conclude after 354 steps with 1 reset in 3 ms.
FORMULA ASLink-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLFireability-03 finished in 9318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1&&X((p1 U X(p1)))))))'
Support contains 3 out of 1454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1443 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1443 transition count 1874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1443 transition count 1872
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1439 transition count 1868
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1439 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 1438 transition count 1860
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 1438 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 1437 transition count 1859
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 1437 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1436 transition count 1851
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1436 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 1435 transition count 1843
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 1435 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 1434 transition count 1842
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 1434 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 1433 transition count 1834
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 1433 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 1432 transition count 1826
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 1432 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1431 transition count 1825
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1431 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1430 transition count 1817
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1430 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1429 transition count 1809
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1429 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1428 transition count 1808
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1428 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1427 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1427 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1426 transition count 1792
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1426 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1425 transition count 1791
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1425 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1424 transition count 1783
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1424 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1423 transition count 1775
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1423 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1422 transition count 1774
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1422 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1421 transition count 1766
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1421 transition count 1766
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1420 transition count 1758
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1420 transition count 1758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 1419 transition count 1757
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 1419 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 1418 transition count 1749
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 1418 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 1417 transition count 1741
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 1417 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1416 transition count 1740
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1416 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 1415 transition count 1732
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 1415 transition count 1732
Applied a total of 80 rules in 1858 ms. Remains 1415 /1454 variables (removed 39) and now considering 1732/1903 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7010537017803900632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15539155591556660195.kers'
[2026-05-22 18:03:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7010537017803900632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15539155591556660195.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1732 rows 1415 cols 5377 entries
Finished phase 1 with 911 SingleSign rule and 353 generalized
[2026-05-22 18:03:18] [INFO ] Computed 151 invariants in 30 ms
Computed 151 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-15539155591556660195.kers
Total runtime 33 ms.
[2026-05-22 18:03:19] [INFO ] Implicit Places using invariants in 947 ms returned [1312, 1325]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 950 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1413/1454 places, 1732/1903 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1410 transition count 1729
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1410 transition count 1729
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1407 transition count 1726
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1407 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1404 transition count 1723
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1404 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1403 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1403 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1402 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1401 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1401 transition count 1720
Applied a total of 24 rules in 451 ms. Remains 1401 /1413 variables (removed 12) and now considering 1720/1732 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2103692706269685959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11804422102242852456.kers'
[2026-05-22 18:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2103692706269685959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11804422102242852456.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1720 rows 1401 cols 5338 entries
Finished phase 1 with 906 SingleSign rule and 346 generalized
[2026-05-22 18:03:19] [INFO ] Computed 149 invariants in 10 ms
Computed 149 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-11804422102242852456.kers
Total runtime 12 ms.
[2026-05-22 18:03:20] [INFO ] Implicit Places using invariants in 839 ms returned []
[2026-05-22 18:03:20] [INFO ] Invariant cache hit.
[2026-05-22 18:03:23] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 3624 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1401/1454 places, 1720/1903 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6883 ms. Remains : 1401/1454 places, 1720/1903 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1&&X((p1 U X(p1)))))))'
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-06
Product exploration explored 100000 steps with 39898 reset in 421 ms.
Product exploration explored 100000 steps with 40018 reset in 377 ms.
Computed a total of 56 stabilizing places and 56 stable transitions
Computed a total of 56 stabilizing places and 56 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 43 ms. Proved property starting from automaton with 7 states, 11 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 63 ms.
FORMULA ASLink-PT-03b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-03b-LTLFireability-06 finished in 8139 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 1454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 1453 transition count 1645
Reduce places removed 257 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 263 rules applied. Total rules applied 520 place count 1196 transition count 1639
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 523 place count 1193 transition count 1639
Performed 388 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 388 Pre rules applied. Total rules applied 523 place count 1193 transition count 1251
Deduced a syphon composed of 388 places in 1 ms
Ensure Unique test removed 34 places
Reduce places removed 422 places and 0 transitions.
Iterating global reduction 3 with 810 rules applied. Total rules applied 1333 place count 771 transition count 1251
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1358 place count 768 transition count 1229
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1380 place count 746 transition count 1229
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1380 place count 746 transition count 1216
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1419 place count 720 transition count 1216
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1419 place count 720 transition count 1204
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1443 place count 708 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1449 place count 702 transition count 1185
Iterating global reduction 5 with 6 rules applied. Total rules applied 1455 place count 702 transition count 1185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1455 place count 702 transition count 1182
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1461 place count 699 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1462 place count 698 transition count 1174
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 698 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1464 place count 697 transition count 1166
Iterating global reduction 5 with 1 rules applied. Total rules applied 1465 place count 697 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1466 place count 696 transition count 1158
Iterating global reduction 5 with 1 rules applied. Total rules applied 1467 place count 696 transition count 1158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1468 place count 695 transition count 1150
Iterating global reduction 5 with 1 rules applied. Total rules applied 1469 place count 695 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1470 place count 694 transition count 1142
Iterating global reduction 5 with 1 rules applied. Total rules applied 1471 place count 694 transition count 1142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1472 place count 693 transition count 1134
Iterating global reduction 5 with 1 rules applied. Total rules applied 1473 place count 693 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1474 place count 692 transition count 1126
Iterating global reduction 5 with 1 rules applied. Total rules applied 1475 place count 692 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1476 place count 691 transition count 1118
Iterating global reduction 5 with 1 rules applied. Total rules applied 1477 place count 691 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1478 place count 690 transition count 1110
Iterating global reduction 5 with 1 rules applied. Total rules applied 1479 place count 690 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1480 place count 689 transition count 1102
Iterating global reduction 5 with 1 rules applied. Total rules applied 1481 place count 689 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1482 place count 688 transition count 1094
Iterating global reduction 5 with 1 rules applied. Total rules applied 1483 place count 688 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1484 place count 687 transition count 1086
Iterating global reduction 5 with 1 rules applied. Total rules applied 1485 place count 687 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1486 place count 686 transition count 1078
Iterating global reduction 5 with 1 rules applied. Total rules applied 1487 place count 686 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1488 place count 685 transition count 1070
Iterating global reduction 5 with 1 rules applied. Total rules applied 1489 place count 685 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1490 place count 684 transition count 1062
Iterating global reduction 5 with 1 rules applied. Total rules applied 1491 place count 684 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1492 place count 683 transition count 1054
Iterating global reduction 5 with 1 rules applied. Total rules applied 1493 place count 683 transition count 1054
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 5 with 223 rules applied. Total rules applied 1716 place count 571 transition count 943
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1720 place count 567 transition count 939
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1725 place count 566 transition count 939
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1725 place count 566 transition count 938
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1727 place count 565 transition count 938
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1729 place count 563 transition count 936
Iterating global reduction 5 with 2 rules applied. Total rules applied 1731 place count 563 transition count 936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1733 place count 563 transition count 934
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1734 place count 562 transition count 934
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1736 place count 561 transition count 940
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1738 place count 559 transition count 938
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 1747 place count 553 transition count 935
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1750 place count 550 transition count 935
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 1750 place count 550 transition count 926
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1769 place count 540 transition count 926
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 9 with 6 rules applied. Total rules applied 1775 place count 534 transition count 926
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1775 place count 534 transition count 925
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1777 place count 533 transition count 925
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1795 place count 524 transition count 916
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1800 place count 519 transition count 911
Iterating global reduction 10 with 5 rules applied. Total rules applied 1805 place count 519 transition count 911
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1808 place count 516 transition count 908
Iterating global reduction 10 with 3 rules applied. Total rules applied 1811 place count 516 transition count 908
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1814 place count 516 transition count 905
Applied a total of 1814 rules in 690 ms. Remains 516 /1454 variables (removed 938) and now considering 905/1903 (removed 998) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1205064952744103039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14547085670766159547.kers'
[2026-05-22 18:03:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1205064952744103039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14547085670766159547.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 905 rows 507 cols 3535 entries
Finished phase 1 with 97 SingleSign rule and 333 generalized
[2026-05-22 18:03:25] [INFO ] Computed 86 invariants in 6 ms
Computed 86 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14547085670766159547.kers
Total runtime 17 ms.
[2026-05-22 18:03:25] [INFO ] Implicit Places using invariants in 452 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 291, 309, 328, 379, 384, 385, 388, 399, 400, 424, 443, 446, 464, 472]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 463 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 484/1454 places, 905/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 484 transition count 856
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 435 transition count 856
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 98 place count 435 transition count 841
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 128 place count 420 transition count 841
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 418 transition count 839
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 418 transition count 839
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 180 place count 394 transition count 815
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 182 place count 392 transition count 812
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 392 transition count 812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 391 transition count 810
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 391 transition count 810
Applied a total of 186 rules in 69 ms. Remains 391 /484 variables (removed 93) and now considering 810/905 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8460897637605862540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4090939869656613259.kers'
[2026-05-22 18:03:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8460897637605862540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4090939869656613259.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 810 rows 390 cols 3228 entries
Finished phase 1 with 95 SingleSign rule and 242 generalized
[2026-05-22 18:03:25] [INFO ] Computed 54 invariants in 16 ms
Computed 54 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-4090939869656613259.kers
Total runtime 18 ms.
[2026-05-22 18:03:27] [INFO ] Implicit Places using invariants in 1331 ms returned [88, 94, 99, 174, 180, 185, 271, 277, 282]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1333 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 382/1454 places, 810/1903 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 376 transition count 804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 376 transition count 804
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 370 transition count 798
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 370 transition count 798
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 367 transition count 795
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 367 transition count 795
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 364 transition count 792
Applied a total of 36 rules in 55 ms. Remains 364 /382 variables (removed 18) and now considering 792/810 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1358017554888585727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10675166433130614940.kers'
[2026-05-22 18:03:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1358017554888585727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10675166433130614940.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 792 rows 363 cols 3162 entries
Finished phase 1 with 90 SingleSign rule and 229 generalized
[2026-05-22 18:03:27] [INFO ] Computed 45 invariants in 11 ms
Computed 45 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10675166433130614940.kers
Total runtime 12 ms.
[2026-05-22 18:03:27] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-22 18:03:27] [INFO ] Invariant cache hit.
[2026-05-22 18:03:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 18:03:28] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 364/1454 places, 792/1903 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4168 ms. Remains : 364/1454 places, 792/1903 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 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-11
Product exploration explored 100000 steps with 15413 reset in 265 ms.
Product exploration explored 100000 steps with 15464 reset in 298 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/364 stabilizing places and 2/792 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (577 resets) in 192 ms. (207 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (183 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (139 resets) in 46 ms. (851 steps per ms) remains 1/2 properties
[2026-05-22 18:03:29] [INFO ] Invariant cache hit.
[2026-05-22 18:03:29] [INFO ] State equation strengthened by 6 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/1156 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/32 constraints, State Equation: 0/364 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
[2026-05-22 18:03:29] [INFO ] Invariant cache hit.
[2026-05-22 18:03:30] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2026-05-22 18:03:30] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 104 ms returned sat
[2026-05-22 18:03:33] [INFO ] [Real]Absence check using state equation in 3380 ms returned sat
[2026-05-22 18:03:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:03:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2026-05-22 18:03:34] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 46 ms returned sat
[2026-05-22 18:03:35] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2026-05-22 18:03:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 18:03:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 58 ms returned sat
[2026-05-22 18:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2026-05-22 18:03:36] [INFO ] Computed and/alt/rep : 219/1089/219 causal constraints (skipped 545 transitions) in 47 ms.
[2026-05-22 18:03:37] [INFO ] Added : 99 causal constraints over 20 iterations in 1710 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 8385 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 out of 364 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 792/792 transitions.
Applied a total of 0 rules in 10 ms. Remains 364 /364 variables (removed 0) and now considering 792/792 (removed 0) transitions.
[2026-05-22 18:03:37] [INFO ] Invariant cache hit.
[2026-05-22 18:03:38] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-22 18:03:38] [INFO ] Invariant cache hit.
[2026-05-22 18:03:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 18:03:39] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2026-05-22 18:03:39] [INFO ] Redundant transitions in 8 ms returned []
Running 764 sub problems to find dead transitions.
[2026-05-22 18:03:39] [INFO ] Invariant cache hit.
[2026-05-22 18:03:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Problem TDEAD438 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 3/33 constraints. Problems are: Problem set: 4 solved, 760 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 760 unsolved
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 4 solved, 760 unsolved
Search for dead transitions found 4 dead transitions in 30229ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/364 places, 788/792 transitions.
Applied a total of 0 rules in 17 ms. Remains 364 /364 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2026-05-22 18:04:09] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 31806 ms. Remains : 364/364 places, 788/792 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/364 stabilizing places and 2/788 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9347735483339590068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9991562465595996165.kers'
[2026-05-22 18:04:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9347735483339590068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9991562465595996165.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 788 rows 363 cols 3146 entries
Finished phase 1 with 89 SingleSign rule and 230 generalized
[2026-05-22 18:04:09] [INFO ] Computed 45 invariants in 4 ms
Computed 45 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9991562465595996165.kers
Total runtime 6 ms.
[2026-05-22 18:04:10] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2026-05-22 18:04:10] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 140 ms returned sat
[2026-05-22 18:04:12] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2026-05-22 18:04:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:04:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-22 18:04:13] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 97 ms returned sat
[2026-05-22 18:04:14] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2026-05-22 18:04:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 18:04:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 13 ms returned sat
[2026-05-22 18:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2026-05-22 18:04:14] [INFO ] Computed and/alt/rep : 218/1103/218 causal constraints (skipped 542 transitions) in 47 ms.
[2026-05-22 18:04:16] [INFO ] Added : 102 causal constraints over 21 iterations in 1655 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 6703 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15363 reset in 316 ms.
Product exploration explored 100000 steps with 15411 reset in 313 ms.
Built C files in :
/tmp/ltsmin14211612578029676141
[2026-05-22 18:04:17] [INFO ] Computing symmetric may disable matrix : 788 transitions.
[2026-05-22 18:04:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:04:17] [INFO ] Computing symmetric may enable matrix : 788 transitions.
[2026-05-22 18:04:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:04:17] [INFO ] Computing Do-Not-Accords matrix : 788 transitions.
[2026-05-22 18:04:17] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:04:17] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14211612578029676141
Running compilation step : cd /tmp/ltsmin14211612578029676141;'/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 2469 ms.
Running link step : cd /tmp/ltsmin14211612578029676141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 101 ms.
Running LTSmin : cd /tmp/ltsmin14211612578029676141;'/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/stateBased6901880192340292833.hoa' '--buchi-type=spotba'
LTSmin run took 6106 ms.
FORMULA ASLink-PT-03b-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03b-LTLFireability-11 finished in 61384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 2 out of 1454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1443 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1443 transition count 1874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1443 transition count 1872
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1439 transition count 1868
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1439 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 1438 transition count 1860
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 1438 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 1437 transition count 1859
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 1437 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1436 transition count 1851
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1436 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 1435 transition count 1843
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 1435 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 1434 transition count 1842
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 1434 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 1433 transition count 1834
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 1433 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 1432 transition count 1826
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 1432 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1431 transition count 1825
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1431 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1430 transition count 1817
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1430 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1429 transition count 1809
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1429 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1428 transition count 1808
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1428 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1427 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1427 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1426 transition count 1792
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1426 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1425 transition count 1791
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1425 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1424 transition count 1783
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1424 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1423 transition count 1775
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1423 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1422 transition count 1774
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1422 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1421 transition count 1766
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1421 transition count 1766
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1420 transition count 1758
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1420 transition count 1758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 1419 transition count 1757
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 1419 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 1418 transition count 1749
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 1418 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 1417 transition count 1741
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 1417 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1416 transition count 1740
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1416 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 1415 transition count 1732
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 1415 transition count 1732
Applied a total of 80 rules in 1690 ms. Remains 1415 /1454 variables (removed 39) and now considering 1732/1903 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4608008044478632088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11406683545373210689.kers'
[2026-05-22 18:04:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4608008044478632088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11406683545373210689.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1732 rows 1415 cols 5377 entries
Finished phase 1 with 911 SingleSign rule and 353 generalized
[2026-05-22 18:04:27] [INFO ] Computed 151 invariants in 13 ms
Computed 151 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11406683545373210689.kers
Total runtime 17 ms.
[2026-05-22 18:04:28] [INFO ] Implicit Places using invariants in 978 ms returned [1312, 1325]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1413/1454 places, 1732/1903 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1410 transition count 1729
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1410 transition count 1729
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1407 transition count 1726
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1407 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1404 transition count 1723
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1404 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1403 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1403 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1402 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1401 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1401 transition count 1720
Applied a total of 24 rules in 418 ms. Remains 1401 /1413 variables (removed 12) and now considering 1720/1732 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3240608481420324658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10533194041089545450.kers'
[2026-05-22 18:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3240608481420324658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10533194041089545450.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1720 rows 1401 cols 5338 entries
Finished phase 1 with 906 SingleSign rule and 346 generalized
[2026-05-22 18:04:29] [INFO ] Computed 149 invariants in 11 ms
Computed 149 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10533194041089545450.kers
Total runtime 12 ms.
[2026-05-22 18:04:29] [INFO ] Implicit Places using invariants in 867 ms returned []
[2026-05-22 18:04:29] [INFO ] Invariant cache hit.
[2026-05-22 18:04:32] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 3762 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1401/1454 places, 1720/1903 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6879 ms. Remains : 1401/1454 places, 1720/1903 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-12
Stuttering criterion allowed to conclude after 337 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLFireability-12 finished in 7065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(p1))))))'
Support contains 4 out of 1454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1443 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1443 transition count 1874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1443 transition count 1872
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 1439 transition count 1868
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 1439 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 1438 transition count 1860
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 1438 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 1437 transition count 1859
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 1437 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1436 transition count 1851
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1436 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 1435 transition count 1843
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 1435 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 1434 transition count 1842
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 1434 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 1433 transition count 1834
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 1433 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 1432 transition count 1826
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 1432 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1431 transition count 1825
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1431 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1430 transition count 1817
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1430 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1429 transition count 1809
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1429 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1428 transition count 1808
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1428 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1427 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1427 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 1426 transition count 1792
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1426 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1425 transition count 1791
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1425 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1424 transition count 1783
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1424 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1423 transition count 1775
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1423 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1422 transition count 1774
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1422 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1421 transition count 1766
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1421 transition count 1766
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1420 transition count 1758
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1420 transition count 1758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 1419 transition count 1757
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 1419 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 1418 transition count 1749
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 1418 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 1417 transition count 1741
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 1417 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1416 transition count 1740
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1416 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 1415 transition count 1732
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 1415 transition count 1732
Applied a total of 80 rules in 1679 ms. Remains 1415 /1454 variables (removed 39) and now considering 1732/1903 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2849434846330024237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9857509566675025865.kers'
[2026-05-22 18:04:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2849434846330024237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9857509566675025865.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1732 rows 1415 cols 5377 entries
Finished phase 1 with 911 SingleSign rule and 353 generalized
[2026-05-22 18:04:34] [INFO ] Computed 151 invariants in 11 ms
Computed 151 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9857509566675025865.kers
Total runtime 13 ms.
[2026-05-22 18:04:35] [INFO ] Implicit Places using invariants in 986 ms returned [1312, 1325]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1413/1454 places, 1732/1903 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1410 transition count 1729
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1410 transition count 1729
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1407 transition count 1726
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1407 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1404 transition count 1723
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1404 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1403 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1403 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1402 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1401 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1401 transition count 1720
Applied a total of 24 rules in 419 ms. Remains 1401 /1413 variables (removed 12) and now considering 1720/1732 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1588028623787999238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10871164183056666050.kers'
[2026-05-22 18:04:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1588028623787999238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10871164183056666050.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1720 rows 1401 cols 5338 entries
Finished phase 1 with 906 SingleSign rule and 346 generalized
[2026-05-22 18:04:36] [INFO ] Computed 149 invariants in 12 ms
Computed 149 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-10871164183056666050.kers
Total runtime 14 ms.
[2026-05-22 18:04:37] [INFO ] Implicit Places using invariants in 905 ms returned []
[2026-05-22 18:04:37] [INFO ] Invariant cache hit.
[2026-05-22 18:04:40] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 4052 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1401/1454 places, 1720/1903 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7159 ms. Remains : 1401/1454 places, 1720/1903 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&p1)))))'
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 336 ms.
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Computed a total of 56 stabilizing places and 56 stable transitions
Computed a total of 56 stabilizing places and 56 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 20 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 45 ms.
FORMULA ASLink-PT-03b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-03b-LTLFireability-13 finished in 8010 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&&(G(F(p0)) U p1)))))'
Support contains 2 out of 1454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 1453 transition count 1645
Reduce places removed 257 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 263 rules applied. Total rules applied 520 place count 1196 transition count 1639
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 523 place count 1193 transition count 1639
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 389 Pre rules applied. Total rules applied 523 place count 1193 transition count 1250
Deduced a syphon composed of 389 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 423 places and 0 transitions.
Iterating global reduction 3 with 812 rules applied. Total rules applied 1335 place count 770 transition count 1250
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1360 place count 767 transition count 1228
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1382 place count 745 transition count 1228
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1382 place count 745 transition count 1215
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1421 place count 719 transition count 1215
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1421 place count 719 transition count 1203
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1445 place count 707 transition count 1203
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1450 place count 702 transition count 1180
Iterating global reduction 5 with 5 rules applied. Total rules applied 1455 place count 702 transition count 1180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1455 place count 702 transition count 1178
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1459 place count 700 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1460 place count 699 transition count 1170
Iterating global reduction 5 with 1 rules applied. Total rules applied 1461 place count 699 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1462 place count 698 transition count 1162
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 698 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1464 place count 697 transition count 1154
Iterating global reduction 5 with 1 rules applied. Total rules applied 1465 place count 697 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1466 place count 696 transition count 1146
Iterating global reduction 5 with 1 rules applied. Total rules applied 1467 place count 696 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1468 place count 695 transition count 1138
Iterating global reduction 5 with 1 rules applied. Total rules applied 1469 place count 695 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1470 place count 694 transition count 1130
Iterating global reduction 5 with 1 rules applied. Total rules applied 1471 place count 694 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1472 place count 693 transition count 1122
Iterating global reduction 5 with 1 rules applied. Total rules applied 1473 place count 693 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1474 place count 692 transition count 1114
Iterating global reduction 5 with 1 rules applied. Total rules applied 1475 place count 692 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1476 place count 691 transition count 1106
Iterating global reduction 5 with 1 rules applied. Total rules applied 1477 place count 691 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1478 place count 690 transition count 1098
Iterating global reduction 5 with 1 rules applied. Total rules applied 1479 place count 690 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1480 place count 689 transition count 1090
Iterating global reduction 5 with 1 rules applied. Total rules applied 1481 place count 689 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1482 place count 688 transition count 1082
Iterating global reduction 5 with 1 rules applied. Total rules applied 1483 place count 688 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1484 place count 687 transition count 1074
Iterating global reduction 5 with 1 rules applied. Total rules applied 1485 place count 687 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1486 place count 686 transition count 1066
Iterating global reduction 5 with 1 rules applied. Total rules applied 1487 place count 686 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1488 place count 685 transition count 1058
Iterating global reduction 5 with 1 rules applied. Total rules applied 1489 place count 685 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1490 place count 684 transition count 1050
Iterating global reduction 5 with 1 rules applied. Total rules applied 1491 place count 684 transition count 1050
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 5 with 229 rules applied. Total rules applied 1720 place count 569 transition count 936
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1724 place count 565 transition count 932
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1729 place count 564 transition count 932
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1729 place count 564 transition count 931
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1731 place count 563 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1733 place count 561 transition count 929
Iterating global reduction 5 with 2 rules applied. Total rules applied 1735 place count 561 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1737 place count 561 transition count 927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1738 place count 560 transition count 927
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1740 place count 559 transition count 933
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1742 place count 557 transition count 931
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 1751 place count 551 transition count 928
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1754 place count 548 transition count 928
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 1754 place count 548 transition count 919
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1773 place count 538 transition count 919
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 9 with 7 rules applied. Total rules applied 1780 place count 531 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1780 place count 531 transition count 918
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1782 place count 530 transition count 918
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1802 place count 520 transition count 908
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1808 place count 514 transition count 902
Iterating global reduction 10 with 6 rules applied. Total rules applied 1814 place count 514 transition count 902
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1817 place count 511 transition count 899
Iterating global reduction 10 with 3 rules applied. Total rules applied 1820 place count 511 transition count 899
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1823 place count 511 transition count 896
Applied a total of 1823 rules in 496 ms. Remains 511 /1454 variables (removed 943) and now considering 896/1903 (removed 1007) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14106218664745039811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11422254284713874636.kers'
[2026-05-22 18:04:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14106218664745039811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11422254284713874636.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 896 rows 501 cols 3496 entries
Finished phase 1 with 97 SingleSign rule and 329 generalized
[2026-05-22 18:04:41] [INFO ] Computed 85 invariants in 9 ms
Computed 85 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-11422254284713874636.kers
Total runtime 18 ms.
[2026-05-22 18:04:42] [INFO ] Implicit Places using invariants in 532 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 271, 275, 292, 310, 329, 381, 382, 385, 396, 397, 398, 416, 420, 438, 439, 440, 441, 459, 467]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 551 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 476/1454 places, 896/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 476 transition count 834
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 414 transition count 834
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 124 place count 414 transition count 819
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 155 place count 398 transition count 819
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 167 place count 394 transition count 811
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 386 transition count 811
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 181 place count 380 transition count 805
Iterating global reduction 4 with 6 rules applied. Total rules applied 187 place count 380 transition count 805
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 190 place count 380 transition count 802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 379 transition count 800
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 379 transition count 800
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 246 place count 352 transition count 773
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 350 transition count 774
Applied a total of 250 rules in 44 ms. Remains 350 /476 variables (removed 126) and now considering 774/896 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11896408490150507742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10356739163653239833.kers'
[2026-05-22 18:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11896408490150507742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10356739163653239833.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 774 rows 350 cols 3102 entries
Finished phase 1 with 100 SingleSign rule and 205 generalized
[2026-05-22 18:04:42] [INFO ] Computed 45 invariants in 5 ms
Computed 45 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10356739163653239833.kers
Total runtime 6 ms.
[2026-05-22 18:04:42] [INFO ] Implicit Places using invariants in 363 ms returned [88, 94, 99, 271, 277, 282, 347]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 380 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 343/1454 places, 774/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 343 transition count 773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 342 transition count 773
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 338 transition count 769
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 338 transition count 769
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 334 transition count 765
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 334 transition count 765
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 332 transition count 763
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 332 transition count 763
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 330 transition count 761
Applied a total of 26 rules in 60 ms. Remains 330 /343 variables (removed 13) and now considering 761/774 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3583763090310950788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8168209638501126716.kers'
[2026-05-22 18:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3583763090310950788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8168209638501126716.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 761 rows 330 cols 3053 entries
Finished phase 1 with 96 SingleSign rule and 196 generalized
[2026-05-22 18:04:42] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8168209638501126716.kers
Total runtime 12 ms.
[2026-05-22 18:04:42] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-22 18:04:42] [INFO ] Invariant cache hit.
[2026-05-22 18:04:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 18:04:43] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 330/1454 places, 761/1903 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2654 ms. Remains : 330/1454 places, 761/1903 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&&(G(F(p0)) U p1)))))'
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-14
Stuttering criterion allowed to conclude after 75 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLFireability-14 finished in 2849 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||F((p1||X(X(X(p2)))))))))'
Support contains 3 out of 1454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1454/1454 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 1453 transition count 1645
Reduce places removed 257 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 263 rules applied. Total rules applied 520 place count 1196 transition count 1639
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 524 place count 1193 transition count 1638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 1192 transition count 1638
Performed 388 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 388 Pre rules applied. Total rules applied 525 place count 1192 transition count 1250
Deduced a syphon composed of 388 places in 2 ms
Ensure Unique test removed 33 places
Reduce places removed 421 places and 0 transitions.
Iterating global reduction 4 with 809 rules applied. Total rules applied 1334 place count 771 transition count 1250
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 24 rules applied. Total rules applied 1358 place count 767 transition count 1230
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 21 rules applied. Total rules applied 1379 place count 747 transition count 1229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1380 place count 746 transition count 1229
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1380 place count 746 transition count 1216
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 39 rules applied. Total rules applied 1419 place count 720 transition count 1216
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1419 place count 720 transition count 1204
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1443 place count 708 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1449 place count 702 transition count 1180
Iterating global reduction 7 with 6 rules applied. Total rules applied 1455 place count 702 transition count 1180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1455 place count 702 transition count 1178
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1459 place count 700 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1460 place count 699 transition count 1170
Iterating global reduction 7 with 1 rules applied. Total rules applied 1461 place count 699 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1462 place count 698 transition count 1162
Iterating global reduction 7 with 1 rules applied. Total rules applied 1463 place count 698 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1464 place count 697 transition count 1154
Iterating global reduction 7 with 1 rules applied. Total rules applied 1465 place count 697 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1466 place count 696 transition count 1146
Iterating global reduction 7 with 1 rules applied. Total rules applied 1467 place count 696 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1468 place count 695 transition count 1138
Iterating global reduction 7 with 1 rules applied. Total rules applied 1469 place count 695 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1470 place count 694 transition count 1130
Iterating global reduction 7 with 1 rules applied. Total rules applied 1471 place count 694 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1472 place count 693 transition count 1122
Iterating global reduction 7 with 1 rules applied. Total rules applied 1473 place count 693 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1474 place count 692 transition count 1114
Iterating global reduction 7 with 1 rules applied. Total rules applied 1475 place count 692 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1476 place count 691 transition count 1106
Iterating global reduction 7 with 1 rules applied. Total rules applied 1477 place count 691 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1478 place count 690 transition count 1098
Iterating global reduction 7 with 1 rules applied. Total rules applied 1479 place count 690 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1480 place count 689 transition count 1090
Iterating global reduction 7 with 1 rules applied. Total rules applied 1481 place count 689 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1482 place count 688 transition count 1082
Iterating global reduction 7 with 1 rules applied. Total rules applied 1483 place count 688 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1484 place count 687 transition count 1074
Iterating global reduction 7 with 1 rules applied. Total rules applied 1485 place count 687 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1486 place count 686 transition count 1066
Iterating global reduction 7 with 1 rules applied. Total rules applied 1487 place count 686 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1488 place count 685 transition count 1058
Iterating global reduction 7 with 1 rules applied. Total rules applied 1489 place count 685 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1490 place count 684 transition count 1050
Iterating global reduction 7 with 1 rules applied. Total rules applied 1491 place count 684 transition count 1050
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 7 with 227 rules applied. Total rules applied 1718 place count 570 transition count 937
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1722 place count 566 transition count 933
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 1727 place count 565 transition count 933
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1727 place count 565 transition count 932
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1729 place count 564 transition count 932
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1731 place count 562 transition count 930
Iterating global reduction 7 with 2 rules applied. Total rules applied 1733 place count 562 transition count 930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1735 place count 562 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1736 place count 561 transition count 928
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1738 place count 560 transition count 934
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1740 place count 558 transition count 932
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 1745 place count 554 transition count 931
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1746 place count 553 transition count 931
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1746 place count 553 transition count 925
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1759 place count 546 transition count 925
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1764 place count 541 transition count 925
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1764 place count 541 transition count 924
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1766 place count 540 transition count 924
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 1782 place count 532 transition count 916
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1786 place count 528 transition count 912
Iterating global reduction 12 with 4 rules applied. Total rules applied 1790 place count 528 transition count 912
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1792 place count 526 transition count 910
Iterating global reduction 12 with 2 rules applied. Total rules applied 1794 place count 526 transition count 910
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1796 place count 526 transition count 908
Applied a total of 1796 rules in 535 ms. Remains 526 /1454 variables (removed 928) and now considering 908/1903 (removed 995) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7236816316150382137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13855524965726863537.kers'
[2026-05-22 18:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7236816316150382137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13855524965726863537.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 908 rows 516 cols 3528 entries
Finished phase 1 with 139 SingleSign rule and 298 generalized
[2026-05-22 18:04:44] [INFO ] Computed 89 invariants in 6 ms
Computed 89 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13855524965726863537.kers
Total runtime 7 ms.
[2026-05-22 18:04:44] [INFO ] Implicit Places using invariants in 466 ms returned [1, 18, 19, 31, 48, 66, 86, 138, 148, 149, 151, 168, 186, 263, 280, 281, 283, 300, 318, 338, 394, 395, 398, 409, 411, 412, 413, 431, 435, 453, 454, 455, 456, 474, 482]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 490 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 491/1454 places, 908/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 491 transition count 845
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 428 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 427 transition count 844
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 128 place count 427 transition count 824
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 169 place count 406 transition count 824
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 13 rules applied. Total rules applied 182 place count 401 transition count 816
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 190 place count 393 transition count 816
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 196 place count 387 transition count 810
Iterating global reduction 5 with 6 rules applied. Total rules applied 202 place count 387 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 205 place count 387 transition count 807
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 206 place count 386 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 207 place count 386 transition count 805
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 263 place count 358 transition count 777
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 267 place count 356 transition count 778
Applied a total of 267 rules in 69 ms. Remains 356 /491 variables (removed 135) and now considering 778/908 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11952469937530306229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15830077792430099401.kers'
[2026-05-22 18:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11952469937530306229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15830077792430099401.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 778 rows 356 cols 3125 entries
Finished phase 1 with 106 SingleSign rule and 202 generalized
[2026-05-22 18:04:44] [INFO ] Computed 48 invariants in 5 ms
Computed 48 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15830077792430099401.kers
Total runtime 5 ms.
[2026-05-22 18:04:45] [INFO ] Implicit Places using invariants in 241 ms returned [88, 94, 100, 178, 184, 189, 276, 282, 287, 353]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 242 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1454 places, 778/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 346 transition count 777
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 345 transition count 777
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 339 transition count 771
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 339 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 333 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 333 transition count 765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 330 transition count 762
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 330 transition count 762
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 327 transition count 759
Applied a total of 38 rules in 51 ms. Remains 327 /346 variables (removed 19) and now considering 759/778 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5561131506230837675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18103048145821014011.kers'
[2026-05-22 18:04:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5561131506230837675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18103048145821014011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 759 rows 327 cols 3054 entries
Finished phase 1 with 97 SingleSign rule and 192 generalized
[2026-05-22 18:04:45] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18103048145821014011.kers
Total runtime 5 ms.
[2026-05-22 18:04:45] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-22 18:04:45] [INFO ] Invariant cache hit.
[2026-05-22 18:04:46] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 327/1454 places, 759/1903 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2455 ms. Remains : 327/1454 places, 759/1903 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||F((p1||X(X(X(p2)))))))))'
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-03b-LTLFireability-15
Product exploration explored 100000 steps with 3302 reset in 299 ms.
Product exploration explored 100000 steps with 3246 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 24286 steps (433 resets) in 211 ms. (114 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 324 ms.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 759/759 transitions.
Applied a total of 0 rules in 17 ms. Remains 327 /327 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2026-05-22 18:04:47] [INFO ] Invariant cache hit.
[2026-05-22 18:04:47] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-22 18:04:47] [INFO ] Invariant cache hit.
[2026-05-22 18:04:48] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2026-05-22 18:04:48] [INFO ] Redundant transitions in 8 ms returned []
Running 732 sub problems to find dead transitions.
[2026-05-22 18:04:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/1086 variables, and 34 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (OVERLAPS) 2/327 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/1086 variables, and 38 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 0/732 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61133 ms. Remains : 327/327 places, 759/759 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 30583 steps (560 resets) in 164 ms. (185 steps per ms) remains 0/5 properties
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 426 ms.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3223 reset in 227 ms.
Product exploration explored 100000 steps with 3283 reset in 236 ms.
Built C files in :
/tmp/ltsmin12296313553902471944
[2026-05-22 18:05:49] [INFO ] Computing symmetric may disable matrix : 759 transitions.
[2026-05-22 18:05:49] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:05:49] [INFO ] Computing symmetric may enable matrix : 759 transitions.
[2026-05-22 18:05:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:05:49] [INFO ] Computing Do-Not-Accords matrix : 759 transitions.
[2026-05-22 18:05:49] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:05:49] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12296313553902471944
Running compilation step : cd /tmp/ltsmin12296313553902471944;'/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 2048 ms.
Running link step : cd /tmp/ltsmin12296313553902471944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin12296313553902471944;'/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/stateBased17621846071692427817.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 759/759 transitions.
Applied a total of 0 rules in 22 ms. Remains 327 /327 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2026-05-22 18:06:04] [INFO ] Invariant cache hit.
[2026-05-22 18:06:05] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-22 18:06:05] [INFO ] Invariant cache hit.
[2026-05-22 18:06:05] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2026-05-22 18:06:05] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1057 ms. Remains : 327/327 places, 759/759 transitions.
Built C files in :
/tmp/ltsmin16657304034034945275
[2026-05-22 18:06:05] [INFO ] Computing symmetric may disable matrix : 759 transitions.
[2026-05-22 18:06:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:06:05] [INFO ] Computing symmetric may enable matrix : 759 transitions.
[2026-05-22 18:06:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:06:05] [INFO ] Computing Do-Not-Accords matrix : 759 transitions.
[2026-05-22 18:06:06] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:06:06] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16657304034034945275
Running compilation step : cd /tmp/ltsmin16657304034034945275;'/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 2012 ms.
Running link step : cd /tmp/ltsmin16657304034034945275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16657304034034945275;'/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/stateBased9536863204367641735.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 18:06:21] [INFO ] Flatten gal took : 30 ms
[2026-05-22 18:06:21] [INFO ] Flatten gal took : 38 ms
[2026-05-22 18:06:21] [INFO ] Time to serialize gal into /tmp/LTL12659700885636557959.gal : 9 ms
[2026-05-22 18:06:21] [INFO ] Time to serialize properties into /tmp/LTL10624415493129692088.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12659700885636557959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10960886611475293176.hoa' '-atoms' '/tmp/LTL10624415493129692088.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10624415493129692088.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10960886611475293176.hoa
Detected timeout of ITS tools.
[2026-05-22 18:06:36] [INFO ] Flatten gal took : 24 ms
[2026-05-22 18:06:36] [INFO ] Flatten gal took : 22 ms
[2026-05-22 18:06:36] [INFO ] Time to serialize gal into /tmp/LTL10506014328637555382.gal : 6 ms
[2026-05-22 18:06:36] [INFO ] Time to serialize properties into /tmp/LTL15316065687360111271.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10506014328637555382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15316065687360111271.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p361==1)")||(F(("(p852==0)")||(X(X(X("(p1237==1)"))))))))))
Formula 0 simplified : G(F!"(p361==1)" & FG(!"(p852==0)" & !"(p1237==1)"))
Detected timeout of ITS tools.
[2026-05-22 18:06:51] [INFO ] Flatten gal took : 37 ms
[2026-05-22 18:06:51] [INFO ] Applying decomposition
[2026-05-22 18:06:51] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17652120031483956207.txt' '-o' '/tmp/graph17652120031483956207.bin' '-w' '/tmp/graph17652120031483956207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17652120031483956207.bin' '-l' '-1' '-v' '-w' '/tmp/graph17652120031483956207.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:06:51] [INFO ] Decomposing Gal with order
[2026-05-22 18:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:06:51] [INFO ] Removed a total of 1503 redundant transitions.
[2026-05-22 18:06:51] [INFO ] Flatten gal took : 115 ms
[2026-05-22 18:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 25 ms.
[2026-05-22 18:06:51] [INFO ] Time to serialize gal into /tmp/LTL892190137772172969.gal : 7 ms
[2026-05-22 18:06:51] [INFO ] Time to serialize properties into /tmp/LTL11642578160479683610.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL892190137772172969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11642578160479683610.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i1.u23.p361==1)")||(F(("(i3.i1.u46.p852==0)")||(X(X(X("(i6.u69.p1237==1)"))))))))))
Formula 0 simplified : G(F!"(i1.u23.p361==1)" & FG(!"(i3.i1.u46.p852==0)" & !"(i6.u69.p1237==1)"))
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLFireability-15 finished in 142971 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||F((p1||X(X(X(p2)))))))))'
Spot run failed in 81 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 18:07:07] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18329159677552676137
[2026-05-22 18:07:07] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2026-05-22 18:07:07] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18329159677552676137
Running compilation step : cd /tmp/ltsmin18329159677552676137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 18:07:07] [INFO ] Applying decomposition
[2026-05-22 18:07:07] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5127342329127700737.txt' '-o' '/tmp/graph5127342329127700737.bin' '-w' '/tmp/graph5127342329127700737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5127342329127700737.bin' '-l' '-1' '-v' '-w' '/tmp/graph5127342329127700737.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:07:07] [INFO ] Decomposing Gal with order
[2026-05-22 18:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:07:07] [INFO ] Removed a total of 1594 redundant transitions.
[2026-05-22 18:07:07] [INFO ] Flatten gal took : 102 ms
[2026-05-22 18:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 71 ms.
[2026-05-22 18:07:07] [INFO ] Time to serialize gal into /tmp/LTLFireability12615855216008769928.gal : 17 ms
[2026-05-22 18:07:07] [INFO ] Time to serialize properties into /tmp/LTLFireability3972690797027380615.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12615855216008769928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3972690797027380615.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i6.u126.p361==1)")||(F(("(i13.i3.i1.u302.p852==0)")||(X(X(X("(i17.i0.i4.u436.p1237==1)"))))))))))
Formula 0 simplified : G(F!"(i6.u126.p361==1)" & FG(!"(i13.i3.i1.u302.p852==0)" & !"(i17.i0.i4.u436.p1237==1)"))
Compilation finished in 4284 ms.
Running link step : cd /tmp/ltsmin18329159677552676137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin18329159677552676137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X(X(X((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 18:29:32] [INFO ] Applying decomposition
[2026-05-22 18:29:32] [INFO ] Flatten gal took : 62 ms
[2026-05-22 18:29:33] [INFO ] Decomposing Gal with order
[2026-05-22 18:29:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:29:33] [INFO ] Removed a total of 1478 redundant transitions.
[2026-05-22 18:29:33] [INFO ] Flatten gal took : 211 ms
[2026-05-22 18:29:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1937 labels/synchronizations in 762 ms.
[2026-05-22 18:29:34] [INFO ] Time to serialize gal into /tmp/LTLFireability16581892776477090248.gal : 100 ms
[2026-05-22 18:29:34] [INFO ] Time to serialize properties into /tmp/LTLFireability8295901216039434912.ltl : 29 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16581892776477090248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8295901216039434912.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u39.p361==1)")||(F(("(i0.i0.i1.i0.u101.p852==0)")||(X(X(X("(i0.i1.i0.i0.u147.p1237==1)")))))))...158
Formula 0 simplified : G(F!"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u39.p361==1)" & FG(!"(i0.i0.i1.i0.u101.p852==0)" & !"(i0.i1.i0.i0.u147.p1237==1)"))
Detected timeout of ITS tools.
[2026-05-22 18:52:03] [INFO ] Flatten gal took : 1871 ms
[2026-05-22 18:52:06] [INFO ] Input system was already deterministic with 1903 transitions.
[2026-05-22 18:52:06] [INFO ] Transformed 1454 places.
[2026-05-22 18:52:07] [INFO ] Transformed 1903 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 18:52:37] [INFO ] Time to serialize gal into /tmp/LTLFireability3246402402873257849.gal : 52 ms
[2026-05-22 18:52:37] [INFO ] Time to serialize properties into /tmp/LTLFireability10622684045150177175.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3246402402873257849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10622684045150177175.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(p361==1)")||(F(("(p852==0)")||(X(X(X("(p1237==1)"))))))))))
Formula 0 simplified : G(F!"(p361==1)" & FG(!"(p852==0)" & !"(p1237==1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ASLink-PT-03b"
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 ASLink-PT-03b, 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 r002-oct2-177944366200324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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