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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 99K 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-09-LTLFireability-00
FORMULA_NAME MedleyA-PT-09-LTLFireability-01
FORMULA_NAME MedleyA-PT-09-LTLFireability-02
FORMULA_NAME MedleyA-PT-09-LTLFireability-03
FORMULA_NAME MedleyA-PT-09-LTLFireability-04
FORMULA_NAME MedleyA-PT-09-LTLFireability-05
FORMULA_NAME MedleyA-PT-09-LTLFireability-06
FORMULA_NAME MedleyA-PT-09-LTLFireability-07
FORMULA_NAME MedleyA-PT-09-LTLFireability-08
FORMULA_NAME MedleyA-PT-09-LTLFireability-09
FORMULA_NAME MedleyA-PT-09-LTLFireability-10
FORMULA_NAME MedleyA-PT-09-LTLFireability-11
FORMULA_NAME MedleyA-PT-09-LTLFireability-12
FORMULA_NAME MedleyA-PT-09-LTLFireability-13
FORMULA_NAME MedleyA-PT-09-LTLFireability-14
FORMULA_NAME MedleyA-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779699562854

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 08:59:24] [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 08:59:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:59:24] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-25 08:59:24] [INFO ] Transformed 147 places.
[2026-05-25 08:59:24] [INFO ] Transformed 315 transitions.
[2026-05-25 08:59:24] [INFO ] Found NUPN structural information;
[2026-05-25 08:59:24] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 245 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 5 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 36 place count 109 transition count 276
Iterating global reduction 1 with 34 rules applied. Total rules applied 70 place count 109 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 107 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 107 transition count 272
Applied a total of 74 rules in 58 ms. Remains 107 /145 variables (removed 38) and now considering 272/313 (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-14331050611586958789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13383447612412410321.kers'
[2026-05-25 08:59:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14331050611586958789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13383447612412410321.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 272 rows 107 cols 1495 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 08:59:24] [INFO ] Computed 10 invariants in 14 ms
Computed 10 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13383447612412410321.kers
Total runtime 15 ms.
[2026-05-25 08:59:25] [INFO ] Implicit Places using invariants in 279 ms returned []
[2026-05-25 08:59:25] [INFO ] Invariant cache hit.
[2026-05-25 08:59:25] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2026-05-25 08:59:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 8/18 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 272/379 variables, 107/125 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 4/129 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 1/130 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/132 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/133 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/133 constraints. Problems are: Problem set: 64 solved, 207 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 133 constraints, problems are : Problem set: 64 solved, 207 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 13/23 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/23 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 272/379 variables, 107/130 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 207/337 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 5/342 constraints. Problems are: Problem set: 64 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 1/343 constraints. Problems are: Problem set: 64 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 344 constraints, problems are : Problem set: 64 solved, 207 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 207/271 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60460ms problems are : Problem set: 64 solved, 207 unsolved
Search for dead transitions found 64 dead transitions in 60485ms
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/145 places, 208/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61085 ms. Remains : 107/145 places, 208/313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 208/208 (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-10684913965634954728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10653522709182814757.kers'
[2026-05-25 09:00:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10684913965634954728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10653522709182814757.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 107 cols 983 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:00:25] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10653522709182814757.kers
Total runtime 4 ms.
[2026-05-25 09:00:25] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:00:25] [INFO ] Invariant cache hit.
[2026-05-25 09:00:26] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-25 09:00:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/315 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 132 constraints, problems are : Problem set: 0 solved, 207 unsolved in 27163 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/315 variables, 107/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 207/337 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 346 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57277ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 57279ms
Finished structural reductions in LTL mode , in 1 iterations and 57552 ms. Remains : 107/107 places, 208/208 transitions.
Support contains 32 out of 107 places after structural reductions.
[2026-05-25 09:01:23] [INFO ] Flatten gal took : 91 ms
[2026-05-25 09:01:23] [INFO ] Flatten gal took : 31 ms
[2026-05-25 09:01:23] [INFO ] Input system was already deterministic with 208 transitions.
RANDOM walk for 40000 steps (1308 resets) in 2417 ms. (16 steps per ms) remains 20/27 properties
BEST_FIRST walk for 4003 steps (25 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 46 ms. (85 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 51 ms. (77 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (29 resets) in 45 ms. (86 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 19 ms. (200 steps per ms) remains 17/19 properties
[2026-05-25 09:01:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/64 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 30/94 variables, 5/10 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/104 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 15/307 variables, 8/112 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/112 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 8/315 variables, 5/117 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/315 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 118 constraints, problems are : Problem set: 4 solved, 13 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 13 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/61 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 24/85 variables, 3/8 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 192/277 variables, 85/93 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 4/97 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/98 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/99 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/99 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 19/296 variables, 12/111 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 2/113 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 8/121 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 1/122 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/122 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 13/309 variables, 6/128 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 6/315 variables, 4/132 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/315 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 132 constraints, problems are : Problem set: 5 solved, 12 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5156ms problems are : Problem set: 5 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 10 properties in 3263 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 208/208 transitions.
Graph (complete) has 375 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 105 transition count 190
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 90 transition count 186
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 88 transition count 184
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 40 place count 88 transition count 177
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 54 place count 81 transition count 177
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 59 place count 76 transition count 169
Iterating global reduction 3 with 5 rules applied. Total rules applied 64 place count 76 transition count 169
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 109 place count 53 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 53 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 123 place count 47 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 133 place count 47 transition count 157
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 4 with 4 rules applied. Total rules applied 137 place count 45 transition count 180
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 45 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 145 place count 41 transition count 176
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 41 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 39 transition count 174
Applied a total of 149 rules in 52 ms. Remains 39 /107 variables (removed 68) and now considering 174/208 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 39/107 places, 174/208 transitions.
RANDOM walk for 25177 steps (4483 resets) in 262 ms. (95 steps per ms) remains 0/2 properties
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA MedleyA-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 375 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
FORMULA MedleyA-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-04 TRUE 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 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Graph (complete) has 375 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 104 transition count 191
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 90 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 89 transition count 188
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 33 place count 89 transition count 180
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 49 place count 81 transition count 180
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 76 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 76 transition count 172
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 97 place count 56 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 56 transition count 152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 108 place count 51 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 126 place count 51 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 51 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 130 place count 49 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 130 place count 49 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 134 place count 47 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 136 place count 46 transition count 167
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 46 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 138 place count 45 transition count 166
Applied a total of 138 rules in 47 ms. Remains 45 /107 variables (removed 62) and now considering 166/208 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8946501482084336402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3042294042010540754.kers'
[2026-05-25 09:01:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8946501482084336402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3042294042010540754.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 45 cols 846 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-25 09:01:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3042294042010540754.kers
Total runtime 1 ms.
[2026-05-25 09:01:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 09:01:33] [INFO ] Invariant cache hit.
[2026-05-25 09:01:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 09:01:34] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2026-05-25 09:01:34] [INFO ] Redundant transitions in 4 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-25 09:01:34] [INFO ] Invariant cache hit.
[2026-05-25 09:01:34] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 166/211 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 57/110 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 110 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9333 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 166/211 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 57/110 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 162/272 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 272 constraints, problems are : Problem set: 0 solved, 162 unsolved in 15255 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24703ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 24704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/107 places, 166/208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24942 ms. Remains : 45/107 places, 166/208 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 455 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 15 ms.
FORMULA MedleyA-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-01 finished in 25606 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)&&F(G(!p1)))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Graph (complete) has 375 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 104 transition count 190
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 89 transition count 186
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 87 transition count 184
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 87 transition count 179
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 82 transition count 179
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 78 transition count 172
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 78 transition count 172
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 103 place count 54 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 54 transition count 147
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 117 place count 48 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 135 place count 48 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 4 with 4 rules applied. Total rules applied 139 place count 46 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 45 transition count 175
Applied a total of 140 rules in 25 ms. Remains 45 /107 variables (removed 62) and now considering 175/208 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7678529235386920741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7123146051041450000.kers'
[2026-05-25 09:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7678529235386920741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7123146051041450000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 45 cols 986 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-25 09:01:59] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7123146051041450000.kers
Total runtime 1 ms.
[2026-05-25 09:01:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 09:01:59] [INFO ] Invariant cache hit.
[2026-05-25 09:01:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 09:01:59] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-25 09:01:59] [INFO ] Redundant transitions in 3 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-25 09:01:59] [INFO ] Invariant cache hit.
[2026-05-25 09:01:59] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 175/220 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 72 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5928 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 175/220 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 171/243 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 243 constraints, problems are : Problem set: 0 solved, 171 unsolved in 16723 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22766ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 22768ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/107 places, 175/208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23028 ms. Remains : 45/107 places, 175/208 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-05 finished in 23176 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, 208/208 transitions.
Graph (complete) has 375 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 104 transition count 190
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 89 transition count 186
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 87 transition count 184
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 39 place count 87 transition count 178
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 51 place count 81 transition count 178
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 56 place count 76 transition count 170
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 76 transition count 170
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 105 place count 53 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 53 transition count 146
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 47 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 137 place count 47 transition count 152
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 4 with 4 rules applied. Total rules applied 141 place count 45 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 44 transition count 174
Applied a total of 142 rules in 58 ms. Remains 44 /107 variables (removed 63) and now considering 174/208 (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-2793332259603655114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17037311068379186719.kers'
[2026-05-25 09:02:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2793332259603655114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17037311068379186719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 44 cols 984 entries
Finished phase 1 with 34 SingleSign rule and 2 generalized
[2026-05-25 09:02:22] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17037311068379186719.kers
Total runtime 1 ms.
[2026-05-25 09:02:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 09:02:22] [INFO ] Invariant cache hit.
[2026-05-25 09:02:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 09:02:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-25 09:02:22] [INFO ] Redundant transitions in 3 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-25 09:02:22] [INFO ] Invariant cache hit.
[2026-05-25 09:02:22] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 174/218 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 70 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5928 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 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/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 174/218 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 170/240 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 240 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16166 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22275ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 22275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/107 places, 174/208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22511 ms. Remains : 44/107 places, 174/208 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 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-08 finished in 22637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 204
Applied a total of 6 rules in 3 ms. Remains 104 /107 variables (removed 3) and now considering 204/208 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9420302485070410283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1009173647612070535.kers'
[2026-05-25 09:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9420302485070410283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1009173647612070535.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 104 cols 975 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 09:02:45] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1009173647612070535.kers
Total runtime 2 ms.
[2026-05-25 09:02:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 09:02:45] [INFO ] Invariant cache hit.
[2026-05-25 09:02:45] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-25 09:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 333 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53379ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 53381ms
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 204/208 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53642 ms. Remains : 104/107 places, 204/208 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 15 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA MedleyA-PT-09-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-09-LTLFireability-09 finished in 54159 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||(p1&&(p2||X(p3)))))))'
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 207
Applied a total of 2 rules in 5 ms. Remains 106 /107 variables (removed 1) and now considering 207/208 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11015563115074319894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7291334549303651920.kers'
[2026-05-25 09:03:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11015563115074319894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7291334549303651920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 106 cols 981 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:03:39] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7291334549303651920.kers
Total runtime 5 ms.
[2026-05-25 09:03:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 09:03:39] [INFO ] Invariant cache hit.
[2026-05-25 09:03:39] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 09:03:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 129 constraints, problems are : Problem set: 0 solved, 206 unsolved in 21192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 206/333 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 339 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51297ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 51297ms
Starting structural reductions in LTL mode, iteration 1 : 106/107 places, 207/208 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51483 ms. Remains : 106/107 places, 207/208 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||(p1&&(p2||X(p3)))))))'
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-10 finished in 51710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1&&X((p1 U (!p2||G(p1)))))||p0))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 204
Applied a total of 6 rules in 2 ms. Remains 104 /107 variables (removed 3) and now considering 204/208 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2999937829522603346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9560765803322072785.kers'
[2026-05-25 09:04:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2999937829522603346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9560765803322072785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 104 cols 975 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 09:04:31] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9560765803322072785.kers
Total runtime 1 ms.
[2026-05-25 09:04:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:04:31] [INFO ] Invariant cache hit.
[2026-05-25 09:04:31] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-25 09:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23939 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 333 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54069ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 54069ms
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 204/208 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54441 ms. Remains : 104/107 places, 204/208 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1&&X((p1 U (!p2||G(p1)))))||p0))))))'
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1316 resets) in 407 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (266 resets) in 261 ms. (152 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (266 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (278 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (296 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
[2026-05-25 09:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 188/270 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 19/289 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 13/302 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 6/308 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 114 constraints, problems are : Problem set: 0 solved, 3 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 188/270 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 19/289 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/302 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/302 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/308 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/308 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/308 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 120 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1733ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 687 steps, including 37 resets, run visited all 3 properties in 14 ms. (steps per millisecond=49 )
Parikh walk visited 3 properties in 18 ms.
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Knowledge-based reduction took 2796 ms.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2026-05-25 09:05:29] [INFO ] Invariant cache hit.
[2026-05-25 09:05:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 09:05:29] [INFO ] Invariant cache hit.
[2026-05-25 09:05:29] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 104/104 places, 204/204 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge based reduction with 1 factoid took 38 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1331 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (271 resets) in 61 ms. (645 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (266 resets) in 54 ms. (727 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (260 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
[2026-05-25 09:05:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 188/270 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 19/289 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/302 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/308 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 188/270 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/289 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/302 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/308 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/308 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1082ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 39 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 2 properties in 1 ms.
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Knowledge-based reduction took 1858 ms.
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Spot run failed in 108 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15508866973619230895
[2026-05-25 09:05:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15508866973619230895
Running compilation step : cd /tmp/ltsmin15508866973619230895;'/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 614 ms.
Running link step : cd /tmp/ltsmin15508866973619230895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin15508866973619230895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8325437100487004153.hoa' '--buchi-type=spotba'
LTSmin run took 56 ms.
FORMULA MedleyA-PT-09-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLFireability-11 finished in 62243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&X(X((!p1||X(!p2)))))||G((!p1||X(!p2)))))))'
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 204
Applied a total of 6 rules in 5 ms. Remains 104 /107 variables (removed 3) and now considering 204/208 (removed 4) transitions.
[2026-05-25 09:05:33] [INFO ] Invariant cache hit.
[2026-05-25 09:05:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:05:33] [INFO ] Invariant cache hit.
[2026-05-25 09:05:33] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 204/208 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 104/107 places, 204/208 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(p1)||p0))||(p2&&X(X((X(p1)||p3))))))))'
Stuttering acceptance computed with spot in 890 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-12
Product exploration explored 100000 steps with 25000 reset in 170 ms.
Product exploration explored 100000 steps with 25000 reset in 159 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge based reduction with 27 factoid took 169 ms. Reduced automaton from 17 states, 81 edges and 4 AP (stutter sensitive) to 17 states, 81 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 28 to 21
RANDOM walk for 40000 steps (1319 resets) in 406 ms. (98 steps per ms) remains 16/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (30 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (23 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (28 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
[2026-05-25 09:05:35] [INFO ] Invariant cache hit.
Problem apf8 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 38/56 variables, 3/5 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/7 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 10 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 6 (OVERLAPS) 31/87 variables, 4/11 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 192/279 variables, 87/99 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/99 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 17/296 variables, 10/109 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 1/110 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/110 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 11/307 variables, 6/116 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/308 variables, 1/117 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 0/117 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/308 variables, 0/117 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 117 constraints, problems are : Problem set: 9 solved, 7 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 38/56 variables, 3/5 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/7 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 31/87 variables, 4/11 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 192/279 variables, 87/99 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/100 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/100 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 17/296 variables, 10/110 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 1/111 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 6/117 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/296 variables, 2/119 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/296 variables, 0/119 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 11/307 variables, 6/125 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/307 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/308 variables, 1/126 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 126 constraints, problems are : Problem set: 9 solved, 7 unsolved in 4065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 7/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5248ms problems are : Problem set: 9 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 282 steps, including 1 resets, run visited all 7 properties in 7 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 9 ms.
Found 11 invariant AP formulas.
Knowledge based reduction with 38 factoid took 412 ms. Proved property starting from automaton with 17 states, 81 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 6102 ms.
FORMULA MedleyA-PT-09-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-09-LTLFireability-12 finished in 7685 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)||F(p1)))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 208/208 transitions.
Graph (complete) has 375 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 104 transition count 192
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 31 place count 91 transition count 188
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 89 transition count 186
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 35 place count 89 transition count 177
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 53 place count 80 transition count 177
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 58 place count 75 transition count 169
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 75 transition count 169
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 102 place count 55 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 55 transition count 146
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 116 place count 49 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 49 transition count 173
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 4 with 2 rules applied. Total rules applied 124 place count 48 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 47 transition count 183
Applied a total of 125 rules in 57 ms. Remains 47 /107 variables (removed 60) and now considering 183/208 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15716511240554753418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17759206063098318348.kers'
[2026-05-25 09:05:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15716511240554753418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17759206063098318348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 47 cols 987 entries
Finished phase 1 with 35 SingleSign rule and 3 generalized
[2026-05-25 09:05:40] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17759206063098318348.kers
Total runtime 2 ms.
[2026-05-25 09:05:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 09:05:41] [INFO ] Invariant cache hit.
[2026-05-25 09:05:41] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 09:05:41] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2026-05-25 09:05:41] [INFO ] Redundant transitions in 5 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 09:05:41] [INFO ] Invariant cache hit.
[2026-05-25 09:05:41] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 183/230 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 109 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 183/230 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 181/290 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 292 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24765 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31162ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 31163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/107 places, 183/208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31633 ms. Remains : 47/107 places, 183/208 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)||F(p1)))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 25560 reset in 231 ms.
Product exploration explored 100000 steps with 25572 reset in 417 ms.
Computed a total of 5 stabilizing places and 68 stable transitions
Computed a total of 5 stabilizing places and 68 stable transitions
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 165 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 57 ms :[(NOT p1), (NOT p1)]
[2026-05-25 09:06:13] [INFO ] Invariant cache hit.
[2026-05-25 09:06:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 09:06:13] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 09:06:13] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-25 09:06:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:06:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 09:06:13] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 09:06:14] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 09:06:14] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 09:06:14] [INFO ] [Nat]Added 53 Read/Feed constraints in 11 ms returned sat
[2026-05-25 09:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2026-05-25 09:06:14] [INFO ] Computed and/alt/rep : 40/197/40 causal constraints (skipped 141 transitions) in 39 ms.
[2026-05-25 09:06:14] [INFO ] Added : 0 causal constraints over 0 iterations in 112 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 1180 ms.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 47 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 183/183 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2026-05-25 09:06:14] [INFO ] Invariant cache hit.
[2026-05-25 09:06:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:06:14] [INFO ] Invariant cache hit.
[2026-05-25 09:06:14] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 09:06:14] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2026-05-25 09:06:14] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 47/47 places, 183/183 transitions.
Computed a total of 5 stabilizing places and 68 stable transitions
Computed a total of 5 stabilizing places and 68 stable transitions
Knowledge based reduction with 2 factoid took 88 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 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 103 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 96 ms :[(NOT p1), (NOT p1)]
[2026-05-25 09:06:15] [INFO ] Invariant cache hit.
[2026-05-25 09:06:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 09:06:15] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 09:06:15] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 09:06:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:06:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 09:06:15] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-25 09:06:15] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-25 09:06:15] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 09:06:15] [INFO ] [Nat]Added 53 Read/Feed constraints in 5 ms returned sat
[2026-05-25 09:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2026-05-25 09:06:15] [INFO ] Computed and/alt/rep : 40/197/40 causal constraints (skipped 141 transitions) in 18 ms.
[2026-05-25 09:06:15] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 863 ms.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25530 reset in 209 ms.
Product exploration explored 100000 steps with 25573 reset in 203 ms.
Built C files in :
/tmp/ltsmin4320885217087651133
[2026-05-25 09:06:16] [INFO ] Computing symmetric may disable matrix : 183 transitions.
[2026-05-25 09:06:16] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:06:16] [INFO ] Computing symmetric may enable matrix : 183 transitions.
[2026-05-25 09:06:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:06:16] [INFO ] Computing Do-Not-Accords matrix : 183 transitions.
[2026-05-25 09:06:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:06:16] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4320885217087651133
Running compilation step : cd /tmp/ltsmin4320885217087651133;'/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 459 ms.
Running link step : cd /tmp/ltsmin4320885217087651133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin4320885217087651133;'/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/stateBased2596543675121515064.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA MedleyA-PT-09-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLFireability-14 finished in 36177 ms.
All properties solved by simple procedures.
Total runtime 412779 ms.

BK_STOP 1779699977150

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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