fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r178-oct2-177969020100324
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for MedleyB-PT-B06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3906.323 771986.00 1003156.00 429.70 FFFFFFFFTFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 7 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 7 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 MedleyB-PT-B06-LTLFireability-00
FORMULA_NAME MedleyB-PT-B06-LTLFireability-01
FORMULA_NAME MedleyB-PT-B06-LTLFireability-02
FORMULA_NAME MedleyB-PT-B06-LTLFireability-03
FORMULA_NAME MedleyB-PT-B06-LTLFireability-04
FORMULA_NAME MedleyB-PT-B06-LTLFireability-05
FORMULA_NAME MedleyB-PT-B06-LTLFireability-06
FORMULA_NAME MedleyB-PT-B06-LTLFireability-07
FORMULA_NAME MedleyB-PT-B06-LTLFireability-08
FORMULA_NAME MedleyB-PT-B06-LTLFireability-09
FORMULA_NAME MedleyB-PT-B06-LTLFireability-10
FORMULA_NAME MedleyB-PT-B06-LTLFireability-11
FORMULA_NAME MedleyB-PT-B06-LTLFireability-12
FORMULA_NAME MedleyB-PT-B06-LTLFireability-13
FORMULA_NAME MedleyB-PT-B06-LTLFireability-14
FORMULA_NAME MedleyB-PT-B06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779706667462

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:57:49] [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 10:57:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:57:49] [INFO ] Load time of PNML (sax parser for PT used): 428 ms
[2026-05-25 10:57:49] [INFO ] Transformed 964 places.
[2026-05-25 10:57:49] [INFO ] Transformed 5535 transitions.
[2026-05-25 10:57:49] [INFO ] Found NUPN structural information;
[2026-05-25 10:57:49] [INFO ] Parsed PT model containing 964 places and 5535 transitions and 65185 arcs in 647 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyB-PT-B06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 5535/5535 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 843 transition count 5414
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 843 transition count 5414
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 307 place count 778 transition count 5349
Iterating global reduction 0 with 65 rules applied. Total rules applied 372 place count 778 transition count 5349
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 385 place count 765 transition count 5336
Iterating global reduction 0 with 13 rules applied. Total rules applied 398 place count 765 transition count 5336
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 405 place count 758 transition count 5329
Iterating global reduction 0 with 7 rules applied. Total rules applied 412 place count 758 transition count 5329
Applied a total of 412 rules in 475 ms. Remains 758 /964 variables (removed 206) and now considering 5329/5535 (removed 206) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2044079330216750175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15611293583772359641.kers'
[2026-05-25 10:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2044079330216750175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15611293583772359641.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 5329 rows 758 cols 64773 entries
Finished phase 1 with 750 SingleSign rule and 0 generalized
[2026-05-25 10:57:50] [INFO ] Computed 8 invariants in 35 ms
Computed 8 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-15611293583772359641.kers
Total runtime 44 ms.
[2026-05-25 10:57:51] [INFO ] Implicit Places using invariants in 533 ms returned []
[2026-05-25 10:57:51] [INFO ] Invariant cache hit.
[2026-05-25 10:57:53] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
Running 5328 sub problems to find dead transitions.
[2026-05-25 10:57:53] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/6087 variables, and 0 constraints, problems are : Problem set: 0 solved, 5328 unsolved in 30135 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 5328/912 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/6087 variables, and 0 constraints, problems are : Problem set: 0 solved, 5328 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 4416/912 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69001ms problems are : Problem set: 0 solved, 5328 unsolved
Search for dead transitions found 0 dead transitions in 69063ms
Starting structural reductions in LTL mode, iteration 1 : 758/964 places, 5329/5535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72167 ms. Remains : 758/964 places, 5329/5535 transitions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Applied a total of 0 rules in 45 ms. Remains 758 /758 variables (removed 0) and now considering 5329/5329 (removed 0) transitions.
[2026-05-25 10:59:02] [INFO ] Invariant cache hit.
[2026-05-25 10:59:02] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-25 10:59:02] [INFO ] Invariant cache hit.
[2026-05-25 10:59:04] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2182 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2230 ms. Remains : 758/758 places, 5329/5329 transitions.
Support contains 58 out of 758 places after structural reductions.
[2026-05-25 10:59:05] [INFO ] Flatten gal took : 688 ms
[2026-05-25 10:59:05] [INFO ] Flatten gal took : 262 ms
[2026-05-25 10:59:06] [INFO ] Input system was already deterministic with 5329 transitions.
Reduction of identical properties reduced properties to check from 33 to 30
RANDOM walk for 40000 steps (326 resets) in 1441 ms. (27 steps per ms) remains 25/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
[2026-05-25 10:59:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 703/758 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/758 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 5329/6087 variables, 758/766 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6087/6087 variables, and 766 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 758/758 constraints, PredecessorRefiner: 25/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 705/758 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/758 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 5329/6087 variables, 758/766 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6087 variables, 3/769 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6087/6087 variables, and 769 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 758/758 constraints, PredecessorRefiner: 24/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10182ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Graph (trivial) has 698 edges and 758 vertex of which 112 / 758 are part of one of the 21 SCC in 18 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 1761 edges and 667 vertex of which 660 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.45 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 413 rules applied. Total rules applied 415 place count 660 transition count 4790
Reduce places removed 406 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 418 rules applied. Total rules applied 833 place count 254 transition count 4778
Reduce places removed 6 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 30 rules applied. Total rules applied 863 place count 248 transition count 4754
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 887 place count 224 transition count 4754
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 887 place count 224 transition count 4722
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 951 place count 192 transition count 4722
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1021 place count 157 transition count 4687
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1034 place count 157 transition count 4674
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1047 place count 144 transition count 4661
Iterating global reduction 5 with 13 rules applied. Total rules applied 1060 place count 144 transition count 4661
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1064 place count 140 transition count 4653
Iterating global reduction 5 with 4 rules applied. Total rules applied 1068 place count 140 transition count 4653
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1082 place count 133 transition count 4646
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1090 place count 129 transition count 4654
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1099 place count 129 transition count 4645
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1101 place count 128 transition count 4651
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1109 place count 128 transition count 4643
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1111 place count 127 transition count 4649
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1119 place count 127 transition count 4641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 126 transition count 4647
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1129 place count 126 transition count 4639
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1149 place count 126 transition count 4619
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1169 place count 106 transition count 4619
Applied a total of 1169 rules in 1373 ms. Remains 106 /758 variables (removed 652) and now considering 4619/5329 (removed 710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1373 ms. Remains : 106/758 places, 4619/5329 transitions.
RANDOM walk for 40000 steps (2898 resets) in 1555 ms. (25 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 72 ms. (54 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (25 resets) in 9 ms. (400 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12984975151932301563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17872789400057327314.kers'
[2026-05-25 10:59:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12984975151932301563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17872789400057327314.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 4619 rows 106 cols 62956 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 10:59:19] [INFO ] Computed 8 invariants in 24 ms
Computed 8 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-17872789400057327314.kers
Total runtime 35 ms.
[2026-05-25 10:59:19] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 62/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/106 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 4619/4725 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4725 variables, 130/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4725 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/4725 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4725/4725 variables, and 244 constraints, problems are : Problem set: 0 solved, 21 unsolved in 11713 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 21/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 62/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/106 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 4619/4725 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4725 variables, 130/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4725 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4725 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/4725 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4725/4725 variables, and 246 constraints, problems are : Problem set: 0 solved, 21 unsolved in 16458 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 21/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28509ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 20 properties in 853 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 4619/4619 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 106 transition count 4596
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 4596
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 46 place count 83 transition count 4592
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 79 transition count 4592
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 79 transition count 4591
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 70 place count 64 transition count 471
Iterating global reduction 3 with 15 rules applied. Total rules applied 85 place count 64 transition count 471
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 99 place count 64 transition count 457
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 63 transition count 456
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 62 transition count 454
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 62 transition count 454
Free-agglomeration rule applied 36 times.
Iterating global reduction 4 with 36 rules applied. Total rules applied 139 place count 62 transition count 418
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 4 with 110 rules applied. Total rules applied 249 place count 26 transition count 344
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 256 place count 19 transition count 337
Iterating global reduction 5 with 7 rules applied. Total rules applied 263 place count 19 transition count 337
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 5 with 127 rules applied. Total rules applied 390 place count 19 transition count 210
Applied a total of 390 rules in 507 ms. Remains 19 /106 variables (removed 87) and now considering 210/4619 (removed 4409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 19/106 places, 210/4619 transitions.
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA MedleyB-PT-B06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 105 stabilizing places and 112 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 18 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Graph (trivial) has 760 edges and 758 vertex of which 112 / 758 are part of one of the 21 SCC in 3 ms
Free SCC test removed 91 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 443 place count 666 transition count 4781
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 456 rules applied. Total rules applied 899 place count 224 transition count 4767
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 906 place count 217 transition count 4767
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 906 place count 217 transition count 4738
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 964 place count 188 transition count 4738
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 970 place count 182 transition count 4732
Iterating global reduction 3 with 6 rules applied. Total rules applied 976 place count 182 transition count 4732
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1042 place count 149 transition count 4699
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1059 place count 132 transition count 2734
Iterating global reduction 3 with 17 rules applied. Total rules applied 1076 place count 132 transition count 2734
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1079 place count 132 transition count 2731
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1086 place count 125 transition count 2717
Iterating global reduction 4 with 7 rules applied. Total rules applied 1093 place count 125 transition count 2717
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1100 place count 118 transition count 2703
Iterating global reduction 4 with 7 rules applied. Total rules applied 1107 place count 118 transition count 2703
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1129 place count 107 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1130 place count 106 transition count 2696
Iterating global reduction 4 with 1 rules applied. Total rules applied 1131 place count 106 transition count 2696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1132 place count 106 transition count 2695
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1139 place count 106 transition count 2688
Applied a total of 1139 rules in 1026 ms. Remains 106 /758 variables (removed 652) and now considering 2688/5329 (removed 2641) transitions.
[2026-05-25 10:59:51] [INFO ] Flow matrix only has 2680 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1165981760341765131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7016333935020403413.kers'
[2026-05-25 10:59:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1165981760341765131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7016333935020403413.kers]
Normalized transition count is 2679 out of 2680 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2679 rows 105 cols 35262 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-25 10:59:51] [INFO ] Computed 2 invariants in 29 ms
Computed 2 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-7016333935020403413.kers
Total runtime 33 ms.
[2026-05-25 10:59:51] [INFO ] Implicit Places using invariants in 698 ms returned []
[2026-05-25 10:59:51] [INFO ] Flow matrix only has 2680 transitions (discarded 8 similar events)
[2026-05-25 10:59:51] [INFO ] Invariant cache hit.
[2026-05-25 10:59:52] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 10:59:54] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 2999 ms to find 0 implicit places.
[2026-05-25 10:59:54] [INFO ] Redundant transitions in 257 ms returned []
Running 2671 sub problems to find dead transitions.
[2026-05-25 10:59:54] [INFO ] Flow matrix only has 2680 transitions (discarded 8 similar events)
[2026-05-25 10:59:54] [INFO ] Invariant cache hit.
[2026-05-25 10:59:54] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/2786 variables, and 1 constraints, problems are : Problem set: 0 solved, 2671 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/106 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2671/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2671 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/2786 variables, and 8 constraints, problems are : Problem set: 0 solved, 2671 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/106 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2610/61 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64034ms problems are : Problem set: 0 solved, 2671 unsolved
Search for dead transitions found 0 dead transitions in 64042ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/758 places, 2688/5329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68344 ms. Remains : 106/758 places, 2688/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 3 ms.
FORMULA MedleyB-PT-B06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-00 finished in 68921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(X((X(p1)&&p0)))||G(p2)))))))'
Support contains 14 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 97 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15759175437910685679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3019079088024178641.kers'
[2026-05-25 11:00:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15759175437910685679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3019079088024178641.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 5327 rows 756 cols 64769 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 11:00:59] [INFO ] Computed 8 invariants in 42 ms
Computed 8 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-3019079088024178641.kers
Total runtime 65 ms.
[2026-05-25 11:01:00] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2026-05-25 11:01:00] [INFO ] Invariant cache hit.
[2026-05-25 11:01:03] [INFO ] Implicit Places using invariants and state equation in 3102 ms returned []
Implicit Place search using SMT with State Equation took 4301 ms to find 0 implicit places.
Running 5326 sub problems to find dead transitions.
[2026-05-25 11:01:03] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 5326/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30132 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 4416/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69363ms problems are : Problem set: 0 solved, 5326 unsolved
Search for dead transitions found 0 dead transitions in 69395ms
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73830 ms. Remains : 756/758 places, 5327/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(X((X(p1)&&p0)))||G(p2)))))))'
Stuttering acceptance computed with spot in 847 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-01 finished in 74778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p1))))&&p0)))'
Support contains 7 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 110 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
[2026-05-25 11:02:13] [INFO ] Invariant cache hit.
[2026-05-25 11:02:15] [INFO ] Implicit Places using invariants in 1374 ms returned []
[2026-05-25 11:02:15] [INFO ] Invariant cache hit.
[2026-05-25 11:02:18] [INFO ] Implicit Places using invariants and state equation in 3204 ms returned []
Implicit Place search using SMT with State Equation took 4592 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4705 ms. Remains : 756/758 places, 5327/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p1))))&&p0)))'
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-02 finished in 5127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&(p2 U (G(p2)||(p2&&G(!p3))))))'
Support contains 12 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 106 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
[2026-05-25 11:02:18] [INFO ] Invariant cache hit.
[2026-05-25 11:02:20] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2026-05-25 11:02:20] [INFO ] Invariant cache hit.
[2026-05-25 11:02:22] [INFO ] Implicit Places using invariants and state equation in 2720 ms returned []
Implicit Place search using SMT with State Equation took 4019 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4126 ms. Remains : 756/758 places, 5327/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&(p2 U (G(p2)||(p2&&G(!p3))))))'
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p2) p3), p3]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-03 finished in 4431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Graph (trivial) has 771 edges and 758 vertex of which 112 / 758 are part of one of the 21 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 453 rules applied. Total rules applied 454 place count 666 transition count 4770
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 467 rules applied. Total rules applied 921 place count 213 transition count 4756
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 928 place count 206 transition count 4756
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 928 place count 206 transition count 4727
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 986 place count 177 transition count 4727
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 992 place count 171 transition count 4721
Iterating global reduction 3 with 6 rules applied. Total rules applied 998 place count 171 transition count 4721
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1064 place count 138 transition count 4688
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1088 place count 114 transition count 1069
Iterating global reduction 3 with 24 rules applied. Total rules applied 1112 place count 114 transition count 1069
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1122 place count 114 transition count 1059
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1129 place count 107 transition count 1045
Iterating global reduction 4 with 7 rules applied. Total rules applied 1136 place count 107 transition count 1045
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1143 place count 100 transition count 1031
Iterating global reduction 4 with 7 rules applied. Total rules applied 1150 place count 100 transition count 1031
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1172 place count 89 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1173 place count 88 transition count 1024
Iterating global reduction 4 with 1 rules applied. Total rules applied 1174 place count 88 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1175 place count 88 transition count 1023
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1182 place count 88 transition count 1016
Applied a total of 1182 rules in 390 ms. Remains 88 /758 variables (removed 670) and now considering 1016/5329 (removed 4313) transitions.
[2026-05-25 11:02:23] [INFO ] Flow matrix only has 1008 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11982456832877525708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14238015644719717825.kers'
[2026-05-25 11:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11982456832877525708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14238015644719717825.kers]
Normalized transition count is 1007 out of 1008 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1007 rows 87 cols 12070 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 11:02:23] [INFO ] Computed 2 invariants in 17 ms
Computed 2 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-14238015644719717825.kers
Total runtime 20 ms.
[2026-05-25 11:02:23] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-25 11:02:23] [INFO ] Flow matrix only has 1008 transitions (discarded 8 similar events)
[2026-05-25 11:02:23] [INFO ] Invariant cache hit.
[2026-05-25 11:02:24] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:02:24] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2026-05-25 11:02:24] [INFO ] Redundant transitions in 45 ms returned []
Running 999 sub problems to find dead transitions.
[2026-05-25 11:02:24] [INFO ] Flow matrix only has 1008 transitions (discarded 8 similar events)
[2026-05-25 11:02:24] [INFO ] Invariant cache hit.
[2026-05-25 11:02:24] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1096 variables, and 22 constraints, problems are : Problem set: 0 solved, 999 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/88 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 999/182 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 999 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 5 (OVERLAPS) 1007/1095 variables, 88/110 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1095 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1095 variables, 182/418 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1096 variables, and 418 constraints, problems are : Problem set: 0 solved, 999 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 999/182 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61434ms problems are : Problem set: 0 solved, 999 unsolved
Search for dead transitions found 0 dead transitions in 61438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/758 places, 1016/5329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62889 ms. Remains : 88/758 places, 1016/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-05 finished in 63080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U (p1||X(X(X((p2 U p3)))))))))'
Support contains 22 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 149 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12538305799368925762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10516705409524321564.kers'
[2026-05-25 11:03:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12538305799368925762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10516705409524321564.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 5327 rows 756 cols 64769 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 11:03:26] [INFO ] Computed 8 invariants in 80 ms
Computed 8 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-10516705409524321564.kers
Total runtime 88 ms.
[2026-05-25 11:03:27] [INFO ] Implicit Places using invariants in 965 ms returned []
[2026-05-25 11:03:27] [INFO ] Invariant cache hit.
[2026-05-25 11:03:29] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 3443 ms to find 0 implicit places.
Running 5326 sub problems to find dead transitions.
[2026-05-25 11:03:30] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 5326/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 4416/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69233ms problems are : Problem set: 0 solved, 5326 unsolved
Search for dead transitions found 0 dead transitions in 69264ms
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72887 ms. Remains : 756/758 places, 5327/5329 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((F(p0) U (X(X(X((p1 U p2))))||p3)))))'
Stuttering acceptance computed with spot in 645 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-06
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-06 finished in 73685 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)&&(G(p1)||X(X(F(p2)))))))'
Support contains 15 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 92 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
[2026-05-25 11:04:40] [INFO ] Invariant cache hit.
[2026-05-25 11:04:41] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2026-05-25 11:04:41] [INFO ] Invariant cache hit.
[2026-05-25 11:04:43] [INFO ] Implicit Places using invariants and state equation in 2540 ms returned []
Implicit Place search using SMT with State Equation took 3591 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3685 ms. Remains : 756/758 places, 5327/5329 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)&&(G(p1)||X(X(F(p2)))))))'
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-07
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 3 ms.
FORMULA MedleyB-PT-B06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-07 finished in 4120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||((p1 U p2) U X(G(!p2))))))'
Support contains 3 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 5328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 5328
Applied a total of 2 rules in 106 ms. Remains 757 /758 variables (removed 1) and now considering 5328/5329 (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-15993979706060450086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9158355199768924962.kers'
[2026-05-25 11:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15993979706060450086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9158355199768924962.kers]
Culled 0 columns in 20 ms.
// Phase 1: matrix 5328 rows 757 cols 64771 entries
Finished phase 1 with 749 SingleSign rule and 0 generalized
[2026-05-25 11:04:44] [INFO ] Computed 8 invariants in 82 ms
Computed 8 P flows in 83 ms.
Exported basis to /tmp/petrispot-output-9158355199768924962.kers
Total runtime 94 ms.
[2026-05-25 11:04:45] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2026-05-25 11:04:45] [INFO ] Invariant cache hit.
[2026-05-25 11:04:49] [INFO ] Implicit Places using invariants and state equation in 3421 ms returned []
Implicit Place search using SMT with State Equation took 5111 ms to find 0 implicit places.
Running 5327 sub problems to find dead transitions.
[2026-05-25 11:04:49] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 756/6085 variables, and 0 constraints, problems are : Problem set: 0 solved, 5327 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/757 constraints, PredecessorRefiner: 5327/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/6085 variables, and 0 constraints, problems are : Problem set: 0 solved, 5327 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/757 constraints, PredecessorRefiner: 4416/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67943ms problems are : Problem set: 0 solved, 5327 unsolved
Search for dead transitions found 0 dead transitions in 67959ms
Starting structural reductions in LTL mode, iteration 1 : 757/758 places, 5328/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73191 ms. Remains : 757/758 places, 5328/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||((p1 U p2) U X(G(!p2))))))'
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, true]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2785 steps with 22 reset in 34 ms.
FORMULA MedleyB-PT-B06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-10 finished in 73547 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((G(p0)&&X(G(p1))))))'
Support contains 19 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 96 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11409190087965225951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5861216064747962658.kers'
[2026-05-25 11:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11409190087965225951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5861216064747962658.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 5327 rows 756 cols 64769 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 11:05:57] [INFO ] Computed 8 invariants in 89 ms
Computed 8 P flows in 90 ms.
Exported basis to /tmp/petrispot-output-5861216064747962658.kers
Total runtime 109 ms.
[2026-05-25 11:05:58] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2026-05-25 11:05:58] [INFO ] Invariant cache hit.
[2026-05-25 11:06:02] [INFO ] Implicit Places using invariants and state equation in 3165 ms returned []
Implicit Place search using SMT with State Equation took 4363 ms to find 0 implicit places.
Running 5326 sub problems to find dead transitions.
[2026-05-25 11:06:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 5326/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 4416/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67903ms problems are : Problem set: 0 solved, 5326 unsolved
Search for dead transitions found 0 dead transitions in 67930ms
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72416 ms. Remains : 756/758 places, 5327/5329 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((G(p0)&&X(G(p1))))))'
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-12 finished in 72614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Graph (trivial) has 771 edges and 758 vertex of which 112 / 758 are part of one of the 21 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 453 rules applied. Total rules applied 454 place count 666 transition count 4770
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 467 rules applied. Total rules applied 921 place count 213 transition count 4756
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 928 place count 206 transition count 4756
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 928 place count 206 transition count 4727
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 986 place count 177 transition count 4727
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 992 place count 171 transition count 4721
Iterating global reduction 3 with 6 rules applied. Total rules applied 998 place count 171 transition count 4721
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1064 place count 138 transition count 4688
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1088 place count 114 transition count 1069
Iterating global reduction 3 with 24 rules applied. Total rules applied 1112 place count 114 transition count 1069
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1122 place count 114 transition count 1059
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1129 place count 107 transition count 1045
Iterating global reduction 4 with 7 rules applied. Total rules applied 1136 place count 107 transition count 1045
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1143 place count 100 transition count 1031
Iterating global reduction 4 with 7 rules applied. Total rules applied 1150 place count 100 transition count 1031
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1172 place count 89 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1173 place count 88 transition count 1024
Iterating global reduction 4 with 1 rules applied. Total rules applied 1174 place count 88 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1175 place count 88 transition count 1023
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1182 place count 88 transition count 1016
Applied a total of 1182 rules in 416 ms. Remains 88 /758 variables (removed 670) and now considering 1016/5329 (removed 4313) transitions.
[2026-05-25 11:07:10] [INFO ] Flow matrix only has 1008 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12667024746431291571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1636675766016802347.kers'
[2026-05-25 11:07:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12667024746431291571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1636675766016802347.kers]
Normalized transition count is 1007 out of 1008 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1007 rows 87 cols 12070 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 11:07:10] [INFO ] Computed 2 invariants in 16 ms
Computed 2 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1636675766016802347.kers
Total runtime 20 ms.
[2026-05-25 11:07:11] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-25 11:07:11] [INFO ] Flow matrix only has 1008 transitions (discarded 8 similar events)
[2026-05-25 11:07:11] [INFO ] Invariant cache hit.
[2026-05-25 11:07:11] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:07:11] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2026-05-25 11:07:12] [INFO ] Redundant transitions in 37 ms returned []
Running 999 sub problems to find dead transitions.
[2026-05-25 11:07:12] [INFO ] Flow matrix only has 1008 transitions (discarded 8 similar events)
[2026-05-25 11:07:12] [INFO ] Invariant cache hit.
[2026-05-25 11:07:12] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1096 variables, and 18 constraints, problems are : Problem set: 0 solved, 999 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/88 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 999/182 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 999 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 5 (OVERLAPS) 1007/1095 variables, 88/106 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1095 variables, 126/232 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1095 variables, 182/414 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1096 variables, and 414 constraints, problems are : Problem set: 0 solved, 999 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 999/182 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61360ms problems are : Problem set: 0 solved, 999 unsolved
Search for dead transitions found 0 dead transitions in 61362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/758 places, 1016/5329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63136 ms. Remains : 88/758 places, 1016/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-13
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-13 finished in 63247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(F(G(((p0 U p2) U p3)))&&p1))))'
Support contains 15 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 5328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 5328
Applied a total of 2 rules in 89 ms. Remains 757 /758 variables (removed 1) and now considering 5328/5329 (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-10616706709764947844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-779241130689885663.kers'
[2026-05-25 11:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10616706709764947844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-779241130689885663.kers]
Culled 0 columns in 13 ms.
// Phase 1: matrix 5328 rows 757 cols 64771 entries
Finished phase 1 with 749 SingleSign rule and 0 generalized
[2026-05-25 11:08:13] [INFO ] Computed 8 invariants in 67 ms
Computed 8 P flows in 68 ms.
Exported basis to /tmp/petrispot-output-779241130689885663.kers
Total runtime 89 ms.
[2026-05-25 11:08:14] [INFO ] Implicit Places using invariants in 1177 ms returned []
[2026-05-25 11:08:14] [INFO ] Invariant cache hit.
[2026-05-25 11:08:17] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3836 ms to find 0 implicit places.
Running 5327 sub problems to find dead transitions.
[2026-05-25 11:08:17] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 756/6085 variables, and 0 constraints, problems are : Problem set: 0 solved, 5327 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/757 constraints, PredecessorRefiner: 5327/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/6085 variables, and 0 constraints, problems are : Problem set: 0 solved, 5327 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/757 constraints, PredecessorRefiner: 4416/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68084ms problems are : Problem set: 0 solved, 5327 unsolved
Search for dead transitions found 0 dead transitions in 68111ms
Starting structural reductions in LTL mode, iteration 1 : 757/758 places, 5328/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72071 ms. Remains : 757/758 places, 5328/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(F(G(((p0 U p2) U p3)))&&p1))))'
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-14 finished in 72566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(!p2))&&X(F(p2))))'
Support contains 20 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 5327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 5327
Applied a total of 4 rules in 111 ms. Remains 756 /758 variables (removed 2) and now considering 5327/5329 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16362097018651912130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7582986312568515531.kers'
[2026-05-25 11:09:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16362097018651912130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7582986312568515531.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 5327 rows 756 cols 64769 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 11:09:26] [INFO ] Computed 8 invariants in 84 ms
Computed 8 P flows in 85 ms.
Exported basis to /tmp/petrispot-output-7582986312568515531.kers
Total runtime 103 ms.
[2026-05-25 11:09:27] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2026-05-25 11:09:27] [INFO ] Invariant cache hit.
[2026-05-25 11:09:29] [INFO ] Implicit Places using invariants and state equation in 2480 ms returned []
Implicit Place search using SMT with State Equation took 3573 ms to find 0 implicit places.
Running 5326 sub problems to find dead transitions.
[2026-05-25 11:09:29] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 5326/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 4416/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69158ms problems are : Problem set: 0 solved, 5326 unsolved
Search for dead transitions found 0 dead transitions in 69172ms
Starting structural reductions in LTL mode, iteration 1 : 756/758 places, 5327/5329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72871 ms. Remains : 756/758 places, 5327/5329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(!p2))&&X(F(p2))))'
Stuttering acceptance computed with spot in 324 ms :[true, p2, (NOT p2), (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : MedleyB-PT-B06-LTLFireability-15
Stuttering criterion allowed to conclude after 129 steps with 1 reset in 2 ms.
FORMULA MedleyB-PT-B06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLFireability-15 finished in 73300 ms.
All properties solved by simple procedures.
Total runtime 770309 ms.

BK_STOP 1779707439448

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

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

Sequence of Actions to be Executed by the VM

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

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

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