Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 4.9K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 152K 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 CO4-PT-09-LTLFireability-00
FORMULA_NAME CO4-PT-09-LTLFireability-01
FORMULA_NAME CO4-PT-09-LTLFireability-02
FORMULA_NAME CO4-PT-09-LTLFireability-03
FORMULA_NAME CO4-PT-09-LTLFireability-04
FORMULA_NAME CO4-PT-09-LTLFireability-05
FORMULA_NAME CO4-PT-09-LTLFireability-06
FORMULA_NAME CO4-PT-09-LTLFireability-07
FORMULA_NAME CO4-PT-09-LTLFireability-08
FORMULA_NAME CO4-PT-09-LTLFireability-09
FORMULA_NAME CO4-PT-09-LTLFireability-10
FORMULA_NAME CO4-PT-09-LTLFireability-11
FORMULA_NAME CO4-PT-09-LTLFireability-12
FORMULA_NAME CO4-PT-09-LTLFireability-13
FORMULA_NAME CO4-PT-09-LTLFireability-14
FORMULA_NAME CO4-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779522138050

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 07:42:19] [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-23 07:42:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:42:19] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-23 07:42:19] [INFO ] Transformed 467 places.
[2026-05-23 07:42:19] [INFO ] Transformed 634 transitions.
[2026-05-23 07:42:19] [INFO ] Found NUPN structural information;
[2026-05-23 07:42:19] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 108 places in 7 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 95 place count 266 transition count 388
Iterating global reduction 1 with 80 rules applied. Total rules applied 175 place count 266 transition count 388
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 180 place count 266 transition count 383
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 222 place count 224 transition count 318
Iterating global reduction 2 with 42 rules applied. Total rules applied 264 place count 224 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 266 place count 224 transition count 316
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 271 place count 219 transition count 308
Iterating global reduction 3 with 5 rules applied. Total rules applied 276 place count 219 transition count 308
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 279 place count 216 transition count 305
Iterating global reduction 3 with 3 rules applied. Total rules applied 282 place count 216 transition count 305
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 284 place count 214 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 286 place count 214 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 214 transition count 301
Applied a total of 288 rules in 83 ms. Remains 214 /359 variables (removed 145) and now considering 301/471 (removed 170) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11063598320739386215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17707605657737460278.kers'
[2026-05-23 07:42:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11063598320739386215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17707605657737460278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 214 cols 836 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-23 07:42:19] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17707605657737460278.kers
Total runtime 2 ms.
[2026-05-23 07:42:19] [INFO ] Implicit Places using invariants in 268 ms returned [5, 141]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 300 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/359 places, 301/471 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 212/359 places, 301/471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17698491538755170042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8718520185089549696.kers'
[2026-05-23 07:42:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17698491538755170042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8718520185089549696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 212 cols 822 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-23 07:42:19] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8718520185089549696.kers
Total runtime 1 ms.
[2026-05-23 07:42:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 07:42:20] [INFO ] Invariant cache hit.
[2026-05-23 07:42:20] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-05-23 07:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/513 variables, 212/220 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 220 constraints, problems are : Problem set: 0 solved, 300 unsolved in 22820 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/513 variables, 212/220 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 300/520 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 520 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52962ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 52973ms
Finished structural reductions in LTL mode , in 1 iterations and 53231 ms. Remains : 212/212 places, 301/301 transitions.
Support contains 31 out of 212 places after structural reductions.
[2026-05-23 07:43:13] [INFO ] Flatten gal took : 40 ms
[2026-05-23 07:43:13] [INFO ] Flatten gal took : 17 ms
[2026-05-23 07:43:13] [INFO ] Input system was already deterministic with 301 transitions.
RANDOM walk for 40000 steps (437 resets) in 1652 ms. (24 steps per ms) remains 16/24 properties
BEST_FIRST walk for 4003 steps (31 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (33 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (31 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2026-05-23 07:43:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 8/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 120/163 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 205/368 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 120/488 variables, 71/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 20/508 variables, 14/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 5/513 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/513 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 216 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 8/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 120/163 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 205/368 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 120/488 variables, 71/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 20/508 variables, 14/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 5/513 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/513 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 231 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3926ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 98 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=98 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 533 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 463 edges and 212 vertex of which 209 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p1) U p2)))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 204 transition count 290
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 204 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 202 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 202 transition count 288
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 202 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 201 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 201 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 201 transition count 285
Applied a total of 24 rules in 14 ms. Remains 201 /212 variables (removed 11) and now considering 285/301 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16730857998133746697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4291576723440525095.kers'
[2026-05-23 07:43:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16730857998133746697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4291576723440525095.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 201 cols 790 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-23 07:43:18] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4291576723440525095.kers
Total runtime 1 ms.
[2026-05-23 07:43:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 07:43:18] [INFO ] Invariant cache hit.
[2026-05-23 07:43:19] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-23 07:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/486 variables, 201/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/486 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 208 constraints, problems are : Problem set: 0 solved, 284 unsolved in 18549 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/486 variables, 201/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 284/492 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 493 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48612ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 48615ms
Starting structural reductions in LTL mode, iteration 1 : 201/212 places, 285/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48832 ms. Remains : 201/212 places, 285/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p1) U p2)))'
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), true]
Running random walk in product with property : CO4-PT-09-LTLFireability-00
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 2 ms.
FORMULA CO4-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-00 finished in 49186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 205 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 205 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 201 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 201 transition count 286
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 198 transition count 283
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 198 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 198 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 197 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 197 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 197 transition count 280
Applied a total of 32 rules in 18 ms. Remains 197 /212 variables (removed 15) and now considering 280/301 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8557934615043578090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2361197550385265796.kers'
[2026-05-23 07:44:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8557934615043578090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2361197550385265796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 197 cols 780 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 07:44:07] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2361197550385265796.kers
Total runtime 1 ms.
[2026-05-23 07:44:08] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-23 07:44:08] [INFO ] Invariant cache hit.
[2026-05-23 07:44:08] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-23 07:44:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 18118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 484 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48191ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 48192ms
Starting structural reductions in LTL mode, iteration 1 : 197/212 places, 280/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48498 ms. Remains : 197/212 places, 280/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CO4-PT-09-LTLFireability-01
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-01 finished in 48648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Graph (trivial) has 217 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 462 edges and 211 vertex of which 210 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 209 transition count 227
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 138 transition count 223
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 137 transition count 218
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 132 transition count 218
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 159 place count 132 transition count 198
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 199 place count 112 transition count 198
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 110 transition count 194
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 110 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 110 transition count 193
Performed 30 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 264 place count 80 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 270 place count 80 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 272 place count 79 transition count 146
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 274 place count 77 transition count 142
Iterating global reduction 7 with 2 rules applied. Total rules applied 276 place count 77 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 278 place count 76 transition count 141
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 314 place count 58 transition count 161
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 322 place count 58 transition count 153
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 333 place count 47 transition count 109
Iterating global reduction 8 with 11 rules applied. Total rules applied 344 place count 47 transition count 109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 352 place count 47 transition count 101
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 354 place count 45 transition count 89
Iterating global reduction 9 with 2 rules applied. Total rules applied 356 place count 45 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 357 place count 45 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 359 place count 44 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 378 place count 44 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 380 place count 42 transition count 78
Applied a total of 380 rules in 57 ms. Remains 42 /212 variables (removed 170) and now considering 78/301 (removed 223) transitions.
[2026-05-23 07:44:56] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4654102332737191997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1239464930317547223.kers'
[2026-05-23 07:44:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4654102332737191997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1239464930317547223.kers]
Normalized transition count is 73 out of 74 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 42 cols 276 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-23 07:44:56] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1239464930317547223.kers
Total runtime 0 ms.
[2026-05-23 07:44:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-23 07:44:56] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
[2026-05-23 07:44:56] [INFO ] Invariant cache hit.
[2026-05-23 07:44:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 07:44:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2026-05-23 07:44:56] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 07:44:56] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
[2026-05-23 07:44:56] [INFO ] Invariant cache hit.
[2026-05-23 07:44:56] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/115 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/116 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 49 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/115 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 72/120 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/116 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 121 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4010ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/212 places, 78/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4207 ms. Remains : 42/212 places, 78/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-09-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 3 ms.
FORMULA CO4-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-03 finished in 4311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 205 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 205 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 201 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 201 transition count 286
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 198 transition count 283
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 198 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 198 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 197 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 197 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 197 transition count 280
Applied a total of 32 rules in 14 ms. Remains 197 /212 variables (removed 15) and now considering 280/301 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15107073139641312828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-903815521439116891.kers'
[2026-05-23 07:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15107073139641312828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-903815521439116891.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 197 cols 780 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 07:45:00] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-903815521439116891.kers
Total runtime 1 ms.
[2026-05-23 07:45:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:45:00] [INFO ] Invariant cache hit.
[2026-05-23 07:45:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-23 07:45:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 17316 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 484 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47378ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 47379ms
Starting structural reductions in LTL mode, iteration 1 : 197/212 places, 280/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47579 ms. Remains : 197/212 places, 280/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-04 finished in 47694 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||G((X(X(X(G(p0))))||p1)))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 206 transition count 293
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 206 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 203 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 203 transition count 288
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 200 transition count 285
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 200 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 200 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 199 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 199 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 199 transition count 282
Applied a total of 28 rules in 14 ms. Remains 199 /212 variables (removed 13) and now considering 282/301 (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-9350361800812534710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16654791359681420752.kers'
[2026-05-23 07:45:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9350361800812534710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16654791359681420752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 199 cols 784 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-23 07:45:48] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16654791359681420752.kers
Total runtime 1 ms.
[2026-05-23 07:45:48] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 07:45:48] [INFO ] Invariant cache hit.
[2026-05-23 07:45:48] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-23 07:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/481 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/481 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 206 constraints, problems are : Problem set: 0 solved, 281 unsolved in 18367 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/481 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 281/487 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 488 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48427ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 48428ms
Starting structural reductions in LTL mode, iteration 1 : 199/212 places, 282/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48621 ms. Remains : 199/212 places, 282/301 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||G((X(X(X(G(p0))))||p1)))))'
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-06 finished in 48875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Graph (trivial) has 226 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 462 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 207 transition count 221
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 156 place count 132 transition count 217
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 158 place count 131 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 130 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 159 place count 130 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 201 place count 109 transition count 195
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 204 place count 106 transition count 190
Iterating global reduction 4 with 3 rules applied. Total rules applied 207 place count 106 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 106 transition count 189
Performed 33 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 274 place count 73 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 280 place count 73 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 282 place count 72 transition count 137
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 284 place count 70 transition count 133
Iterating global reduction 7 with 2 rules applied. Total rules applied 286 place count 70 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 290 place count 68 transition count 131
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 324 place count 51 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 332 place count 51 transition count 140
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 342 place count 41 transition count 100
Iterating global reduction 8 with 10 rules applied. Total rules applied 352 place count 41 transition count 100
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 359 place count 41 transition count 93
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 361 place count 39 transition count 81
Iterating global reduction 9 with 2 rules applied. Total rules applied 363 place count 39 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 364 place count 39 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 372 place count 39 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 374 place count 37 transition count 70
Applied a total of 374 rules in 51 ms. Remains 37 /212 variables (removed 175) and now considering 70/301 (removed 231) transitions.
[2026-05-23 07:46:37] [INFO ] Flow matrix only has 54 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-302083985872703627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13772584545510854623.kers'
[2026-05-23 07:46:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-302083985872703627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13772584545510854623.kers]
Normalized transition count is 53 out of 54 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 37 cols 150 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-23 07:46:37] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13772584545510854623.kers
Total runtime 0 ms.
[2026-05-23 07:46:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 07:46:37] [INFO ] Flow matrix only has 54 transitions (discarded 16 similar events)
[2026-05-23 07:46:37] [INFO ] Invariant cache hit.
[2026-05-23 07:46:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:46:37] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2026-05-23 07:46:37] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2026-05-23 07:46:37] [INFO ] Flow matrix only has 54 transitions (discarded 16 similar events)
[2026-05-23 07:46:37] [INFO ] Invariant cache hit.
[2026-05-23 07:46:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 53/90 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 42 constraints, problems are : Problem set: 0 solved, 55 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 53/90 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 55/96 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 97 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1320 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2271ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/212 places, 70/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2409 ms. Remains : 37/212 places, 70/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-07 finished in 2483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Graph (trivial) has 223 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 462 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 207 transition count 224
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 150 place count 135 transition count 220
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 155 place count 134 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 130 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 159 place count 130 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 201 place count 109 transition count 195
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 204 place count 106 transition count 190
Iterating global reduction 4 with 3 rules applied. Total rules applied 207 place count 106 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 106 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 105 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 105 transition count 187
Performed 31 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 272 place count 74 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 9 rules applied. Total rules applied 281 place count 74 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 285 place count 72 transition count 137
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 287 place count 70 transition count 133
Iterating global reduction 7 with 2 rules applied. Total rules applied 289 place count 70 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 293 place count 68 transition count 131
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 329 place count 50 transition count 151
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 338 place count 50 transition count 142
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 349 place count 39 transition count 98
Iterating global reduction 8 with 11 rules applied. Total rules applied 360 place count 39 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 368 place count 39 transition count 90
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 371 place count 36 transition count 72
Iterating global reduction 9 with 3 rules applied. Total rules applied 374 place count 36 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 376 place count 36 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 383 place count 36 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 385 place count 34 transition count 61
Applied a total of 385 rules in 32 ms. Remains 34 /212 variables (removed 178) and now considering 61/301 (removed 240) transitions.
[2026-05-23 07:46:40] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13819904684585143577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10750768732565738266.kers'
[2026-05-23 07:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13819904684585143577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10750768732565738266.kers]
Normalized transition count is 55 out of 56 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 34 cols 163 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-23 07:46:40] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10750768732565738266.kers
Total runtime 1 ms.
[2026-05-23 07:46:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 07:46:40] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2026-05-23 07:46:40] [INFO ] Invariant cache hit.
[2026-05-23 07:46:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:46:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2026-05-23 07:46:40] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-23 07:46:40] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2026-05-23 07:46:40] [INFO ] Invariant cache hit.
[2026-05-23 07:46:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 55/88 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/89 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 55/88 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 44/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1393 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2418ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/212 places, 61/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2533 ms. Remains : 34/212 places, 61/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-09
Stuttering criterion allowed to conclude after 120 steps with 18 reset in 2 ms.
FORMULA CO4-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-09 finished in 2645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&(G(F(!p1))||(F(!p1)&&X(F(p2))))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 205 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 205 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 202 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 202 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 200 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 200 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 200 transition count 285
Applied a total of 25 rules in 13 ms. Remains 200 /212 variables (removed 12) and now considering 285/301 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-536827170919624686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-464097641978929074.kers'
[2026-05-23 07:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-536827170919624686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-464097641978929074.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 200 cols 790 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-23 07:46:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-464097641978929074.kers
Total runtime 2 ms.
[2026-05-23 07:46:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:46:42] [INFO ] Invariant cache hit.
[2026-05-23 07:46:42] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-23 07:46:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/485 variables, 200/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 208 constraints, problems are : Problem set: 0 solved, 284 unsolved in 18936 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/485 variables, 200/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 284/492 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 493 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48975ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 48976ms
Starting structural reductions in LTL mode, iteration 1 : 200/212 places, 285/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49145 ms. Remains : 200/212 places, 285/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&(G(F(p1))||(F(p1)&&X(F(p2))))))'
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-09-LTLFireability-10
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-10 finished in 49462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Graph (trivial) has 218 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 462 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 207 transition count 225
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 136 transition count 221
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 135 transition count 216
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 130 transition count 216
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 159 place count 130 transition count 196
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 199 place count 110 transition count 196
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 202 place count 107 transition count 191
Iterating global reduction 4 with 3 rules applied. Total rules applied 205 place count 107 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 107 transition count 190
Performed 30 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 266 place count 77 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 272 place count 77 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 274 place count 76 transition count 142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 276 place count 74 transition count 138
Iterating global reduction 7 with 2 rules applied. Total rules applied 278 place count 74 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 72 transition count 136
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 316 place count 55 transition count 153
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 323 place count 55 transition count 146
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 333 place count 45 transition count 106
Iterating global reduction 8 with 10 rules applied. Total rules applied 343 place count 45 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 349 place count 45 transition count 100
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 351 place count 43 transition count 88
Iterating global reduction 9 with 2 rules applied. Total rules applied 353 place count 43 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 363 place count 43 transition count 78
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 370 place count 43 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 372 place count 41 transition count 76
Applied a total of 372 rules in 35 ms. Remains 41 /212 variables (removed 171) and now considering 76/301 (removed 225) transitions.
[2026-05-23 07:47:32] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10450210513274857685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5284664698813035161.kers'
[2026-05-23 07:47:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10450210513274857685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5284664698813035161.kers]
Normalized transition count is 69 out of 70 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 41 cols 239 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-23 07:47:32] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5284664698813035161.kers
Total runtime 0 ms.
[2026-05-23 07:47:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 07:47:32] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2026-05-23 07:47:32] [INFO ] Invariant cache hit.
[2026-05-23 07:47:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-23 07:47:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2026-05-23 07:47:32] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2026-05-23 07:47:32] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2026-05-23 07:47:32] [INFO ] Invariant cache hit.
[2026-05-23 07:47:32] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 69/110 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 57 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 69/110 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 127 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4148ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/212 places, 76/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4264 ms. Remains : 41/212 places, 76/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-11 finished in 4321 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&&X((F(p0)&&X((p1||F(G(p2)))))))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 206 transition count 293
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 206 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 202 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 202 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 199 transition count 284
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 199 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 199 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 198 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 198 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 198 transition count 281
Applied a total of 30 rules in 12 ms. Remains 198 /212 variables (removed 14) and now considering 281/301 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6037460247980338611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13854726168371707523.kers'
[2026-05-23 07:47:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6037460247980338611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13854726168371707523.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 281 rows 198 cols 782 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-23 07:47:36] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13854726168371707523.kers
Total runtime 1 ms.
[2026-05-23 07:47:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 07:47:36] [INFO ] Invariant cache hit.
[2026-05-23 07:47:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2026-05-23 07:47:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 281/479 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 205 constraints, problems are : Problem set: 0 solved, 280 unsolved in 18149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 281/479 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 280/485 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 486 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48188ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 48189ms
Starting structural reductions in LTL mode, iteration 1 : 198/212 places, 281/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48374 ms. Remains : 198/212 places, 281/301 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&&X((F(p0)&&X((p1||F(G(p2)))))))))'
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CO4-PT-09-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-13 finished in 48640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p2&&(F(p0) U p1)))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 206 transition count 294
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 206 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 205 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 205 transition count 293
Applied a total of 14 rules in 13 ms. Remains 205 /212 variables (removed 7) and now considering 293/301 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10990399111043114496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4203175346608588949.kers'
[2026-05-23 07:48:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10990399111043114496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4203175346608588949.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 205 cols 806 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:48:25] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4203175346608588949.kers
Total runtime 3 ms.
[2026-05-23 07:48:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 07:48:25] [INFO ] Invariant cache hit.
[2026-05-23 07:48:25] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-23 07:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/498 variables, 205/212 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 212 constraints, problems are : Problem set: 0 solved, 292 unsolved in 19755 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/498 variables, 205/212 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 292/504 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 505 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49801ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 49801ms
Starting structural reductions in LTL mode, iteration 1 : 205/212 places, 293/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50022 ms. Remains : 205/212 places, 293/301 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U (p2&&(F(p0) U p1)))))'
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-09-LTLFireability-14
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-14 finished in 50197 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(p0)||X(X(G((p1&&F(p2)))))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 301/301 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 205 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 205 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 201 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 201 transition count 286
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 198 transition count 283
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 198 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 198 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 197 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 197 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 197 transition count 280
Applied a total of 32 rules in 13 ms. Remains 197 /212 variables (removed 15) and now considering 280/301 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9911069128889393919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13293396562891688767.kers'
[2026-05-23 07:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9911069128889393919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13293396562891688767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 197 cols 780 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 07:49:15] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13293396562891688767.kers
Total runtime 2 ms.
[2026-05-23 07:49:15] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:49:15] [INFO ] Invariant cache hit.
[2026-05-23 07:49:15] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-23 07:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 17645 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 484 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47682ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 47683ms
Starting structural reductions in LTL mode, iteration 1 : 197/212 places, 280/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47909 ms. Remains : 197/212 places, 280/301 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(p0)||X(X(G((p1&&F(p2)))))))'
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-15 finished in 48205 ms.
All properties solved by simple procedures.
Total runtime 464260 ms.

BK_STOP 1779522603486

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-09"
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 CO4-PT-09, 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 r066-tall-177946967700348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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