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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 107K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779699709070

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:01:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:01:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:01:51] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2026-05-25 09:01:51] [INFO ] Transformed 149 places.
[2026-05-25 09:01:51] [INFO ] Transformed 340 transitions.
[2026-05-25 09:01:51] [INFO ] Found NUPN structural information;
[2026-05-25 09:01:51] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 113 transition count 301
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 113 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 113 transition count 297
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 108 transition count 289
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 108 transition count 289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 107 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 107 transition count 286
Applied a total of 85 rules in 53 ms. Remains 107 /149 variables (removed 42) and now considering 286/340 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11668972241643805636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2338426015195986985.kers'
[2026-05-25 09:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11668972241643805636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2338426015195986985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 107 cols 1586 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:01:51] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2338426015195986985.kers
Total runtime 5 ms.
[2026-05-25 09:01:51] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-25 09:01:51] [INFO ] Invariant cache hit.
[2026-05-25 09:01:51] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2026-05-25 09:01:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/107 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 5/15 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/18 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/20 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 286/393 variables, 107/127 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 4/131 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 3/134 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/134 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/393 variables, 0/134 constraints. Problems are: Problem set: 64 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 134 constraints, problems are : Problem set: 64 solved, 221 unsolved in 24762 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 14/24 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/24 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 286/393 variables, 107/131 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 221/352 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 3/355 constraints. Problems are: Problem set: 64 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/356 constraints. Problems are: Problem set: 64 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 356 constraints, problems are : Problem set: 64 solved, 221 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 221/285 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 55254ms problems are : Problem set: 64 solved, 221 unsolved
Search for dead transitions found 64 dead transitions in 55271ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/149 places, 222/340 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55876 ms. Remains : 107/149 places, 222/340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12486034337530857123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16944178098366096976.kers'
[2026-05-25 09:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12486034337530857123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16944178098366096976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 107 cols 1074 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:02:47] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16944178098366096976.kers
Total runtime 3 ms.
[2026-05-25 09:02:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:02:47] [INFO ] Invariant cache hit.
[2026-05-25 09:02:47] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 09:02:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/329 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 0/329 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/329 variables, and 135 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/329 variables, 107/132 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 221/353 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 360 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in LTL mode , in 1 iterations and 60374 ms. Remains : 107/107 places, 222/222 transitions.
Support contains 36 out of 107 places after structural reductions.
[2026-05-25 09:03:47] [INFO ] Flatten gal took : 49 ms
[2026-05-25 09:03:47] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:03:48] [INFO ] Input system was already deterministic with 222 transitions.
RANDOM walk for 40000 steps (1722 resets) in 1776 ms. (22 steps per ms) remains 14/26 properties
BEST_FIRST walk for 40001 steps (399 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (408 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (431 resets) in 351 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (410 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (404 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (427 resets) in 134 ms. (296 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (413 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (380 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (422 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (439 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (418 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (430 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (445 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
[2026-05-25 09:03:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 64/87 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/96 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 214/310 variables, 96/106 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/106 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 13/323 variables, 8/114 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 5/328 variables, 2/116 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/329 variables, 1/117 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/117 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/329 variables, 0/117 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 117 constraints, problems are : Problem set: 4 solved, 9 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 68/84 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 208/295 variables, 87/95 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 4/99 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/99 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 21/316 variables, 13/112 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/114 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 5/119 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 2/121 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/121 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 7/323 variables, 4/125 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/323 variables, 0/125 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 5/328 variables, 2/127 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 1/329 variables, 1/128 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 0/128 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/329 variables, 0/128 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 128 constraints, problems are : Problem set: 4 solved, 9 unsolved in 3533 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 9/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4234ms problems are : Problem set: 4 solved, 9 unsolved
Parikh walk visited 7 properties in 2338 ms.
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 222/222 transitions.
Graph (complete) has 419 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 105 transition count 208
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 94 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 26 place count 94 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 91 transition count 203
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 83 transition count 194
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 83 transition count 194
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 80 transition count 188
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 79 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 79 transition count 185
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 85 place count 64 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 64 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 63 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 63 transition count 169
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 102 place count 56 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 167 place count 56 transition count 163
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 173 place count 53 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 189 place count 53 transition count 179
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 53 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 51 transition count 177
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 51 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 197 place count 49 transition count 206
Applied a total of 197 rules in 84 ms. Remains 49 /107 variables (removed 58) and now considering 206/222 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 49/107 places, 206/222 transitions.
RANDOM walk for 40000 steps (4052 resets) in 262 ms. (152 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (911 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9996127232673667522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8587328848689293065.kers'
[2026-05-25 09:03:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9996127232673667522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8587328848689293065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 49 cols 1225 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-25 09:03:55] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8587328848689293065.kers
Total runtime 8 ms.
[2026-05-25 09:03:55] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/44 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 206/254 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 48/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/255 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/255 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/44 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 206/254 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 48/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/255 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/255 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/255 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 719ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 206/206 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 49 transition count 205
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 205
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 45 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 44 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 44 transition count 202
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 43 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 43 transition count 200
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 43 transition count 200
Applied a total of 16 rules in 39 ms. Remains 43 /49 variables (removed 6) and now considering 200/206 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 43/49 places, 200/206 transitions.
RANDOM walk for 40000 steps (4669 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (802 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35570 steps, run visited all 1 properties in 91 ms. (steps per millisecond=390 )
Probabilistic random walk after 35570 steps, saw 10525 distinct states, run finished after 95 ms. (steps per millisecond=374 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 419 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
FORMULA MedleyA-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Graph (complete) has 419 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 104 transition count 208
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 93 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 93 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 90 transition count 203
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 80 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 80 transition count 187
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 75 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 75 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 72 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 72 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 71 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 71 transition count 163
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 97 place count 56 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 56 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 54 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 54 transition count 147
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 116 place count 47 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 134 place count 47 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 46 transition count 164
Applied a total of 136 rules in 40 ms. Remains 46 /107 variables (removed 61) and now considering 164/222 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11005558757032864537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13451545472837389045.kers'
[2026-05-25 09:03:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11005558757032864537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13451545472837389045.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 46 cols 908 entries
Finished phase 1 with 36 SingleSign rule and 2 generalized
[2026-05-25 09:03:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13451545472837389045.kers
Total runtime 2 ms.
[2026-05-25 09:03:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:03:57] [INFO ] Invariant cache hit.
[2026-05-25 09:03:57] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-25 09:03:57] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2026-05-25 09:03:57] [INFO ] Redundant transitions in 9 ms returned []
Running 160 sub problems to find dead transitions.
[2026-05-25 09:03:57] [INFO ] Invariant cache hit.
[2026-05-25 09:03:57] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/209 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 34/87 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 1/210 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 88 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7274 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/209 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 34/87 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 160/247 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 248 constraints, problems are : Problem set: 0 solved, 160 unsolved in 17052 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24449ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 24450ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/107 places, 164/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24646 ms. Remains : 46/107 places, 164/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 322 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 10536 reset in 290 ms.
Product exploration explored 100000 steps with 10550 reset in 283 ms.
Computed a total of 3 stabilizing places and 24 stable transitions
Computed a total of 3 stabilizing places and 24 stable transitions
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4222 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (667 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 74400 steps, run visited all 1 properties in 106 ms. (steps per millisecond=701 )
Probabilistic random walk after 74400 steps, saw 17517 distinct states, run finished after 106 ms. (steps per millisecond=701 ) properties seen :1
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Knowledge-based reduction took 437 ms.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 164/164 transitions.
Applied a total of 0 rules in 9 ms. Remains 46 /46 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2026-05-25 09:04:23] [INFO ] Invariant cache hit.
[2026-05-25 09:04:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:04:23] [INFO ] Invariant cache hit.
[2026-05-25 09:04:23] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-25 09:04:23] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2026-05-25 09:04:23] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 46/46 places, 164/164 transitions.
Computed a total of 3 stabilizing places and 24 stable transitions
Computed a total of 3 stabilizing places and 24 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4235 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (639 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 74400 steps, run visited all 1 properties in 111 ms. (steps per millisecond=670 )
Probabilistic random walk after 74400 steps, saw 17517 distinct states, run finished after 111 ms. (steps per millisecond=670 ) properties seen :1
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Knowledge-based reduction took 356 ms.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10550 reset in 203 ms.
Product exploration explored 100000 steps with 10584 reset in 186 ms.
Built C files in :
/tmp/ltsmin8812337049796211557
[2026-05-25 09:04:24] [INFO ] Computing symmetric may disable matrix : 164 transitions.
[2026-05-25 09:04:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:24] [INFO ] Computing symmetric may enable matrix : 164 transitions.
[2026-05-25 09:04:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:24] [INFO ] Computing Do-Not-Accords matrix : 164 transitions.
[2026-05-25 09:04:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:24] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8812337049796211557
Running compilation step : cd /tmp/ltsmin8812337049796211557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 654 ms.
Running link step : cd /tmp/ltsmin8812337049796211557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin8812337049796211557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18316738385988369377.hoa' '--buchi-type=spotba'
LTSmin run took 1896 ms.
FORMULA MedleyA-PT-10-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLFireability-00 finished in 30154 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 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Graph (complete) has 419 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 104 transition count 209
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 94 transition count 207
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 23 place count 94 transition count 203
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 31 place count 90 transition count 203
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 39 place count 82 transition count 194
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 82 transition count 194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 47 place count 82 transition count 193
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 81 transition count 193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 78 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 78 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 77 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 77 transition count 184
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 61 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 61 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 59 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 59 transition count 166
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 109 place count 51 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 165 place count 51 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 49 transition count 188
Applied a total of 169 rules in 53 ms. Remains 49 /107 variables (removed 58) and now considering 188/222 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14790881636152864350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16743393997725685581.kers'
[2026-05-25 09:04:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14790881636152864350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16743393997725685581.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 49 cols 957 entries
Finished phase 1 with 39 SingleSign rule and 2 generalized
[2026-05-25 09:04:27] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16743393997725685581.kers
Total runtime 4 ms.
[2026-05-25 09:04:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:04:27] [INFO ] Invariant cache hit.
[2026-05-25 09:04:27] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:04:27] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2026-05-25 09:04:27] [INFO ] Redundant transitions in 4 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 09:04:27] [INFO ] Invariant cache hit.
[2026-05-25 09:04:27] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 188/236 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 79/136 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 1/237 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 138 constraints, problems are : Problem set: 0 solved, 184 unsolved in 11200 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 188/236 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 79/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 184/321 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 1/237 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 322 constraints, problems are : Problem set: 0 solved, 184 unsolved in 29467 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40758ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 40759ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/107 places, 188/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41070 ms. Remains : 49/107 places, 188/222 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 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 10865 reset in 194 ms.
Product exploration explored 100000 steps with 10856 reset in 187 ms.
Computed a total of 7 stabilizing places and 73 stable transitions
Computed a total of 7 stabilizing places and 73 stable transitions
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4330 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (878 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 483316 steps, run visited all 1 properties in 746 ms. (steps per millisecond=647 )
Probabilistic random walk after 483316 steps, saw 103376 distinct states, run finished after 746 ms. (steps per millisecond=647 ) properties seen :1
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 1096 ms.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 18 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-25 09:05:10] [INFO ] Invariant cache hit.
[2026-05-25 09:05:10] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 09:05:10] [INFO ] Invariant cache hit.
[2026-05-25 09:05:10] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:05:10] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2026-05-25 09:05:10] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 49/49 places, 188/188 transitions.
Computed a total of 7 stabilizing places and 73 stable transitions
Computed a total of 7 stabilizing places and 73 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4346 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (934 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 483316 steps, run visited all 1 properties in 712 ms. (steps per millisecond=678 )
Probabilistic random walk after 483316 steps, saw 103376 distinct states, run finished after 712 ms. (steps per millisecond=678 ) properties seen :1
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 964 ms.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10835 reset in 194 ms.
Product exploration explored 100000 steps with 10899 reset in 206 ms.
Built C files in :
/tmp/ltsmin11220219207957098841
[2026-05-25 09:05:12] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2026-05-25 09:05:12] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:05:12] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2026-05-25 09:05:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:05:12] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
[2026-05-25 09:05:12] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:05:12] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11220219207957098841
Running compilation step : cd /tmp/ltsmin11220219207957098841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 482 ms.
Running link step : cd /tmp/ltsmin11220219207957098841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11220219207957098841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13388021099539396974.hoa' '--buchi-type=spotba'
LTSmin run took 12206 ms.
FORMULA MedleyA-PT-10-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLFireability-01 finished in 57445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Graph (complete) has 419 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 104 transition count 209
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 94 transition count 207
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 23 place count 94 transition count 203
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 31 place count 90 transition count 203
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 80 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 80 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 51 place count 80 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 79 transition count 186
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 74 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 74 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 71 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 71 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 70 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 70 transition count 162
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 94 place count 58 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 58 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 57 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 57 transition count 149
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 111 place count 50 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 131 place count 50 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 48 transition count 176
Applied a total of 135 rules in 39 ms. Remains 48 /107 variables (removed 59) and now considering 176/222 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15842055525542304137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2283397835980349012.kers'
[2026-05-25 09:05:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15842055525542304137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2283397835980349012.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 48 cols 976 entries
Finished phase 1 with 36 SingleSign rule and 3 generalized
[2026-05-25 09:05:24] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2283397835980349012.kers
Total runtime 1 ms.
[2026-05-25 09:05:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:05:24] [INFO ] Invariant cache hit.
[2026-05-25 09:05:25] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 09:05:25] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-25 09:05:25] [INFO ] Redundant transitions in 2 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-25 09:05:25] [INFO ] Invariant cache hit.
[2026-05-25 09:05:25] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 176/223 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 1/224 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 106 constraints, problems are : Problem set: 0 solved, 170 unsolved in 8994 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 176/223 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 170/275 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 277 constraints, problems are : Problem set: 0 solved, 170 unsolved in 21885 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31009ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 31010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/107 places, 176/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31258 ms. Remains : 48/107 places, 176/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-02 finished in 31367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Graph (complete) has 419 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 104 transition count 208
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 93 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 93 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 90 transition count 203
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 40 place count 81 transition count 188
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 81 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 49 place count 81 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 80 transition count 187
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 75 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 75 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 72 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 72 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 71 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 71 transition count 163
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 94 place count 58 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 58 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 57 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 57 transition count 149
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 111 place count 50 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 131 place count 50 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 48 transition count 176
Applied a total of 135 rules in 49 ms. Remains 48 /107 variables (removed 59) and now considering 176/222 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5795305943820507368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12900579016413446865.kers'
[2026-05-25 09:05:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5795305943820507368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12900579016413446865.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 48 cols 936 entries
Finished phase 1 with 36 SingleSign rule and 3 generalized
[2026-05-25 09:05:56] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12900579016413446865.kers
Total runtime 1 ms.
[2026-05-25 09:05:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:05:56] [INFO ] Invariant cache hit.
[2026-05-25 09:05:56] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 09:05:56] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-25 09:05:56] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/107 places, 176/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 48/107 places, 176/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-03 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(p0))) U (G(p1) U X(X(p2))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 96 transition count 205
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 96 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 91 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 91 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 89 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 89 transition count 186
Applied a total of 36 rules in 8 ms. Remains 89 /107 variables (removed 18) and now considering 186/222 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18057395553379188823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7958130917048552960.kers'
[2026-05-25 09:05:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18057395553379188823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7958130917048552960.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 89 cols 947 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:05:56] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7958130917048552960.kers
Total runtime 2 ms.
[2026-05-25 09:05:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:05:56] [INFO ] Invariant cache hit.
[2026-05-25 09:05:57] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 09:05:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/275 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 104 constraints, problems are : Problem set: 0 solved, 185 unsolved in 13311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/275 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 185/287 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 290 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43429ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 43431ms
Starting structural reductions in LTL mode, iteration 1 : 89/107 places, 186/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43668 ms. Remains : 89/107 places, 186/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(p0))) U (G(p1) U X(X(p2))))))'
Stuttering acceptance computed with spot in 1273 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-06 finished in 45072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&X(p1)))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 96 transition count 205
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 96 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 91 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 91 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 88 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 88 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 87 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 87 transition count 181
Applied a total of 40 rules in 6 ms. Remains 87 /107 variables (removed 20) and now considering 181/222 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8478688603065412841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3538943301695483298.kers'
[2026-05-25 09:06:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8478688603065412841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3538943301695483298.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 87 cols 933 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:06:41] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3538943301695483298.kers
Total runtime 3 ms.
[2026-05-25 09:06:42] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 09:06:42] [INFO ] Invariant cache hit.
[2026-05-25 09:06:42] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-25 09:06:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 102 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 292 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42156ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 42156ms
Starting structural reductions in LTL mode, iteration 1 : 87/107 places, 181/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42404 ms. Remains : 87/107 places, 181/222 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(p0)&&p1))))'
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-08 finished in 42758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 96 transition count 205
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 96 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 91 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 91 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 89 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 89 transition count 186
Applied a total of 36 rules in 5 ms. Remains 89 /107 variables (removed 18) and now considering 186/222 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2814195739298783174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2869984834163603755.kers'
[2026-05-25 09:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2814195739298783174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2869984834163603755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 89 cols 947 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:07:24] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2869984834163603755.kers
Total runtime 3 ms.
[2026-05-25 09:07:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 09:07:24] [INFO ] Invariant cache hit.
[2026-05-25 09:07:24] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 09:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/275 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 104 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12731 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/275 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 185/287 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 290 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42906ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 42907ms
Starting structural reductions in LTL mode, iteration 1 : 89/107 places, 186/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43199 ms. Remains : 89/107 places, 186/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1132 steps with 52 reset in 9 ms.
FORMULA MedleyA-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-09 finished in 43437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F((p1&&(p2||X(p2))))))))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 97 transition count 206
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 97 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 94 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 94 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 92 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 92 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 91 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 91 transition count 190
Applied a total of 32 rules in 5 ms. Remains 91 /107 variables (removed 16) and now considering 190/222 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-265090191858345304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10535742516708144267.kers'
[2026-05-25 09:08:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-265090191858345304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10535742516708144267.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 91 cols 969 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:08:08] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10535742516708144267.kers
Total runtime 2 ms.
[2026-05-25 09:08:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:08:08] [INFO ] Invariant cache hit.
[2026-05-25 09:08:08] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-25 09:08:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/281 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 109 constraints, problems are : Problem set: 0 solved, 189 unsolved in 15089 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/281 variables, 91/107 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 189/296 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/281 variables, and 301 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45224ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 45225ms
Starting structural reductions in LTL mode, iteration 1 : 91/107 places, 190/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45427 ms. Remains : 91/107 places, 190/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F((p1&&(p2||X(p2))))))))))'
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-13
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-13 finished in 45665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 98 transition count 208
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 98 transition count 208
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 94 transition count 199
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 94 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 92 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 92 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 91 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 91 transition count 191
Applied a total of 32 rules in 4 ms. Remains 91 /107 variables (removed 16) and now considering 191/222 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12294196268624643339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14054476313199056720.kers'
[2026-05-25 09:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12294196268624643339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14054476313199056720.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 91 cols 969 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:08:53] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14054476313199056720.kers
Total runtime 1 ms.
[2026-05-25 09:08:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:08:53] [INFO ] Invariant cache hit.
[2026-05-25 09:08:54] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-25 09:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/282 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 0/282 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 110 constraints, problems are : Problem set: 0 solved, 190 unsolved in 18185 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/282 variables, 91/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 190/298 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 304 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48288ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 48290ms
Starting structural reductions in LTL mode, iteration 1 : 91/107 places, 191/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48559 ms. Remains : 91/107 places, 191/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 116 ms.
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 364 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 37 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 43 ms.
FORMULA MedleyA-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLFireability-14 finished in 49188 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) U ((p1&&X(p0))||X(G(p0)))))||((X(F(p2))||(p2&&X(p1)))&&(X(p0) U ((p1&&X(p0))||X(G(p0)))))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 222/222 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 97 transition count 206
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 97 transition count 206
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 92 transition count 193
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 92 transition count 193
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 90 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 90 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 89 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 89 transition count 185
Applied a total of 36 rules in 4 ms. Remains 89 /107 variables (removed 18) and now considering 185/222 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16822435912817206268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5216841020220825953.kers'
[2026-05-25 09:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16822435912817206268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5216841020220825953.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 89 cols 941 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:09:42] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5216841020220825953.kers
Total runtime 2 ms.
[2026-05-25 09:09:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 09:09:43] [INFO ] Invariant cache hit.
[2026-05-25 09:09:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 09:09:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/274 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 107 constraints, problems are : Problem set: 0 solved, 184 unsolved in 11746 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/274 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 184/289 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/274 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 295 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41822ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 41822ms
Starting structural reductions in LTL mode, iteration 1 : 89/107 places, 185/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42024 ms. Remains : 89/107 places, 185/222 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) U ((p1&&X(p0))||X(G(p0)))))||((X(p0) U ((p1&&X(p0))||X(G(p0))))&&(X(F(p2))||(p2&&X(p1))))))'
Stuttering acceptance computed with spot in 426 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-15 finished in 42503 ms.
All properties solved by simple procedures.
Total runtime 514756 ms.

BK_STOP 1779700225480

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-10, 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-177969019900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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