Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 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 110K 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 MedleyA-PT-15-LTLFireability-00
FORMULA_NAME MedleyA-PT-15-LTLFireability-01
FORMULA_NAME MedleyA-PT-15-LTLFireability-02
FORMULA_NAME MedleyA-PT-15-LTLFireability-03
FORMULA_NAME MedleyA-PT-15-LTLFireability-04
FORMULA_NAME MedleyA-PT-15-LTLFireability-05
FORMULA_NAME MedleyA-PT-15-LTLFireability-06
FORMULA_NAME MedleyA-PT-15-LTLFireability-07
FORMULA_NAME MedleyA-PT-15-LTLFireability-08
FORMULA_NAME MedleyA-PT-15-LTLFireability-09
FORMULA_NAME MedleyA-PT-15-LTLFireability-10
FORMULA_NAME MedleyA-PT-15-LTLFireability-11
FORMULA_NAME MedleyA-PT-15-LTLFireability-12
FORMULA_NAME MedleyA-PT-15-LTLFireability-13
FORMULA_NAME MedleyA-PT-15-LTLFireability-14
FORMULA_NAME MedleyA-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700498160

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:14:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:14:59] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2026-05-25 09:14:59] [INFO ] Transformed 192 places.
[2026-05-25 09:14:59] [INFO ] Transformed 475 transitions.
[2026-05-25 09:14:59] [INFO ] Found NUPN structural information;
[2026-05-25 09:14:59] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 153 transition count 412
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 153 transition count 412
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 98 place count 153 transition count 392
Applied a total of 98 rules in 30 ms. Remains 153 /192 variables (removed 39) and now considering 392/473 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9008300246971269559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15569054647636109313.kers'
[2026-05-25 09:15:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9008300246971269559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15569054647636109313.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 392 rows 153 cols 1318 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 09:15:00] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15569054647636109313.kers
Total runtime 2 ms.
[2026-05-25 09:15:00] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-25 09:15:00] [INFO ] Invariant cache hit.
[2026-05-25 09:15:00] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2026-05-25 09:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 392/545 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 187 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/545 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 391/579 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 580 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 153/192 places, 392/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60846 ms. Remains : 153/192 places, 392/473 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2026-05-25 09:16:00] [INFO ] Invariant cache hit.
[2026-05-25 09:16:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:16:00] [INFO ] Invariant cache hit.
[2026-05-25 09:16:01] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 153/153 places, 392/392 transitions.
Support contains 45 out of 153 places after structural reductions.
[2026-05-25 09:16:01] [INFO ] Flatten gal took : 70 ms
[2026-05-25 09:16:01] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:16:01] [INFO ] Input system was already deterministic with 392 transitions.
RANDOM walk for 40000 steps (8 resets) in 2058 ms. (19 steps per ms) remains 36/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
[2026-05-25 09:16:02] [INFO ] Invariant cache hit.
Problem AtomicPropp38 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/151 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/153 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 392/545 variables, 153/160 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 160 constraints, problems are : Problem set: 3 solved, 29 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 113/151 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 6/12 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/14 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 2/153 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 392/545 variables, 153/168 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 29/197 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/545 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 197 constraints, problems are : Problem set: 3 solved, 29 unsolved in 4676 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 29/32 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5606ms problems are : Problem set: 3 solved, 29 unsolved
Parikh walk visited 4 properties in 4579 ms.
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 392/392 transitions.
Graph (trivial) has 117 edges and 153 vertex of which 9 / 153 are part of one of the 3 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 147 transition count 367
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 131 transition count 367
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 33 place count 131 transition count 362
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 126 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 122 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 122 transition count 355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 51 place count 122 transition count 354
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 121 transition count 354
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 106 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 106 transition count 337
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 119 place count 89 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 152 place count 89 transition count 439
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 87 transition count 462
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 87 transition count 457
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 82 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 173 place count 82 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 82 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 82 transition count 449
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 81 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 80 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 181 place count 80 transition count 444
Applied a total of 181 rules in 101 ms. Remains 80 /153 variables (removed 73) and now considering 444/392 (removed -52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 80/153 places, 444/392 transitions.
RANDOM walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
[2026-05-25 09:16:13] [INFO ] Flow matrix only has 429 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3959968277853030873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17032644096666700899.kers'
[2026-05-25 09:16:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3959968277853030873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17032644096666700899.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 429 rows 79 cols 1588 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-25 09:16:13] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17032644096666700899.kers
Total runtime 2 ms.
[2026-05-25 09:16:13] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 47/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 410/476 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/509 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/509 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 122 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1756 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 47/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 410/476 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 33/509 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/509 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 135 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1684 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3471ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 3403 steps, including 387 resets, run visited all 1 properties in 5 ms. (steps per millisecond=680 )
Parikh walk visited 13 properties in 359 ms.
FORMULA MedleyA-PT-15-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((F(p1) U p2))&&p0) U X(p3)))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 373
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 373
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 143 transition count 368
Applied a total of 25 rules in 9 ms. Remains 143 /153 variables (removed 10) and now considering 368/392 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2701400674042532690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15051030415851776332.kers'
[2026-05-25 09:16:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2701400674042532690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15051030415851776332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 143 cols 1260 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-25 09:16:17] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15051030415851776332.kers
Total runtime 2 ms.
[2026-05-25 09:16:17] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 09:16:17] [INFO ] Invariant cache hit.
[2026-05-25 09:16:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:16:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/511 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 174 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/511 variables, 143/174 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 367/541 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 544 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 368/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 143/153 places, 368/392 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(p1) U p2))&&p0) U X(p3)))'
Stuttering acceptance computed with spot in 505 ms :[(NOT p3), (NOT p3), (AND p2 (NOT p1) (NOT p3)), (NOT p3), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA MedleyA-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-00 finished in 61117 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(((p1 U (p2||G(p1)))&&p0))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Graph (trivial) has 155 edges and 153 vertex of which 9 / 153 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 146 transition count 367
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 128 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 127 transition count 366
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 39 place count 127 transition count 359
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 120 transition count 359
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 62 place count 111 transition count 342
Iterating global reduction 3 with 9 rules applied. Total rules applied 71 place count 111 transition count 342
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 3 with 6 rules applied. Total rules applied 77 place count 111 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 110 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 110 transition count 335
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 109 transition count 335
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 81 place count 108 transition count 333
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 108 transition count 333
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 5 with 34 rules applied. Total rules applied 116 place count 91 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 91 transition count 314
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 121 place count 88 transition count 305
Iterating global reduction 6 with 3 rules applied. Total rules applied 124 place count 88 transition count 305
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 156 place count 72 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 196 place count 72 transition count 372
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 202 place count 69 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 68 transition count 406
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 72 edges and 66 vertex of which 25 / 66 are part of one of the 10 SCC in 1 ms
Free SCC test removed 15 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 206 place count 51 transition count 406
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 275 place count 51 transition count 337
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 279 place count 47 transition count 281
Iterating global reduction 8 with 4 rules applied. Total rules applied 283 place count 47 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 293 place count 47 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 9 with 93 rules applied. Total rules applied 386 place count 47 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 386 place count 47 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 390 place count 45 transition count 176
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 391 place count 44 transition count 170
Iterating global reduction 9 with 1 rules applied. Total rules applied 392 place count 44 transition count 170
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 9 with 4 rules applied. Total rules applied 396 place count 42 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 401 place count 42 transition count 163
Applied a total of 401 rules in 96 ms. Remains 42 /153 variables (removed 111) and now considering 163/392 (removed 229) transitions.
[2026-05-25 09:17:18] [INFO ] Flow matrix only has 151 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4218999001794887247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16968374434703716276.kers'
[2026-05-25 09:17:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4218999001794887247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16968374434703716276.kers]
Normalized transition count is 150 out of 151 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 42 cols 602 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:17:18] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16968374434703716276.kers
Total runtime 1 ms.
[2026-05-25 09:17:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 09:17:18] [INFO ] Flow matrix only has 151 transitions (discarded 12 similar events)
[2026-05-25 09:17:18] [INFO ] Invariant cache hit.
[2026-05-25 09:17:18] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-25 09:17:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2026-05-25 09:17:18] [INFO ] Redundant transitions in 41 ms returned [19, 106, 107, 125, 127, 128, 149, 151, 153, 156, 158, 159, 162]
Found 13 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 13 transitions
Redundant transitions reduction (with SMT) removed 13 transitions.
Running 144 sub problems to find dead transitions.
[2026-05-25 09:17:18] [INFO ] Flow matrix only has 138 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1668394208645124940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13505209721643048885.kers'
[2026-05-25 09:17:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1668394208645124940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13505209721643048885.kers]
Normalized transition count is 137 out of 138 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 42 cols 550 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:17:18] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13505209721643048885.kers
Total runtime 1 ms.
[2026-05-25 09:17:18] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 137/179 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 80 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4822 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 137/179 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 144/224 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 224 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6801 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11685ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 11685ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/153 places, 150/392 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 42 transition count 149
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 39 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 39 transition count 146
Applied a total of 6 rules in 15 ms. Remains 39 /42 variables (removed 3) and now considering 146/150 (removed 4) transitions.
[2026-05-25 09:17:30] [INFO ] Flow matrix only has 134 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3472641569101511697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8659556514516852825.kers'
[2026-05-25 09:17:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3472641569101511697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8659556514516852825.kers]
Normalized transition count is 133 out of 134 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 39 cols 540 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 09:17:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8659556514516852825.kers
Total runtime 1 ms.
[2026-05-25 09:17:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:17:30] [INFO ] Flow matrix only has 134 transitions (discarded 12 similar events)
[2026-05-25 09:17:30] [INFO ] Invariant cache hit.
[2026-05-25 09:17:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-25 09:17:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/153 places, 146/392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12154 ms. Remains : 39/153 places, 146/392 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(((p1 U (p2||G(p1)))&&p0))))'
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-01 finished in 12346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(p2))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Graph (trivial) has 154 edges and 153 vertex of which 9 / 153 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 146 transition count 369
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 130 transition count 369
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 33 place count 130 transition count 361
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 49 place count 122 transition count 361
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 113 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 113 transition count 344
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 113 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 113 transition count 338
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 112 transition count 338
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 108 place count 95 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 95 transition count 319
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 91 transition count 308
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 91 transition count 308
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 152 place count 74 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 190 place count 74 transition count 387
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 198 place count 70 transition count 435
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 70 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 69 transition count 434
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 68 edges and 67 vertex of which 21 / 67 are part of one of the 8 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 203 place count 54 transition count 434
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 5 with 66 rules applied. Total rules applied 269 place count 54 transition count 368
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 272 place count 51 transition count 322
Iterating global reduction 6 with 3 rules applied. Total rules applied 275 place count 51 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 6 with 99 rules applied. Total rules applied 374 place count 51 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 375 place count 51 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 376 place count 50 transition count 222
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 377 place count 49 transition count 216
Iterating global reduction 8 with 1 rules applied. Total rules applied 378 place count 49 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 382 place count 47 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 46 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 409 place count 46 transition count 195
Applied a total of 409 rules in 104 ms. Remains 46 /153 variables (removed 107) and now considering 195/392 (removed 197) transitions.
[2026-05-25 09:17:30] [INFO ] Flow matrix only has 179 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-14473938909442398763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3228645021390054215.kers'
[2026-05-25 09:17:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14473938909442398763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3228645021390054215.kers]
Normalized transition count is 178 out of 179 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 46 cols 704 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:17:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3228645021390054215.kers
Total runtime 1 ms.
[2026-05-25 09:17:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:17:31] [INFO ] Flow matrix only has 179 transitions (discarded 16 similar events)
[2026-05-25 09:17:31] [INFO ] Invariant cache hit.
[2026-05-25 09:17:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:17:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-25 09:17:31] [INFO ] Redundant transitions in 48 ms returned [20, 21, 102, 104, 106, 132, 134, 135, 136, 137, 138, 139, 141, 150, 153, 154, 155, 174, 177, 178, 179, 180, 183, 184, 185]
Found 25 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 25 transitions
Redundant transitions reduction (with SMT) removed 25 transitions.
Running 164 sub problems to find dead transitions.
[2026-05-25 09:17:31] [INFO ] Flow matrix only has 154 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-6061809886878030201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6310946074723531073.kers'
[2026-05-25 09:17:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6061809886878030201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6310946074723531073.kers]
Normalized transition count is 153 out of 154 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 46 cols 604 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:17:31] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6310946074723531073.kers
Total runtime 1 ms.
[2026-05-25 09:17:31] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 153/199 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 93 constraints, problems are : Problem set: 0 solved, 164 unsolved in 7853 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 153/199 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 36/93 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 164/257 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 199/200 variables, and 257 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37940ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 37940ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/153 places, 170/392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 44 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 44 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 40 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 39 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 22 place count 39 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 31 place count 39 transition count 162
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 39 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 38 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 38 transition count 161
Applied a total of 34 rules in 36 ms. Remains 38 /46 variables (removed 8) and now considering 161/170 (removed 9) transitions.
[2026-05-25 09:18:09] [INFO ] Flow matrix only has 145 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-5380714339882153313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16936780257182033379.kers'
[2026-05-25 09:18:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5380714339882153313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16936780257182033379.kers]
Normalized transition count is 144 out of 145 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 38 cols 586 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:18:09] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16936780257182033379.kers
Total runtime 1 ms.
[2026-05-25 09:18:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:18:09] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2026-05-25 09:18:09] [INFO ] Invariant cache hit.
[2026-05-25 09:18:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:18:09] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/153 places, 161/392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38776 ms. Remains : 38/153 places, 161/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||p2)))'
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-02 finished in 38859 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 U p1)||G(p2))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 142 transition count 366
Applied a total of 28 rules in 7 ms. Remains 142 /153 variables (removed 11) and now considering 366/392 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10666741355488797268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3171542323620249807.kers'
[2026-05-25 09:18:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10666741355488797268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3171542323620249807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:18:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3171542323620249807.kers
Total runtime 2 ms.
[2026-05-25 09:18:09] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:18:09] [INFO ] Invariant cache hit.
[2026-05-25 09:18:09] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:18:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/165 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 166 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 365/532 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 533 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 366/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60331 ms. Remains : 142/153 places, 366/392 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 U p1)||G(p2))))'
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 17 factoid took 86 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 483 ms. (82 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 882739 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :6 out of 13
Probabilistic random walk after 882739 steps, saw 182107 distinct states, run finished after 3006 ms. (steps per millisecond=293 ) properties seen :6
[2026-05-25 09:19:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf4 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 132/138 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem apf12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/142 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/150 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/508 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 150 constraints, problems are : Problem set: 3 solved, 4 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/138 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/142 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 4/158 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 1/159 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/508 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 159 constraints, problems are : Problem set: 4 solved, 3 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1689ms problems are : Problem set: 4 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 366/366 transitions.
Graph (trivial) has 135 edges and 142 vertex of which 9 / 142 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 136 transition count 336
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 115 transition count 336
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 43 place count 115 transition count 328
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 59 place count 107 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 107 transition count 327
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 105 transition count 323
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 105 transition count 323
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 94 place count 90 transition count 308
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 89 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 89 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -130
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 130 place count 72 transition count 434
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 72 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 186 place count 72 transition count 378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 70 transition count 400
Free-agglomeration rule applied 21 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 211 place count 70 transition count 371
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 262 place count 49 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 5 with 33 rules applied. Total rules applied 295 place count 49 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 296 place count 48 transition count 307
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 36 edges and 46 vertex of which 10 / 46 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 299 place count 41 transition count 307
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 6 with 74 rules applied. Total rules applied 373 place count 41 transition count 233
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 378 place count 36 transition count 205
Iterating global reduction 7 with 5 rules applied. Total rules applied 383 place count 36 transition count 205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 392 place count 36 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 420 place count 36 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 424 place count 34 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 428 place count 32 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 446 place count 32 transition count 160
Applied a total of 446 rules in 33 ms. Remains 32 /142 variables (removed 110) and now considering 160/366 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 32/142 places, 160/366 transitions.
RANDOM walk for 21347 steps (170 resets) in 113 ms. (187 steps per ms) remains 0/3 properties
Found 4 invariant AP formulas.
Knowledge based reduction with 21 factoid took 159 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (NOT p2)]
Knowledge-based reduction took 6256 ms.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (NOT p2)]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 366/366 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-25 09:19:17] [INFO ] Invariant cache hit.
[2026-05-25 09:19:17] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 09:19:17] [INFO ] Invariant cache hit.
[2026-05-25 09:19:17] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 142/142 places, 366/366 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 10 factoid took 52 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 977474 steps, run visited all 5 properties in 1844 ms. (steps per millisecond=530 )
Probabilistic random walk after 977474 steps, saw 199474 distinct states, run finished after 1847 ms. (steps per millisecond=529 ) properties seen :5
Knowledge based reduction with 10 factoid took 195 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (NOT p2)]
Knowledge-based reduction took 2672 ms.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (NOT p2)]
Stuttering acceptance computed with spot in 280 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 163 ms.
Spot run failed in 154 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin455064247261614380
[2026-05-25 09:19:21] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin455064247261614380
Running compilation step : cd /tmp/ltsmin455064247261614380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 736 ms.
Running link step : cd /tmp/ltsmin455064247261614380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin455064247261614380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16145149408015302167.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA MedleyA-PT-15-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-04 finished in 72592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!X(p0) U p1))&&G((X(X(p1))||p0))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 141 transition count 364
Applied a total of 30 rules in 8 ms. Remains 141 /153 variables (removed 12) and now considering 364/392 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9435430996836222613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6135541396177885324.kers'
[2026-05-25 09:19:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9435430996836222613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6135541396177885324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:19:22] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6135541396177885324.kers
Total runtime 3 ms.
[2026-05-25 09:19:22] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 09:19:22] [INFO ] Invariant cache hit.
[2026-05-25 09:19:22] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:19:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 364/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 141/153 places, 364/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!X(p0) U p1))&&G((X(X(p1))||p0))))'
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-05 finished in 60711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Graph (trivial) has 161 edges and 153 vertex of which 9 / 153 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 146 transition count 366
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 127 transition count 366
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 127 transition count 358
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 119 transition count 358
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 110 transition count 341
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 110 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 110 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 109 transition count 338
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 109 transition count 337
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 108 transition count 337
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 107 transition count 335
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 107 transition count 335
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 115 place count 90 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 90 transition count 316
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 120 place count 87 transition count 307
Iterating global reduction 5 with 3 rules applied. Total rules applied 123 place count 87 transition count 307
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -128
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 159 place count 69 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 160 place count 69 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 6 with 37 rules applied. Total rules applied 197 place count 69 transition count 397
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 203 place count 66 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 65 transition count 434
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 76 edges and 63 vertex of which 26 / 63 are part of one of the 10 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 207 place count 47 transition count 434
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 7 with 83 rules applied. Total rules applied 290 place count 47 transition count 351
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 294 place count 43 transition count 292
Iterating global reduction 8 with 4 rules applied. Total rules applied 298 place count 43 transition count 292
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 309 place count 43 transition count 281
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 9 with 2 rules applied. Total rules applied 311 place count 42 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 312 place count 42 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 10 with 107 rules applied. Total rules applied 419 place count 42 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 419 place count 42 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 423 place count 40 transition count 182
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 424 place count 39 transition count 175
Iterating global reduction 10 with 1 rules applied. Total rules applied 425 place count 39 transition count 175
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 10 with 4 rules applied. Total rules applied 429 place count 37 transition count 173
Applied a total of 429 rules in 50 ms. Remains 37 /153 variables (removed 116) and now considering 173/392 (removed 219) transitions.
[2026-05-25 09:20:23] [INFO ] Flow matrix only has 153 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11242780843712173463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1644305335653959037.kers'
[2026-05-25 09:20:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11242780843712173463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1644305335653959037.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 37 cols 626 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:20:23] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1644305335653959037.kers
Total runtime 2 ms.
[2026-05-25 09:20:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 09:20:23] [INFO ] Flow matrix only has 153 transitions (discarded 20 similar events)
[2026-05-25 09:20:23] [INFO ] Invariant cache hit.
[2026-05-25 09:20:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:20:23] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-25 09:20:23] [INFO ] Redundant transitions in 33 ms returned [119, 121, 122, 167, 168, 169, 170, 172]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 159 sub problems to find dead transitions.
[2026-05-25 09:20:23] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8837142208430376552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12128239153676980462.kers'
[2026-05-25 09:20:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8837142208430376552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12128239153676980462.kers]
Normalized transition count is 144 out of 145 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 37 cols 594 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:20:23] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12128239153676980462.kers
Total runtime 2 ms.
[2026-05-25 09:20:23] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 83 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4141 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 159/242 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 242 constraints, problems are : Problem set: 0 solved, 159 unsolved in 12224 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16446ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 16447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/153 places, 165/392 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 37 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 35 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 35 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 34 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 34 transition count 153
Applied a total of 14 rules in 14 ms. Remains 34 /37 variables (removed 3) and now considering 153/165 (removed 12) transitions.
[2026-05-25 09:20:39] [INFO ] Flow matrix only has 136 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15114650530611873028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10169590312054759281.kers'
[2026-05-25 09:20:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15114650530611873028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10169590312054759281.kers]
Normalized transition count is 135 out of 136 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 34 cols 566 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 09:20:39] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10169590312054759281.kers
Total runtime 2 ms.
[2026-05-25 09:20:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:20:39] [INFO ] Flow matrix only has 136 transitions (discarded 17 similar events)
[2026-05-25 09:20:39] [INFO ] Invariant cache hit.
[2026-05-25 09:20:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:20:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/153 places, 153/392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16893 ms. Remains : 34/153 places, 153/392 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 52 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-06 finished in 16977 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(p1)))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 141 transition count 364
Applied a total of 30 rules in 8 ms. Remains 141 /153 variables (removed 12) and now considering 364/392 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18346603385285218202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6746210106453138693.kers'
[2026-05-25 09:20:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18346603385285218202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6746210106453138693.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:20:40] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6746210106453138693.kers
Total runtime 2 ms.
[2026-05-25 09:20:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 09:20:40] [INFO ] Invariant cache hit.
[2026-05-25 09:20:40] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 364/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60373 ms. Remains : 141/153 places, 364/392 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(p1)))'
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 6 factoid took 48 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1641076 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :5 out of 6
Probabilistic random walk after 1641076 steps, saw 371765 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :5
[2026-05-25 09:21:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 94/505 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 7 factoid took 77 ms. Proved property starting from automaton with 5 states, 12 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 3558 ms.
FORMULA MedleyA-PT-15-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-08 finished in 64338 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Graph (trivial) has 162 edges and 153 vertex of which 9 / 153 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 146 transition count 366
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 127 transition count 366
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 127 transition count 358
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 119 transition count 358
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 110 transition count 340
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 110 transition count 340
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 2 with 6 rules applied. Total rules applied 79 place count 110 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 109 transition count 334
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 108 transition count 332
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 108 transition count 332
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 118 place count 90 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 90 transition count 312
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 123 place count 87 transition count 303
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 87 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 160 place count 70 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 5 with 38 rules applied. Total rules applied 198 place count 70 transition count 382
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 206 place count 66 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 65 transition count 429
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 75 edges and 63 vertex of which 28 / 63 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 210 place count 46 transition count 429
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 297 place count 46 transition count 342
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 302 place count 41 transition count 275
Iterating global reduction 7 with 5 rules applied. Total rules applied 307 place count 41 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 317 place count 41 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 8 with 87 rules applied. Total rules applied 404 place count 41 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 404 place count 41 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 408 place count 39 transition count 176
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 409 place count 38 transition count 170
Iterating global reduction 8 with 1 rules applied. Total rules applied 410 place count 38 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 414 place count 36 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 417 place count 36 transition count 165
Applied a total of 417 rules in 50 ms. Remains 36 /153 variables (removed 117) and now considering 165/392 (removed 227) transitions.
[2026-05-25 09:21:44] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14858613267725651601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4197849515277195763.kers'
[2026-05-25 09:21:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14858613267725651601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4197849515277195763.kers]
Normalized transition count is 144 out of 145 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 36 cols 600 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 09:21:44] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4197849515277195763.kers
Total runtime 1 ms.
[2026-05-25 09:21:44] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:21:44] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
[2026-05-25 09:21:44] [INFO ] Invariant cache hit.
[2026-05-25 09:21:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:21:44] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2026-05-25 09:21:44] [INFO ] Redundant transitions in 18 ms returned [118, 119, 161, 162, 164]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 154 sub problems to find dead transitions.
[2026-05-25 09:21:44] [INFO ] Flow matrix only has 140 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5424933901203012850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2064784067721322423.kers'
[2026-05-25 09:21:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5424933901203012850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2064784067721322423.kers]
Normalized transition count is 139 out of 140 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 36 cols 580 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-25 09:21:44] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2064784067721322423.kers
Total runtime 1 ms.
[2026-05-25 09:21:44] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 139/175 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/176 variables, and 81 constraints, problems are : Problem set: 0 solved, 154 unsolved in 5336 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 139/175 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 154/235 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/176 variables, and 236 constraints, problems are : Problem set: 0 solved, 154 unsolved in 12372 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17761ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 17761ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/153 places, 160/392 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 36 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 34 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 34 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 33 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 33 transition count 148
Applied a total of 14 rules in 16 ms. Remains 33 /36 variables (removed 3) and now considering 148/160 (removed 12) transitions.
[2026-05-25 09:22:02] [INFO ] Flow matrix only has 131 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7614129863716820461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17935024620956976364.kers'
[2026-05-25 09:22:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7614129863716820461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17935024620956976364.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 33 cols 552 entries
Finished phase 1 with 27 SingleSign rule and 1 generalized
[2026-05-25 09:22:02] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17935024620956976364.kers
Total runtime 2 ms.
[2026-05-25 09:22:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 09:22:02] [INFO ] Flow matrix only has 131 transitions (discarded 17 similar events)
[2026-05-25 09:22:02] [INFO ] Invariant cache hit.
[2026-05-25 09:22:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:22:02] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/153 places, 148/392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18163 ms. Remains : 33/153 places, 148/392 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 31 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-09 finished in 18235 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) U p1) U X(X(!p1))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 376
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 144 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 143 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 143 transition count 368
Applied a total of 26 rules in 4 ms. Remains 143 /153 variables (removed 10) and now considering 368/392 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17335718603953223770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3646397546956793780.kers'
[2026-05-25 09:22:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17335718603953223770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3646397546956793780.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 143 cols 1260 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-25 09:22:02] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3646397546956793780.kers
Total runtime 2 ms.
[2026-05-25 09:22:02] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 09:22:02] [INFO ] Invariant cache hit.
[2026-05-25 09:22:02] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/511 variables, 143/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 172 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/511 variables, 143/172 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 367/539 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 542 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 368/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 143/153 places, 368/392 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) U p1) U X(X(!p1))))'
Stuttering acceptance computed with spot in 602 ms :[p1, p1, (AND p1 (NOT p0)), p1, p1, true, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-10 finished in 61195 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)&&F(p1)&&(X(X(p2))||F(p3))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 374
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 143 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 142 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 369
Applied a total of 25 rules in 7 ms. Remains 142 /153 variables (removed 11) and now considering 369/392 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17853660604756879764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15536420887373284427.kers'
[2026-05-25 09:23:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17853660604756879764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15536420887373284427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 142 cols 1268 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:23:03] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15536420887373284427.kers
Total runtime 3 ms.
[2026-05-25 09:23:03] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 09:23:03] [INFO ] Invariant cache hit.
[2026-05-25 09:23:04] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 09:23:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 369/511 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 168 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/511 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 368/536 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 5/541 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 541 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 369/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 142/153 places, 369/392 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)&&F(p1)&&(X(X(p2))||F(p3))))'
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-11
Product exploration explored 100000 steps with 3 reset in 118 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-11 finished in 60902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p0 U X(p1))||F(G(p0))))&&F(p2))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 142 transition count 366
Applied a total of 28 rules in 5 ms. Remains 142 /153 variables (removed 11) and now considering 366/392 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17801261588592116469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17008483788728390752.kers'
[2026-05-25 09:24:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17801261588592116469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17008483788728390752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:24:04] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17008483788728390752.kers
Total runtime 4 ms.
[2026-05-25 09:24:04] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 09:24:04] [INFO ] Invariant cache hit.
[2026-05-25 09:24:05] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 169 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/534 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 538 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 366/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60443 ms. Remains : 142/153 places, 366/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p0 U X(p1))||F(G(p0))))&&F(p2))))'
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 176 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-12 finished in 61054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 374
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 142 transition count 366
Applied a total of 28 rules in 8 ms. Remains 142 /153 variables (removed 11) and now considering 366/392 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-407983789909917648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13317787324246854549.kers'
[2026-05-25 09:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-407983789909917648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13317787324246854549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:25:05] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13317787324246854549.kers
Total runtime 4 ms.
[2026-05-25 09:25:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 09:25:05] [INFO ] Invariant cache hit.
[2026-05-25 09:25:06] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 366/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 142/153 places, 366/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 123 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-13 finished in 699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(((!p1&&X(!p2))||G(!p2)))))||(!p3&&((p0||F(((!p1&&X(!p2))||G(!p2)))) U (G((p0||F(((!p1&&X(!p2))||G(!p2)))))||(!p2&&(p0||F(((!p1&&X(!p2))||G(!p2)))))))))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 141 transition count 364
Applied a total of 30 rules in 7 ms. Remains 141 /153 variables (removed 12) and now considering 364/392 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5284366195700299049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13184481326845819053.kers'
[2026-05-25 09:25:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5284366195700299049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13184481326845819053.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:25:06] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13184481326845819053.kers
Total runtime 4 ms.
[2026-05-25 09:25:06] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 09:25:06] [INFO ] Invariant cache hit.
[2026-05-25 09:25:06] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:25:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 364/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60509 ms. Remains : 141/153 places, 364/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(((p1&&X(p2))||G(p2)))))||(((p0||F(((p1&&X(p2))||G(p2)))) U (G((p0||F(((p1&&X(p2))||G(p2)))))||(p2&&(p0||F(((p1&&X(p2))||G(p2)))))))&&p3))))'
Stuttering acceptance computed with spot in 466 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 57 factoid took 14 ms. Proved property starting from automaton with 8 states, 53 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA MedleyA-PT-15-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-15-LTLFireability-14 finished in 61421 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 392/392 transitions.
Graph (trivial) has 162 edges and 153 vertex of which 9 / 153 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 146 transition count 366
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 127 transition count 366
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 127 transition count 358
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 119 transition count 358
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 65 place count 109 transition count 339
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 109 transition count 339
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 2 with 6 rules applied. Total rules applied 81 place count 109 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 108 transition count 333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 108 transition count 332
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 107 transition count 332
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 106 transition count 330
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 106 transition count 330
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 118 place count 90 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 90 transition count 312
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 122 place count 88 transition count 306
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 88 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 158 place count 71 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 197 place count 71 transition count 388
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 205 place count 67 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 66 transition count 435
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 75 edges and 64 vertex of which 28 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 209 place count 47 transition count 435
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 296 place count 47 transition count 348
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 301 place count 42 transition count 281
Iterating global reduction 7 with 5 rules applied. Total rules applied 306 place count 42 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 316 place count 42 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 8 with 87 rules applied. Total rules applied 403 place count 42 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 403 place count 42 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 407 place count 40 transition count 182
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 408 place count 39 transition count 176
Iterating global reduction 8 with 1 rules applied. Total rules applied 409 place count 39 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 413 place count 37 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 416 place count 37 transition count 171
Applied a total of 416 rules in 36 ms. Remains 37 /153 variables (removed 116) and now considering 171/392 (removed 221) transitions.
[2026-05-25 09:26:07] [INFO ] Flow matrix only has 151 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2530922672482298587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1516930849695199703.kers'
[2026-05-25 09:26:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2530922672482298587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1516930849695199703.kers]
Normalized transition count is 150 out of 151 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 37 cols 632 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:26:07] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1516930849695199703.kers
Total runtime 0 ms.
[2026-05-25 09:26:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 09:26:07] [INFO ] Flow matrix only has 151 transitions (discarded 20 similar events)
[2026-05-25 09:26:07] [INFO ] Invariant cache hit.
[2026-05-25 09:26:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:26:08] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-25 09:26:08] [INFO ] Redundant transitions in 20 ms returned [124, 125, 167, 168, 170]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 160 sub problems to find dead transitions.
[2026-05-25 09:26:08] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2472584348879214499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16531554272052669498.kers'
[2026-05-25 09:26:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2472584348879214499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16531554272052669498.kers]
Normalized transition count is 145 out of 146 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 37 cols 612 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:26:08] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16531554272052669498.kers
Total runtime 0 ms.
[2026-05-25 09:26:08] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 145/182 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/183 variables, and 83 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 145/182 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 160/243 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/183 variables, and 245 constraints, problems are : Problem set: 0 solved, 160 unsolved in 22933 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27997ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 27998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/153 places, 166/392 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 37 transition count 165
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 35 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 35 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 34 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 34 transition count 154
Applied a total of 14 rules in 20 ms. Remains 34 /37 variables (removed 3) and now considering 154/166 (removed 12) transitions.
[2026-05-25 09:26:36] [INFO ] Flow matrix only has 137 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5075969984019931268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5291639045661174138.kers'
[2026-05-25 09:26:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5075969984019931268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5291639045661174138.kers]
Normalized transition count is 136 out of 137 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 34 cols 584 entries
Finished phase 1 with 28 SingleSign rule and 1 generalized
[2026-05-25 09:26:36] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5291639045661174138.kers
Total runtime 2 ms.
[2026-05-25 09:26:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 09:26:36] [INFO ] Flow matrix only has 137 transitions (discarded 17 similar events)
[2026-05-25 09:26:36] [INFO ] Invariant cache hit.
[2026-05-25 09:26:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:26:36] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/153 places, 154/392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28418 ms. Remains : 34/153 places, 154/392 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 125 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 43 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 525 steps (131 resets) in 6 ms. (75 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 252 ms.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2026-05-25 09:26:36] [INFO ] Flow matrix only has 137 transitions (discarded 17 similar events)
[2026-05-25 09:26:36] [INFO ] Invariant cache hit.
[2026-05-25 09:26:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 09:26:36] [INFO ] Flow matrix only has 137 transitions (discarded 17 similar events)
[2026-05-25 09:26:36] [INFO ] Invariant cache hit.
[2026-05-25 09:26:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 09:26:37] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2026-05-25 09:26:37] [INFO ] Redundant transitions in 13 ms returned []
Running 148 sub problems to find dead transitions.
[2026-05-25 09:26:37] [INFO ] Flow matrix only has 137 transitions (discarded 17 similar events)
[2026-05-25 09:26:37] [INFO ] Invariant cache hit.
[2026-05-25 09:26:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 136/170 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 35/78 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/170 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/171 variables, and 78 constraints, problems are : Problem set: 0 solved, 148 unsolved in 3893 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 136/170 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 35/78 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 148/226 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/171 variables, and 227 constraints, problems are : Problem set: 0 solved, 148 unsolved in 8260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12190ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 12191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12330 ms. Remains : 34/34 places, 154/154 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 278 steps (74 resets) in 6 ms. (39 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 213 ms.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 42 ms.
Built C files in :
/tmp/ltsmin8027258212523943132
[2026-05-25 09:26:49] [INFO ] Computing symmetric may disable matrix : 154 transitions.
[2026-05-25 09:26:49] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:26:49] [INFO ] Computing symmetric may enable matrix : 154 transitions.
[2026-05-25 09:26:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:26:49] [INFO ] Computing Do-Not-Accords matrix : 154 transitions.
[2026-05-25 09:26:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:26:49] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8027258212523943132
Running compilation step : cd /tmp/ltsmin8027258212523943132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 343 ms.
Running link step : cd /tmp/ltsmin8027258212523943132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8027258212523943132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3048368095856048759.hoa' '--buchi-type=spotba'
LTSmin run took 82 ms.
FORMULA MedleyA-PT-15-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-15-LTLFireability-15 finished in 42547 ms.
All properties solved by simple procedures.
Total runtime 710863 ms.

BK_STOP 1779701210453

--------------------
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="MedleyA-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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