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-177969020000252.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 130K 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-20-LTLFireability-00
FORMULA_NAME MedleyA-PT-20-LTLFireability-01
FORMULA_NAME MedleyA-PT-20-LTLFireability-02
FORMULA_NAME MedleyA-PT-20-LTLFireability-03
FORMULA_NAME MedleyA-PT-20-LTLFireability-04
FORMULA_NAME MedleyA-PT-20-LTLFireability-05
FORMULA_NAME MedleyA-PT-20-LTLFireability-06
FORMULA_NAME MedleyA-PT-20-LTLFireability-07
FORMULA_NAME MedleyA-PT-20-LTLFireability-08
FORMULA_NAME MedleyA-PT-20-LTLFireability-09
FORMULA_NAME MedleyA-PT-20-LTLFireability-10
FORMULA_NAME MedleyA-PT-20-LTLFireability-11
FORMULA_NAME MedleyA-PT-20-LTLFireability-12
FORMULA_NAME MedleyA-PT-20-LTLFireability-13
FORMULA_NAME MedleyA-PT-20-LTLFireability-14
FORMULA_NAME MedleyA-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779701770526

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:36:11] [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:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:36:12] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-25 09:36:12] [INFO ] Transformed 273 places.
[2026-05-25 09:36:12] [INFO ] Transformed 518 transitions.
[2026-05-25 09:36:12] [INFO ] Found NUPN structural information;
[2026-05-25 09:36:12] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-20-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 93 place count 180 transition count 425
Iterating global reduction 0 with 93 rules applied. Total rules applied 186 place count 180 transition count 425
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 190 place count 180 transition count 421
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 221 place count 149 transition count 334
Iterating global reduction 1 with 31 rules applied. Total rules applied 252 place count 149 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 255 place count 149 transition count 331
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 264 place count 140 transition count 313
Iterating global reduction 2 with 9 rules applied. Total rules applied 273 place count 140 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 140 transition count 312
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 276 place count 138 transition count 306
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 138 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 280 place count 138 transition count 304
Applied a total of 280 rules in 65 ms. Remains 138 /273 variables (removed 135) and now considering 304/518 (removed 214) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10441286819006908304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6091291065398583903.kers'
[2026-05-25 09:36:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10441286819006908304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6091291065398583903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 138 cols 1085 entries
Finished phase 1 with 122 SingleSign rule and 5 generalized
[2026-05-25 09:36:12] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6091291065398583903.kers
Total runtime 2 ms.
[2026-05-25 09:36:12] [INFO ] Implicit Places using invariants in 414 ms returned []
[2026-05-25 09:36:12] [INFO ] Invariant cache hit.
[2026-05-25 09:36:13] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-25 09:36:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 304/442 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/442 variables, and 191 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 304/442 variables, 138/201 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 303/504 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 509 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 138/273 places, 304/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61029 ms. Remains : 138/273 places, 304/518 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2026-05-25 09:37:13] [INFO ] Invariant cache hit.
[2026-05-25 09:37:13] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 09:37:13] [INFO ] Invariant cache hit.
[2026-05-25 09:37:13] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 138/138 places, 304/304 transitions.
Support contains 42 out of 138 places after structural reductions.
[2026-05-25 09:37:13] [INFO ] Flatten gal took : 45 ms
[2026-05-25 09:37:13] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:37:13] [INFO ] Input system was already deterministic with 304 transitions.
Reduction of identical properties reduced properties to check from 36 to 34
RANDOM walk for 40000 steps (51 resets) in 1909 ms. (20 steps per ms) remains 11/34 properties
BEST_FIRST walk for 40002 steps (26 resets) in 277 ms. (143 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40002 steps (34 resets) in 129 ms. (307 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (41 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (35 resets) in 166 ms. (239 steps per ms) remains 1/4 properties
[2026-05-25 09:37:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/128 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/138 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 304/442 variables, 138/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/128 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/138 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 304/442 variables, 138/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/442 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 304/304 transitions.
Graph (trivial) has 104 edges and 138 vertex of which 17 / 138 are part of one of the 3 SCC in 19 ms
Free SCC test removed 14 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 277
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 276
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 123 transition count 271
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 14 place count 118 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 27 place count 105 transition count 246
Iterating global reduction 2 with 13 rules applied. Total rules applied 40 place count 105 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 45 place count 105 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 104 transition count 240
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 47 place count 104 transition count 237
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 53 place count 101 transition count 237
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 85 place count 85 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 85 transition count 220
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 93 place count 78 transition count 199
Iterating global reduction 5 with 7 rules applied. Total rules applied 100 place count 78 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 105 place count 78 transition count 194
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 119 place count 71 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 122 place count 71 transition count 204
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 123 place count 70 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 70 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 125 place count 70 transition count 200
Free-agglomeration rule applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 142 place count 70 transition count 183
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 159 place count 53 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 160 place count 52 transition count 182
Applied a total of 160 rules in 95 ms. Remains 52 /138 variables (removed 86) and now considering 182/304 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 52/138 places, 182/304 transitions.
RANDOM walk for 33366 steps (8 resets) in 488 ms. (68 steps per ms) remains 0/1 properties
Computed a total of 10 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p1) U p2)&&p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Graph (trivial) has 104 edges and 138 vertex of which 17 / 138 are part of one of the 3 SCC in 2 ms
Free SCC test removed 14 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 122 transition count 278
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 122 transition count 273
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 117 transition count 273
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 26 place count 105 transition count 249
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 105 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 42 place count 105 transition count 245
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 42 place count 105 transition count 242
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 102 transition count 242
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 76 place count 88 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 88 transition count 227
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 83 place count 82 transition count 209
Iterating global reduction 4 with 6 rules applied. Total rules applied 89 place count 82 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 94 place count 82 transition count 204
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 108 place count 75 transition count 217
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 112 place count 75 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 113 place count 74 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 74 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 115 place count 74 transition count 209
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 74 transition count 209
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 118 place count 72 transition count 207
Applied a total of 118 rules in 79 ms. Remains 72 /138 variables (removed 66) and now considering 207/304 (removed 97) transitions.
[2026-05-25 09:37:16] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4550142311479177412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6009943301783750270.kers'
[2026-05-25 09:37:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4550142311479177412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6009943301783750270.kers]
Normalized transition count is 197 out of 198 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 72 cols 796 entries
Finished phase 1 with 56 SingleSign rule and 5 generalized
[2026-05-25 09:37:16] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6009943301783750270.kers
Total runtime 1 ms.
[2026-05-25 09:37:16] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 09:37:16] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2026-05-25 09:37:16] [INFO ] Invariant cache hit.
[2026-05-25 09:37:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:37:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2026-05-25 09:37:16] [INFO ] Redundant transitions in 4 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 09:37:16] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2026-05-25 09:37:16] [INFO ] Invariant cache hit.
[2026-05-25 09:37:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 197/269 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 88 constraints, problems are : Problem set: 0 solved, 181 unsolved in 7958 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 197/269 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 181/269 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 271 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11872 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19935ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 19936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/138 places, 207/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20225 ms. Remains : 72/138 places, 207/304 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(((G(p1) U p2)&&p0))))'
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-00 finished in 20765 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 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Graph (trivial) has 108 edges and 138 vertex of which 17 / 138 are part of one of the 3 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 122 transition count 278
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 122 transition count 271
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 115 transition count 271
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 32 place count 101 transition count 243
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 101 transition count 243
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 52 place count 101 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 100 transition count 236
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 54 place count 100 transition count 233
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 60 place count 97 transition count 233
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 88 place count 83 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 83 transition count 218
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 96 place count 76 transition count 197
Iterating global reduction 5 with 7 rules applied. Total rules applied 103 place count 76 transition count 197
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 108 place count 76 transition count 192
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 122 place count 69 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 125 place count 69 transition count 202
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 126 place count 68 transition count 199
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 68 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 68 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 130 place count 66 transition count 196
Applied a total of 130 rules in 49 ms. Remains 66 /138 variables (removed 72) and now considering 196/304 (removed 108) transitions.
[2026-05-25 09:37:36] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8555748272468731374.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9030799052786854913.kers'
[2026-05-25 09:37:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8555748272468731374.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9030799052786854913.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 185 rows 65 cols 698 entries
Finished phase 1 with 50 SingleSign rule and 5 generalized
[2026-05-25 09:37:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9030799052786854913.kers
Total runtime 1 ms.
[2026-05-25 09:37:36] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:37:36] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
[2026-05-25 09:37:36] [INFO ] Invariant cache hit.
[2026-05-25 09:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:37:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2026-05-25 09:37:37] [INFO ] Redundant transitions in 4 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-25 09:37:37] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
[2026-05-25 09:37:37] [INFO ] Invariant cache hit.
[2026-05-25 09:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 3/66 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 185/251 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/252 variables, and 81 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8820 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 3/66 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 185/251 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 171/252 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/252 variables, and 256 constraints, problems are : Problem set: 0 solved, 171 unsolved in 15768 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24630ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 24631ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/138 places, 196/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24905 ms. Remains : 66/138 places, 196/304 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 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-01 finished in 25005 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)||G(p1))) U ((!p2&&X((X(p0)||G(p1))))||X(G((X(p0)||G(p1)))))))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 276
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 125 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 120 transition count 261
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 120 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 120 transition count 258
Applied a total of 41 rules in 4 ms. Remains 120 /138 variables (removed 18) and now considering 258/304 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9253277167372594108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10013653239216441321.kers'
[2026-05-25 09:38:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9253277167372594108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10013653239216441321.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 120 cols 903 entries
Finished phase 1 with 104 SingleSign rule and 5 generalized
[2026-05-25 09:38:01] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10013653239216441321.kers
Total runtime 1 ms.
[2026-05-25 09:38:01] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 09:38:01] [INFO ] Invariant cache hit.
[2026-05-25 09:38:02] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-25 09:38:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 258/378 variables, 120/149 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 152 constraints, problems are : Problem set: 0 solved, 257 unsolved in 21133 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 258/378 variables, 120/153 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 257/410 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 420 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 51193ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 51194ms
Starting structural reductions in LTL mode, iteration 1 : 120/138 places, 258/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51559 ms. Remains : 120/138 places, 258/304 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)||G(p1))) U (X(G((X(p0)||G(p1))))||(!p2&&X((X(p0)||G(p1)))))))'
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-04 finished in 52093 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)))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Graph (trivial) has 104 edges and 138 vertex of which 17 / 138 are part of one of the 3 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 122 transition count 278
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 122 transition count 273
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 14 place count 117 transition count 273
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 26 place count 105 transition count 249
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 105 transition count 249
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 44 place count 105 transition count 243
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 104 transition count 242
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 46 place count 104 transition count 239
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 52 place count 101 transition count 239
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 80 place count 87 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 87 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 87 place count 81 transition count 206
Iterating global reduction 5 with 6 rules applied. Total rules applied 93 place count 81 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 98 place count 81 transition count 201
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 110 place count 75 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 113 place count 75 transition count 208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 114 place count 74 transition count 205
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 74 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 116 place count 74 transition count 204
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 118 place count 72 transition count 202
Applied a total of 118 rules in 62 ms. Remains 72 /138 variables (removed 66) and now considering 202/304 (removed 102) transitions.
[2026-05-25 09:38:53] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11674633351909192500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9609551925495638624.kers'
[2026-05-25 09:38:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11674633351909192500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9609551925495638624.kers]
Normalized transition count is 192 out of 193 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 72 cols 774 entries
Finished phase 1 with 56 SingleSign rule and 5 generalized
[2026-05-25 09:38:53] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9609551925495638624.kers
Total runtime 5 ms.
[2026-05-25 09:38:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:38:54] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
[2026-05-25 09:38:54] [INFO ] Invariant cache hit.
[2026-05-25 09:38:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:38:54] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2026-05-25 09:38:54] [INFO ] Redundant transitions in 6 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-25 09:38:54] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
[2026-05-25 09:38:54] [INFO ] Invariant cache hit.
[2026-05-25 09:38:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 192/264 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 86 constraints, problems are : Problem set: 0 solved, 177 unsolved in 8456 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 192/264 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 177/263 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 266 constraints, problems are : Problem set: 0 solved, 177 unsolved in 14481 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22968ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 22969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/138 places, 202/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23213 ms. Remains : 72/138 places, 202/304 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)))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-05 finished in 23433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p0 U p1) U !p2)&&X(X((F(G(p2))&&p3))))))'
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 123 transition count 274
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 123 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 123 transition count 272
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 116 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 116 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 116 transition count 249
Applied a total of 50 rules in 8 ms. Remains 116 /138 variables (removed 22) and now considering 249/304 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14884162089621222763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12587794574812794837.kers'
[2026-05-25 09:39:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14884162089621222763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12587794574812794837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 116 cols 861 entries
Finished phase 1 with 100 SingleSign rule and 5 generalized
[2026-05-25 09:39:17] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12587794574812794837.kers
Total runtime 2 ms.
[2026-05-25 09:39:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:39:17] [INFO ] Invariant cache hit.
[2026-05-25 09:39:17] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2026-05-25 09:39:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 249/365 variables, 116/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 148 constraints, problems are : Problem set: 0 solved, 248 unsolved in 20974 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 248/401 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 409 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 51029ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 51030ms
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 249/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51340 ms. Remains : 116/138 places, 249/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p0 U p1) U !p2)&&X(X((F(G(p2))&&p3))))))'
Stuttering acceptance computed with spot in 667 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p1), p2, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND p2 (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-06
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-06 finished in 52067 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) U X((!p2&&F(!p3))))))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 278
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 125 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 119 transition count 259
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 119 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 119 transition count 256
Applied a total of 43 rules in 3 ms. Remains 119 /138 variables (removed 19) and now considering 256/304 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-903848077825845809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2666455726928399623.kers'
[2026-05-25 09:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-903848077825845809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2666455726928399623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 119 cols 887 entries
Finished phase 1 with 103 SingleSign rule and 5 generalized
[2026-05-25 09:40:09] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2666455726928399623.kers
Total runtime 1 ms.
[2026-05-25 09:40:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 09:40:09] [INFO ] Invariant cache hit.
[2026-05-25 09:40:09] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-25 09:40:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/375 variables, 119/146 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/375 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 152 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22621 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 256/375 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 255/411 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 416 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 52688ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 52688ms
Starting structural reductions in LTL mode, iteration 1 : 119/138 places, 256/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52901 ms. Remains : 119/138 places, 256/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U X((!p2&&F(!p3))))))'
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p0) p2 p3), (NOT p0), (OR p2 p3), (OR p2 p3), true, p3, (NOT p1)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-07
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-07 finished in 53451 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((X(p0)&&p1))||X(G(p2))||X(p1)))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 283
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 119 transition count 264
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 119 transition count 264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 119 transition count 260
Applied a total of 42 rules in 4 ms. Remains 119 /138 variables (removed 19) and now considering 260/304 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13888887955861453684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-759343925238035198.kers'
[2026-05-25 09:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13888887955861453684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-759343925238035198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 119 cols 913 entries
Finished phase 1 with 103 SingleSign rule and 5 generalized
[2026-05-25 09:41:02] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-759343925238035198.kers
Total runtime 2 ms.
[2026-05-25 09:41:02] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 09:41:02] [INFO ] Invariant cache hit.
[2026-05-25 09:41:03] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-25 09:41:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/379 variables, 119/148 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 151 constraints, problems are : Problem set: 0 solved, 259 unsolved in 23447 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 260/379 variables, 119/149 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 259/408 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 5/413 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 419 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 53497ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 53498ms
Starting structural reductions in LTL mode, iteration 1 : 119/138 places, 260/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53781 ms. Remains : 119/138 places, 260/304 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((X(p0)&&p1))||X(G(p2))||X(p1)))'
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 12 ms. Proved property starting from automaton with 7 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 17 ms.
FORMULA MedleyA-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLFireability-08 finished in 54369 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(F((p0&&F(p1)))))) U !p0) U X(X(X(!p2)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 123 transition count 274
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 123 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 123 transition count 272
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 116 transition count 253
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 116 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 116 transition count 249
Applied a total of 50 rules in 11 ms. Remains 116 /138 variables (removed 22) and now considering 249/304 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11389178845986995281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17123911243323913088.kers'
[2026-05-25 09:41:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11389178845986995281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17123911243323913088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 116 cols 861 entries
Finished phase 1 with 100 SingleSign rule and 5 generalized
[2026-05-25 09:41:57] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17123911243323913088.kers
Total runtime 2 ms.
[2026-05-25 09:41:57] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:41:57] [INFO ] Invariant cache hit.
[2026-05-25 09:41:57] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2026-05-25 09:41:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 249/365 variables, 116/145 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 148 constraints, problems are : Problem set: 0 solved, 248 unsolved in 19893 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 248/401 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 409 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 49973ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 49975ms
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 249/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50277 ms. Remains : 116/138 places, 249/304 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(F((p0&&F(p1)))))) U !p0) U X(X(X(!p2)))))'
Stuttering acceptance computed with spot in 1115 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p0 p2), (AND (NOT p0) p2), (AND p0 p2), p2, p2, (AND (NOT p1) p2 p0), (AND (NOT p0) p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), p0]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 21 states, 37 edges and 3 AP (stutter sensitive) to 16 states, 24 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (31 resets) in 360 ms. (110 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2026-05-25 09:42:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 249/365 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 249/365 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 9 ms.
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 16 states, 24 edges and 3 AP (stutter sensitive) to 16 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 967 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2 p0), (AND (NOT p0) p2), (AND p0 p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), p0]
Knowledge-based reduction took 2126 ms.
Stuttering acceptance computed with spot in 905 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2 p0), (AND (NOT p0) p2), (AND p0 p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), p0]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 249/249 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2026-05-25 09:42:51] [INFO ] Invariant cache hit.
[2026-05-25 09:42:52] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 09:42:52] [INFO ] Invariant cache hit.
[2026-05-25 09:42:52] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 116/116 places, 249/249 transitions.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 16 states, 24 edges and 3 AP (stutter sensitive) to 16 states, 24 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (18 resets) in 190 ms. (209 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 23336 steps (15 resets) in 13 ms. (1666 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 305 ms. Reduced automaton from 16 states, 24 edges and 3 AP (stutter sensitive) to 16 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1101 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2 p0), (AND (NOT p0) p2), (AND p0 p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), p0]
Knowledge-based reduction took 1579 ms.
Stuttering acceptance computed with spot in 1033 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2 p0), (AND (NOT p0) p2), (AND p0 p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), p0]
Stuttering acceptance computed with spot in 860 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2 p0), (AND (NOT p0) p2), (AND p0 p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND p0 p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), p0]
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Spot run failed in 172 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/ltsmin1248089096501633744
[2026-05-25 09:42:56] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1248089096501633744
Running compilation step : cd /tmp/ltsmin1248089096501633744;'/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 627 ms.
Running link step : cd /tmp/ltsmin1248089096501633744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin1248089096501633744;'/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/stateBased16919863309938792031.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA MedleyA-PT-20-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-20-LTLFireability-10 finished in 59790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(p1)&&X((!p2||X(!p3))))))))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 278
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 125 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 118 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 118 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 118 transition count 253
Applied a total of 46 rules in 4 ms. Remains 118 /138 variables (removed 20) and now considering 253/304 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2994827488868183438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17103259742063309327.kers'
[2026-05-25 09:42:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2994827488868183438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17103259742063309327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 118 cols 875 entries
Finished phase 1 with 102 SingleSign rule and 5 generalized
[2026-05-25 09:42:57] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17103259742063309327.kers
Total runtime 1 ms.
[2026-05-25 09:42:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:42:57] [INFO ] Invariant cache hit.
[2026-05-25 09:42:57] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 09:42:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 253/371 variables, 118/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 13 (OVERLAPS) 0/371 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 153 constraints, problems are : Problem set: 0 solved, 252 unsolved in 27990 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 253/371 variables, 118/155 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 252/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 5/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 419 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 58064ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 58066ms
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 253/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58377 ms. Remains : 118/138 places, 253/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(F(p1)&&X((X(p3)||p2))&&p0)))))'
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-11
Product exploration explored 100000 steps with 2 reset in 155 ms.
Product exploration explored 100000 steps with 4 reset in 162 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge based reduction with 12 factoid took 137 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (17 resets) in 213 ms. (186 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40001 steps (24 resets) in 67 ms. (588 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (21 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (25 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 40 ms. (975 steps per ms) remains 5/6 properties
[2026-05-25 09:43:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 73/80 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/109 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/118 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 253/371 variables, 118/129 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 129 constraints, problems are : Problem set: 1 solved, 4 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 74/80 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/109 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/118 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 253/371 variables, 118/129 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 4/133 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 2/135 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/371 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 135 constraints, problems are : Problem set: 1 solved, 4 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1149ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1082 steps, including 42 resets, run visited all 4 properties in 4 ms. (steps per millisecond=270 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 13 factoid took 228 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Knowledge-based reduction took 2010 ms.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 6 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 253/253 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2026-05-25 09:43:58] [INFO ] Invariant cache hit.
[2026-05-25 09:43:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:43:58] [INFO ] Invariant cache hit.
[2026-05-25 09:43:58] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 118/118 places, 253/253 transitions.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge based reduction with 6 factoid took 45 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (27 resets) in 237 ms. (168 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (30 resets) in 44 ms. (888 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (48 resets) in 50 ms. (784 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (42 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2026-05-25 09:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/80 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/109 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 253/371 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/80 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/109 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 253/371 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 6099 steps, including 267 resets, run visited all 2 properties in 37 ms. (steps per millisecond=164 )
Parikh walk visited 2 properties in 76 ms.
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Knowledge-based reduction took 1033 ms.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1 reset in 125 ms.
Product exploration explored 100000 steps with 5 reset in 189 ms.
Spot run failed in 101 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/ltsmin74419079700653297
[2026-05-25 09:44:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin74419079700653297
Running compilation step : cd /tmp/ltsmin74419079700653297;'/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 418 ms.
Running link step : cd /tmp/ltsmin74419079700653297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin74419079700653297;'/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/stateBased8513231347512113413.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 253/253 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 252
Applied a total of 2 rules in 2 ms. Remains 117 /118 variables (removed 1) and now considering 252/253 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8719497101229578559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14652242063646201897.kers'
[2026-05-25 09:44:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8719497101229578559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14652242063646201897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 117 cols 873 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-25 09:44:15] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14652242063646201897.kers
Total runtime 3 ms.
[2026-05-25 09:44:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:44:15] [INFO ] Invariant cache hit.
[2026-05-25 09:44:15] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 09:44:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 252/369 variables, 117/147 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 150 constraints, problems are : Problem set: 0 solved, 251 unsolved in 25529 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 252/369 variables, 117/148 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 251/399 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 412 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 55584ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 55584ms
Starting structural reductions in LTL mode, iteration 1 : 117/118 places, 252/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55820 ms. Remains : 117/118 places, 252/253 transitions.
Built C files in :
/tmp/ltsmin14933697636868429051
[2026-05-25 09:45:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14933697636868429051
Running compilation step : cd /tmp/ltsmin14933697636868429051;'/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 369 ms.
Running link step : cd /tmp/ltsmin14933697636868429051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14933697636868429051;'/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/stateBased15206580861656656542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:45:26] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:45:26] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:45:26] [INFO ] Time to serialize gal into /tmp/LTL673788932271531796.gal : 4 ms
[2026-05-25 09:45:26] [INFO ] Time to serialize properties into /tmp/LTL1398250280328429440.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL673788932271531796.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7055093738775353188.hoa' '-atoms' '/tmp/LTL1398250280328429440.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1398250280328429440.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7055093738775353188.hoa
Detected timeout of ITS tools.
[2026-05-25 09:45:41] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:45:41] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:45:41] [INFO ] Time to serialize gal into /tmp/LTL16780897020139621626.gal : 3 ms
[2026-05-25 09:45:41] [INFO ] Time to serialize properties into /tmp/LTL5212538685241486894.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16780897020139621626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5212538685241486894.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p127!=1)||(p245!=1))"))||(((F("(p244!=1)"))&&(X(("((p10!=1)||(p252!=1))")||(X("((p24!=1)||(p57!=1))")))))&&("((p127!=1)||...172
Formula 0 simplified : G(F!"((p127!=1)||(p245!=1))" & F(G!"(p244!=1)" | G(!"((p127!=1)||(p245!=1))" | X(!"((p10!=1)||(p252!=1))" & X!"((p24!=1)||(p57!=1))"...159
Detected timeout of ITS tools.
[2026-05-25 09:45:56] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:45:56] [INFO ] Applying decomposition
[2026-05-25 09:45:56] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10886201481457585848.txt' '-o' '/tmp/graph10886201481457585848.bin' '-w' '/tmp/graph10886201481457585848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10886201481457585848.bin' '-l' '-1' '-v' '-w' '/tmp/graph10886201481457585848.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:45:56] [INFO ] Decomposing Gal with order
[2026-05-25 09:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:45:56] [INFO ] Removed a total of 368 redundant transitions.
[2026-05-25 09:45:56] [INFO ] Flatten gal took : 116 ms
[2026-05-25 09:45:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-25 09:45:56] [INFO ] Time to serialize gal into /tmp/LTL6928229375765048498.gal : 3 ms
[2026-05-25 09:45:56] [INFO ] Time to serialize properties into /tmp/LTL15836767114911527915.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6928229375765048498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15836767114911527915.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i5.u12.p127!=1)||(i7.u26.p245!=1))"))||(((F("(i7.u26.p244!=1)"))&&(X(("((i1.u1.p10!=1)||(i8.u27.p252!=1))")||(X("((u5.p24...230
Formula 0 simplified : G(F!"((i5.u12.p127!=1)||(i7.u26.p245!=1))" & F(G!"(i7.u26.p244!=1)" | G(!"((i5.u12.p127!=1)||(i7.u26.p245!=1))" | X(!"((i1.u1.p10!=1...217
Reverse transition relation is NOT exact ! Due to transitions t1, t19, t49, t109, t110, t112, t122, t161, t186, t193, t194, t195, t196, t197, t198, t200, t...665
Computing Next relation with stutter on 30816 deadlock states
26 unique states visited
26 strongly connected components in search stack
27 transitions explored
26 items max in DFS search stack
176 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.79729,64556,1,0,85820,916,3095,157491,388,3106,273192
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-20-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-20-LTLFireability-11 finished in 181930 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(G(p0))&&(p1 U (X(X(!p3))&&p2)))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 125 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 121 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 121 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 121 transition count 265
Applied a total of 37 rules in 2 ms. Remains 121 /138 variables (removed 17) and now considering 265/304 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11194819322940331930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5182553051025457802.kers'
[2026-05-25 09:45:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11194819322940331930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5182553051025457802.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 121 cols 923 entries
Finished phase 1 with 105 SingleSign rule and 5 generalized
[2026-05-25 09:45:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5182553051025457802.kers
Total runtime 2 ms.
[2026-05-25 09:45:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 09:45:59] [INFO ] Invariant cache hit.
[2026-05-25 09:45:59] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-25 09:45:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 265/386 variables, 121/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 163 constraints, problems are : Problem set: 0 solved, 264 unsolved in 27177 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 265/386 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 264/425 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 431 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 57230ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 57231ms
Starting structural reductions in LTL mode, iteration 1 : 121/138 places, 265/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57534 ms. Remains : 121/138 places, 265/304 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(G(p0))&&(p1 U (X(X(!p3))&&p2)))))'
Stuttering acceptance computed with spot in 561 ms :[(OR (NOT p0) (NOT p2) p3), (OR (NOT p0) (NOT p2) p3), true, (NOT p0), p3, (OR (NOT p2) p3), p3, p3, p3, p3, p3]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-12 finished in 58137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&((p1 U X((p2&&X(p1))))||X(X(p1))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 124 transition count 275
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 124 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 124 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 117 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 117 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 117 transition count 250
Applied a total of 48 rules in 3 ms. Remains 117 /138 variables (removed 21) and now considering 250/304 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10254770537184175264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1383812569215456526.kers'
[2026-05-25 09:46:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10254770537184175264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1383812569215456526.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 117 cols 863 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-25 09:46:57] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1383812569215456526.kers
Total runtime 1 ms.
[2026-05-25 09:46:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:46:57] [INFO ] Invariant cache hit.
[2026-05-25 09:46:57] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-25 09:46:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 250/367 variables, 117/143 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 146 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22942 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 250/367 variables, 117/149 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 249/398 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 405 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 53000ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 53000ms
Starting structural reductions in LTL mode, iteration 1 : 117/138 places, 250/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53219 ms. Remains : 117/138 places, 250/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&((p1 U X((p2&&X(p1))))||X(X(p1))))))'
Stuttering acceptance computed with spot in 476 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-13
Entered a terminal (fully accepting) state of product in 24 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-13 finished in 53752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1&&X(p2))))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 304/304 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 124 transition count 277
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 124 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 124 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 117 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 117 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 117 transition count 252
Applied a total of 48 rules in 7 ms. Remains 117 /138 variables (removed 21) and now considering 252/304 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3906955130178233462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7605086958164068068.kers'
[2026-05-25 09:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3906955130178233462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7605086958164068068.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 117 cols 879 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-25 09:47:50] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7605086958164068068.kers
Total runtime 1 ms.
[2026-05-25 09:47:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 09:47:50] [INFO ] Invariant cache hit.
[2026-05-25 09:47:51] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 09:47:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 252/369 variables, 117/147 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 151 constraints, problems are : Problem set: 0 solved, 251 unsolved in 28847 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 252/369 variables, 117/156 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 251/407 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 414 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 58907ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 58907ms
Starting structural reductions in LTL mode, iteration 1 : 117/138 places, 252/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59168 ms. Remains : 117/138 places, 252/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&X(p1)))||p2)))'
Stuttering acceptance computed with spot in 124 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 2 reset in 169 ms.
Entered a terminal (fully accepting) state of product in 61 steps with 2 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-14 finished in 59502 ms.
All properties solved by simple procedures.
Total runtime 758468 ms.

BK_STOP 1779702530361

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-20"
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-20, 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-177969020000252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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