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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 43K 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-12-LTLFireability-00
FORMULA_NAME MedleyA-PT-12-LTLFireability-01
FORMULA_NAME MedleyA-PT-12-LTLFireability-02
FORMULA_NAME MedleyA-PT-12-LTLFireability-03
FORMULA_NAME MedleyA-PT-12-LTLFireability-04
FORMULA_NAME MedleyA-PT-12-LTLFireability-05
FORMULA_NAME MedleyA-PT-12-LTLFireability-06
FORMULA_NAME MedleyA-PT-12-LTLFireability-07
FORMULA_NAME MedleyA-PT-12-LTLFireability-08
FORMULA_NAME MedleyA-PT-12-LTLFireability-09
FORMULA_NAME MedleyA-PT-12-LTLFireability-10
FORMULA_NAME MedleyA-PT-12-LTLFireability-11
FORMULA_NAME MedleyA-PT-12-LTLFireability-12
FORMULA_NAME MedleyA-PT-12-LTLFireability-13
FORMULA_NAME MedleyA-PT-12-LTLFireability-14
FORMULA_NAME MedleyA-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700061076

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:07:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:07:42] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2026-05-25 09:07:42] [INFO ] Transformed 172 places.
[2026-05-25 09:07:42] [INFO ] Transformed 166 transitions.
[2026-05-25 09:07:42] [INFO ] Found NUPN structural information;
[2026-05-25 09:07:42] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 17 place count 155 transition count 153
Iterating global reduction 1 with 13 rules applied. Total rules applied 30 place count 155 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 154 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 154 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 153 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 153 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 152 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 152 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 151 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 151 transition count 149
Applied a total of 38 rules in 65 ms. Remains 151 /172 variables (removed 21) and now considering 149/166 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10964637955364424229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2828243110845040389.kers'
[2026-05-25 09:07:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10964637955364424229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2828243110845040389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 151 cols 418 entries
Finished phase 1 with 119 SingleSign rule and 12 generalized
[2026-05-25 09:07:42] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2828243110845040389.kers
Total runtime 1 ms.
[2026-05-25 09:07:43] [INFO ] Implicit Places using invariants in 223 ms returned [32, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/172 places, 149/166 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 149/172 places, 149/166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 149/149 (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-6910274939859419929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17711385305472302703.kers'
[2026-05-25 09:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6910274939859419929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17711385305472302703.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 149 cols 414 entries
Finished phase 1 with 121 SingleSign rule and 10 generalized
[2026-05-25 09:07:43] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17711385305472302703.kers
Total runtime 0 ms.
[2026-05-25 09:07:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 09:07:43] [INFO ] Invariant cache hit.
[2026-05-25 09:07:43] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-25 09:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 149/298 variables, 149/173 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 175 constraints, problems are : Problem set: 0 solved, 148 unsolved in 16306 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 149/298 variables, 149/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 148/322 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 333 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 46418ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 46429ms
Finished structural reductions in LTL mode , in 1 iterations and 46670 ms. Remains : 149/149 places, 149/149 transitions.
Support contains 46 out of 149 places after structural reductions.
[2026-05-25 09:08:30] [INFO ] Flatten gal took : 38 ms
[2026-05-25 09:08:30] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:08:30] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 40000 steps (806 resets) in 1148 ms. (34 steps per ms) remains 7/35 properties
BEST_FIRST walk for 40002 steps (175 resets) in 94 ms. (421 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (178 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (208 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (224 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (196 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
[2026-05-25 09:08:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 45/149 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 149/298 variables, 149/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/298 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 45/149 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 149/298 variables, 149/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/298 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1015ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 470 ms.
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 148 transition count 120
Reduce places removed 29 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 31 rules applied. Total rules applied 61 place count 119 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 118 transition count 118
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 118 transition count 94
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 111 place count 93 transition count 94
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 92 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 91 transition count 93
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 89 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 89 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 118 place count 89 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 120 place count 88 transition count 90
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 168 place count 64 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 180 place count 58 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 58 transition count 85
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 186 place count 58 transition count 80
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 191 place count 53 transition count 80
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 194 place count 53 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 197 place count 50 transition count 77
Applied a total of 197 rules in 52 ms. Remains 50 /149 variables (removed 99) and now considering 77/149 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 50/149 places, 77/149 transitions.
RANDOM walk for 40000 steps (5213 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (898 resets) in 65 ms. (606 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (843 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (870 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6710872707529741349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14633638089513803504.kers'
[2026-05-25 09:08:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6710872707529741349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14633638089513803504.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 77 rows 48 cols 417 entries
Finished phase 1 with 30 SingleSign rule and 5 generalized
[2026-05-25 09:08:32] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14633638089513803504.kers
Total runtime 0 ms.
[2026-05-25 09:08:32] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/44 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/50 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 77/127 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 83 constraints, problems are : Problem set: 0 solved, 2 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/44 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/50 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 77/127 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 77/77 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 76
Applied a total of 2 rules in 6 ms. Remains 49 /50 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 49/50 places, 76/77 transitions.
RANDOM walk for 40000 steps (5385 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (865 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (955 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 43379 steps, run visited all 2 properties in 114 ms. (steps per millisecond=380 )
Probabilistic random walk after 43379 steps, saw 11016 distinct states, run finished after 117 ms. (steps per millisecond=370 ) properties seen :2
FORMULA MedleyA-PT-12-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||G(p1)) U X(X(X(!p2))))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 131
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 131
Applied a total of 14 rules in 13 ms. Remains 142 /149 variables (removed 7) and now considering 131/149 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9650019529394001895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5941500145544456765.kers'
[2026-05-25 09:08:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9650019529394001895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5941500145544456765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 142 cols 333 entries
Finished phase 1 with 114 SingleSign rule and 10 generalized
[2026-05-25 09:08:33] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5941500145544456765.kers
Total runtime 2 ms.
[2026-05-25 09:08:33] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 09:08:33] [INFO ] Invariant cache hit.
[2026-05-25 09:08:33] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-25 09:08:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 165 constraints, problems are : Problem set: 0 solved, 130 unsolved in 11522 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 130/294 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 304 constraints, problems are : Problem set: 0 solved, 130 unsolved in 28609 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 40156ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 40157ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 131/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40425 ms. Remains : 142/149 places, 131/149 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||G(p1)) U X(X(X(!p2))))))'
Stuttering acceptance computed with spot in 1307 ms :[p2, p2, (AND p2 (NOT p1)), p2, p2, p2, true, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-01
Product exploration explored 100000 steps with 20024 reset in 239 ms.
Product exploration explored 100000 steps with 19971 reset in 151 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge based reduction with 11 factoid took 152 ms. Reduced automaton from 18 states, 34 edges and 3 AP (stutter sensitive) to 18 states, 34 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (830 resets) in 595 ms. (67 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40003 steps (191 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (188 resets) in 157 ms. (253 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (168 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
[2026-05-25 09:09:16] [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) 54/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/98 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 142/273 variables, and 19 constraints, problems are : Problem set: 3 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 14 factoid took 282 ms. Reduced automaton from 18 states, 34 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[p2, p2, (AND p2 p0), p2, p2, true, (AND p0 p2), p2]
Knowledge-based reduction took 1316 ms.
Stuttering acceptance computed with spot in 401 ms :[p2, p2, (AND p2 p0), p2, p2, true, (AND p0 p2), p2]
Support contains 3 out of 142 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2026-05-25 09:09:17] [INFO ] Invariant cache hit.
[2026-05-25 09:09:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:09:17] [INFO ] Invariant cache hit.
[2026-05-25 09:09:17] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 142/142 places, 131/131 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (820 resets) in 185 ms. (215 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (183 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2026-05-25 09:09:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/96 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 46/142 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 131/273 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/96 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/142 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 131/273 variables, 142/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 4 ms.
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[p2, p2, (AND p2 p0), p2, p2, true, (AND p0 p2), p2]
Knowledge-based reduction took 1122 ms.
Stuttering acceptance computed with spot in 444 ms :[p2, p2, (AND p2 p0), p2, p2, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 452 ms :[p2, p2, (AND p2 p0), p2, p2, true, (AND p0 p2), p2]
Product exploration explored 100000 steps with 19983 reset in 137 ms.
Product exploration explored 100000 steps with 20026 reset in 125 ms.
Spot run failed in 113 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/ltsmin12252708564213370953
[2026-05-25 09:09:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12252708564213370953
Running compilation step : cd /tmp/ltsmin12252708564213370953;'/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 385 ms.
Running link step : cd /tmp/ltsmin12252708564213370953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12252708564213370953;'/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/stateBased18136315256640082332.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2026-05-25 09:09:35] [INFO ] Invariant cache hit.
[2026-05-25 09:09:35] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 09:09:35] [INFO ] Invariant cache hit.
[2026-05-25 09:09:35] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 142/142 places, 131/131 transitions.
Built C files in :
/tmp/ltsmin8594635335007948284
[2026-05-25 09:09:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8594635335007948284
Running compilation step : cd /tmp/ltsmin8594635335007948284;'/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 258 ms.
Running link step : cd /tmp/ltsmin8594635335007948284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8594635335007948284;'/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/stateBased13485719130852790656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:09:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:09:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:09:50] [INFO ] Time to serialize gal into /tmp/LTL8096387663123400070.gal : 2 ms
[2026-05-25 09:09:50] [INFO ] Time to serialize properties into /tmp/LTL16180099633612897705.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8096387663123400070.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8664668737193439204.hoa' '-atoms' '/tmp/LTL16180099633612897705.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16180099633612897705.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8664668737193439204.hoa
Reverse transition relation is NOT exact ! Due to transitions t19, t36, t51, t53, t61, t66, t72, t75, t78, t79, t81, t89, t93, t96, t99, t105, Intersectio...243
Computing Next relation with stutter on 2188 deadlock states
445 unique states visited
0 strongly connected components in search stack
559 transitions explored
115 items max in DFS search stack
550 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.52222,212392,1,0,3335,821047,296,2282,4028,1.0908e+06,9068
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-12-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-12-LTLFireability-01 finished in 83702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(G(p1))))||G((X(p2) U ((p3&&X(p2))||X(G(p2)))))||(F(!p4)&&(X(p2) U ((p3&&X(p2))||X(G(p2)))))))'
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 142 transition count 132
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 142 transition count 132
Applied a total of 13 rules in 15 ms. Remains 142 /149 variables (removed 7) and now considering 132/149 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10248069241818576045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1278891565914749630.kers'
[2026-05-25 09:09:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10248069241818576045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1278891565914749630.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 142 cols 333 entries
Finished phase 1 with 116 SingleSign rule and 9 generalized
[2026-05-25 09:09:57] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1278891565914749630.kers
Total runtime 1 ms.
[2026-05-25 09:09:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:09:57] [INFO ] Invariant cache hit.
[2026-05-25 09:09:57] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-05-25 09:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/274 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 164 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7734 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 131/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 304 constraints, problems are : Problem set: 0 solved, 131 unsolved in 24783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32528ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 32529ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 132/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32772 ms. Remains : 142/149 places, 132/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(G(p1))))||G((X(p2) U ((p3&&X(p2))||X(G(p2)))))||(F(p4)&&(X(p2) U ((p3&&X(p2))||X(G(p2)))))))'
Stuttering acceptance computed with spot in 807 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p4) (NOT p2)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p4) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 31 factoid took 32 ms. Proved property starting from automaton with 18 states, 47 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 38 ms.
FORMULA MedleyA-PT-12-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-12-LTLFireability-02 finished in 33942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 147 transition count 120
Reduce places removed 28 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 30 rules applied. Total rules applied 59 place count 119 transition count 118
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 118 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 117 transition count 117
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 62 place count 117 transition count 92
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 113 place count 91 transition count 92
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 2 rules applied. Total rules applied 115 place count 90 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 89 transition count 91
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 122 place count 83 transition count 74
Iterating global reduction 6 with 6 rules applied. Total rules applied 128 place count 83 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 128 place count 83 transition count 72
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 132 place count 81 transition count 72
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 178 place count 58 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 192 place count 51 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 51 transition count 69
Applied a total of 193 rules in 38 ms. Remains 51 /149 variables (removed 98) and now considering 69/149 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13052650817649377656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13763600390235493626.kers'
[2026-05-25 09:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13052650817649377656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13763600390235493626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 51 cols 424 entries
Finished phase 1 with 31 SingleSign rule and 5 generalized
[2026-05-25 09:10:31] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13763600390235493626.kers
Total runtime 3 ms.
[2026-05-25 09:10:31] [INFO ] Implicit Places using invariants in 60 ms returned [15, 22, 26, 29]
[2026-05-25 09:10:31] [INFO ] Actually due to overlaps returned [15, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/149 places, 69/149 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 48 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 68
Applied a total of 4 rules in 4 ms. Remains 46 /48 variables (removed 2) and now considering 68/69 (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-11175153009720900473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15719668892862223818.kers'
[2026-05-25 09:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11175153009720900473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15719668892862223818.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 46 cols 363 entries
Finished phase 1 with 31 SingleSign rule and 3 generalized
[2026-05-25 09:10:31] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15719668892862223818.kers
Total runtime 1 ms.
[2026-05-25 09:10:31] [INFO ] Implicit Places using invariants in 58 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/149 places, 68/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 78
Applied a total of 2 rules in 3 ms. Remains 44 /45 variables (removed 1) and now considering 78/68 (removed -10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12146540664384781853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9302463704862165374.kers'
[2026-05-25 09:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12146540664384781853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9302463704862165374.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 44 cols 458 entries
Finished phase 1 with 31 SingleSign rule and 2 generalized
[2026-05-25 09:10:31] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9302463704862165374.kers
Total runtime 0 ms.
[2026-05-25 09:10:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:10:31] [INFO ] Invariant cache hit.
[2026-05-25 09:10:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:10:31] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/149 places, 78/149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 302 ms. Remains : 44/149 places, 78/149 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 54 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 11434 reset in 162 ms.
Stack based approach found an accepted trace after 77942 steps with 8874 reset with depth 14 and stack size 14 in 127 ms.
FORMULA MedleyA-PT-12-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-12-LTLFireability-03 finished in 679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 147 transition count 119
Reduce places removed 29 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 31 rules applied. Total rules applied 61 place count 118 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 117 transition count 117
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 117 transition count 93
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 111 place count 92 transition count 93
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 91 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 90 transition count 92
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 88 transition count 90
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 88 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 118 place count 88 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 120 place count 87 transition count 89
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 166 place count 64 transition count 66
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 180 place count 57 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 57 transition count 86
Applied a total of 181 rules in 13 ms. Remains 57 /149 variables (removed 92) and now considering 86/149 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11820721415960488603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5570605650559463895.kers'
[2026-05-25 09:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11820721415960488603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5570605650559463895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 57 cols 518 entries
Finished phase 1 with 37 SingleSign rule and 5 generalized
[2026-05-25 09:10:31] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5570605650559463895.kers
Total runtime 0 ms.
[2026-05-25 09:10:32] [INFO ] Implicit Places using invariants in 302 ms returned [21, 29, 34, 37]
[2026-05-25 09:10:32] [INFO ] Actually due to overlaps returned [21, 34, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 317 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/149 places, 86/149 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 54 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 51 transition count 84
Applied a total of 6 rules in 4 ms. Remains 51 /54 variables (removed 3) and now considering 84/86 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1143809718639189886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13390805505728444460.kers'
[2026-05-25 09:10:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1143809718639189886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13390805505728444460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 455 entries
Finished phase 1 with 36 SingleSign rule and 3 generalized
[2026-05-25 09:10:32] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13390805505728444460.kers
Total runtime 0 ms.
[2026-05-25 09:10:32] [INFO ] Implicit Places using invariants in 33 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/149 places, 84/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 94
Applied a total of 2 rules in 9 ms. Remains 49 /50 variables (removed 1) and now considering 94/84 (removed -10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9085048228140198863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15801564300329145356.kers'
[2026-05-25 09:10:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9085048228140198863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15801564300329145356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 49 cols 558 entries
Finished phase 1 with 36 SingleSign rule and 2 generalized
[2026-05-25 09:10:32] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15801564300329145356.kers
Total runtime 0 ms.
[2026-05-25 09:10:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:10:32] [INFO ] Invariant cache hit.
[2026-05-25 09:10:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:10:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 49/149 places, 94/149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 468 ms. Remains : 49/149 places, 94/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-04 finished in 537 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(p0))) U (p1&&(p2 U (!p3||X(!p4))))))'
Support contains 9 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 145 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 145 transition count 146
Applied a total of 7 rules in 6 ms. Remains 145 /149 variables (removed 4) and now considering 146/149 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11306091866999939321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1793615959535442430.kers'
[2026-05-25 09:10:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11306091866999939321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1793615959535442430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 145 cols 406 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:10:32] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1793615959535442430.kers
Total runtime 1 ms.
[2026-05-25 09:10:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 09:10:32] [INFO ] Invariant cache hit.
[2026-05-25 09:10:32] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-25 09:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/167 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 169 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12874 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 145/313 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 323 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42896ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 42896ms
Starting structural reductions in LTL mode, iteration 1 : 145/149 places, 146/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43121 ms. Remains : 145/149 places, 146/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U (p1&&(p2 U (!p3||X(!p4))))))'
Stuttering acceptance computed with spot in 900 ms :[(OR (NOT p1) (AND p3 p4)), (NOT p0), (OR (AND (NOT p1) p4) (AND (NOT p0) p4) (AND p3 p4)), (AND p3 p4), (NOT p0), (NOT p0), true, (AND (NOT p0) p4), (AND p3 (NOT p2) p4 (NOT p0)), (AND p4 (NOT p0)), false, (AND p4 p0), (AND p0 p3 p4)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-05
Product exploration explored 100000 steps with 19938 reset in 122 ms.
Product exploration explored 100000 steps with 19998 reset in 76 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge based reduction with 23 factoid took 222 ms. Reduced automaton from 13 states, 26 edges and 5 AP (stutter sensitive) to 13 states, 26 edges and 5 AP (stutter sensitive).
RANDOM walk for 40000 steps (823 resets) in 325 ms. (122 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40004 steps (191 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (204 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (178 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (176 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (188 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (213 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (189 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (165 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (195 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (217 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (208 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (199 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (213 resets) in 50 ms. (784 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (200 resets) in 45 ms. (869 steps per ms) remains 14/14 properties
[2026-05-25 09:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem apf7 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/83 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 20/103 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 5 (OVERLAPS) 42/145 variables, 9/17 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 146/291 variables, 145/162 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/162 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/162 constraints. Problems are: Problem set: 9 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 162 constraints, problems are : Problem set: 9 solved, 5 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/83 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/103 variables, 2/8 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 42/145 variables, 9/17 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/19 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 146/291 variables, 145/164 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 5/169 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/169 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/169 constraints. Problems are: Problem set: 9 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 169 constraints, problems are : Problem set: 9 solved, 5 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1127ms problems are : Problem set: 9 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 277 ms.
Support contains 9 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 146/146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 145 transition count 122
Reduce places removed 24 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 26 rules applied. Total rules applied 50 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 120 transition count 120
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 51 place count 120 transition count 98
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 96 place count 97 transition count 98
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 96 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 95 transition count 97
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 151 place count 69 transition count 71
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 163 place count 63 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 63 transition count 81
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 171 place count 63 transition count 74
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 178 place count 56 transition count 74
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 181 place count 56 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 184 place count 53 transition count 71
Applied a total of 184 rules in 13 ms. Remains 53 /145 variables (removed 92) and now considering 71/146 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 53/145 places, 71/146 transitions.
RANDOM walk for 40000 steps (2423 resets) in 119 ms. (333 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (396 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1695050380123188304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9608061325588531046.kers'
[2026-05-25 09:11:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1695050380123188304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9608061325588531046.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 71 rows 51 cols 353 entries
Finished phase 1 with 33 SingleSign rule and 5 generalized
[2026-05-25 09:11:18] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9608061325588531046.kers
Total runtime 0 ms.
[2026-05-25 09:11:18] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 71/124 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 71/124 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 71/71 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 53 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 50 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 46 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 46 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 45 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 44 transition count 51
Applied a total of 18 rules in 5 ms. Remains 44 /53 variables (removed 9) and now considering 51/71 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 44/53 places, 51/71 transitions.
RANDOM walk for 40000 steps (2753 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (473 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11508 steps, run visited all 1 properties in 16 ms. (steps per millisecond=719 )
Probabilistic random walk after 11508 steps, saw 2869 distinct states, run finished after 16 ms. (steps per millisecond=719 ) properties seen :1
Found 9 invariant AP formulas.
Knowledge based reduction with 32 factoid took 378 ms. Reduced automaton from 13 states, 26 edges and 5 AP (stutter sensitive) to 6 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) p3 p4)), (NOT p0), (OR (AND (NOT p1) p4) (AND (NOT p0) p4)), (NOT p0), (NOT p0), true]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16727581524873427122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3185527973548419752.kers'
[2026-05-25 09:11:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16727581524873427122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3185527973548419752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 145 cols 406 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:11:19] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3185527973548419752.kers
Total runtime 2 ms.
[2026-05-25 09:11:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 09:11:19] [INFO ] [Real]Absence check using 8 positive and 9 generalized place invariants in 13 ms returned sat
[2026-05-25 09:11:20] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2026-05-25 09:11:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:11:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 09:11:20] [INFO ] [Nat]Absence check using 8 positive and 9 generalized place invariants in 6 ms returned sat
[2026-05-25 09:11:20] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2026-05-25 09:11:20] [INFO ] Computed and/alt/rep : 144/251/144 causal constraints (skipped 1 transitions) in 12 ms.
[2026-05-25 09:11:20] [INFO ] Added : 125 causal constraints over 25 iterations in 602 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 4304 ms.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) p3 p4)), (NOT p0), (OR (AND (NOT p1) p4) (AND (NOT p0) p4)), (NOT p0), (NOT p0), true]
Support contains 9 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2026-05-25 09:11:21] [INFO ] Invariant cache hit.
[2026-05-25 09:11:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:11:21] [INFO ] Invariant cache hit.
[2026-05-25 09:11:21] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 145/145 places, 146/146 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge based reduction with 13 factoid took 153 ms. Reduced automaton from 6 states, 10 edges and 5 AP (stutter sensitive) to 6 states, 10 edges and 5 AP (stutter sensitive).
RANDOM walk for 40000 steps (820 resets) in 203 ms. (196 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (204 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (174 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (191 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
[2026-05-25 09:11:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/83 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/145 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 146/291 variables, 145/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 163 constraints, problems are : Problem set: 0 solved, 3 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/83 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/145 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 146/291 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 138 ms.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 146/146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 145 transition count 119
Reduce places removed 27 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 29 rules applied. Total rules applied 56 place count 118 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 117 transition count 117
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 57 place count 117 transition count 94
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 104 place count 93 transition count 94
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 92 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 91 transition count 93
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 159 place count 65 transition count 67
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 173 place count 58 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 58 transition count 87
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 180 place count 58 transition count 81
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 186 place count 52 transition count 81
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 52 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 192 place count 49 transition count 78
Applied a total of 192 rules in 11 ms. Remains 49 /145 variables (removed 96) and now considering 78/146 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 49/145 places, 78/146 transitions.
RANDOM walk for 40000 steps (3000 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (585 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 33848 steps (481 resets) in 31 ms. (1057 steps per ms) remains 0/2 properties
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 6 states, 10 edges and 5 AP (stutter sensitive) to 6 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) p3 p4)), (NOT p0), (OR (AND (NOT p1) p4) (AND (NOT p0) p4)), (NOT p0), (NOT p0), true]
[2026-05-25 09:11:23] [INFO ] Invariant cache hit.
[2026-05-25 09:11:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 09:11:23] [INFO ] [Real]Absence check using 8 positive and 9 generalized place invariants in 8 ms returned sat
[2026-05-25 09:11:23] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-25 09:11:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:11:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 09:11:23] [INFO ] [Nat]Absence check using 8 positive and 9 generalized place invariants in 19 ms returned sat
[2026-05-25 09:11:23] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2026-05-25 09:11:23] [INFO ] Computed and/alt/rep : 144/251/144 causal constraints (skipped 1 transitions) in 12 ms.
[2026-05-25 09:11:24] [INFO ] Added : 125 causal constraints over 25 iterations in 594 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 2688 ms.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) p3 p4)), (NOT p0), (OR (AND (NOT p1) p4) (AND (NOT p0) p4)), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) p3 p4)), (NOT p0), (OR (AND (NOT p1) p4) (AND (NOT p0) p4)), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 20033 reset in 109 ms.
Product exploration explored 100000 steps with 20041 reset in 80 ms.
Spot run failed in 37 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/ltsmin12036161662996417869
[2026-05-25 09:11:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12036161662996417869
Running compilation step : cd /tmp/ltsmin12036161662996417869;'/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 290 ms.
Running link step : cd /tmp/ltsmin12036161662996417869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin12036161662996417869;'/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/stateBased9147388579595914864.hoa' '--buchi-type=spotba'
LTSmin run took 53 ms.
FORMULA MedleyA-PT-12-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-12-LTLFireability-05 finished in 53158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X(p1))||G(p2))))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 146 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 146 transition count 147
Applied a total of 5 rules in 7 ms. Remains 146 /149 variables (removed 3) and now considering 147/149 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1518885339677419604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7516096283227315400.kers'
[2026-05-25 09:11:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1518885339677419604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7516096283227315400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 146 cols 408 entries
Finished phase 1 with 120 SingleSign rule and 9 generalized
[2026-05-25 09:11:25] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7516096283227315400.kers
Total runtime 2 ms.
[2026-05-25 09:11:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:11:25] [INFO ] Invariant cache hit.
[2026-05-25 09:11:25] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 09:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/293 variables, 146/169 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 171 constraints, problems are : Problem set: 0 solved, 146 unsolved in 12285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/293 variables, 146/170 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 146/316 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 14 (OVERLAPS) 0/293 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 325 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42332ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 42333ms
Starting structural reductions in LTL mode, iteration 1 : 146/149 places, 147/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42608 ms. Remains : 146/149 places, 147/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1)||p2)))))'
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-06 finished in 43165 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)||G(p1)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 147 transition count 119
Reduce places removed 29 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 31 rules applied. Total rules applied 61 place count 118 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 117 transition count 117
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 117 transition count 93
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 111 place count 92 transition count 93
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 91 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 90 transition count 92
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 120 place count 84 transition count 75
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 84 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 126 place count 84 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 130 place count 82 transition count 73
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 180 place count 57 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 194 place count 50 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 50 transition count 68
Applied a total of 195 rules in 27 ms. Remains 50 /149 variables (removed 99) and now considering 68/149 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12262791659239240177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-886527763798435112.kers'
[2026-05-25 09:12:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12262791659239240177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-886527763798435112.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 50 cols 437 entries
Finished phase 1 with 30 SingleSign rule and 5 generalized
[2026-05-25 09:12:08] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-886527763798435112.kers
Total runtime 1 ms.
[2026-05-25 09:12:08] [INFO ] Implicit Places using invariants in 58 ms returned [14, 21, 26, 29]
[2026-05-25 09:12:08] [INFO ] Actually due to overlaps returned [14, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/149 places, 68/149 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 67
Applied a total of 4 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 67/68 (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-2994441570691632455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-257256650673321333.kers'
[2026-05-25 09:12:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2994441570691632455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-257256650673321333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 45 cols 376 entries
Finished phase 1 with 30 SingleSign rule and 3 generalized
[2026-05-25 09:12:08] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-257256650673321333.kers
Total runtime 0 ms.
[2026-05-25 09:12:08] [INFO ] Implicit Places using invariants in 58 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/149 places, 67/149 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 150 ms. Remains : 44/149 places, 67/149 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)||G(p1)))'
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-07
Entered a terminal (fully accepting) state of product in 290 steps with 33 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-07 finished in 282 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 147 transition count 122
Reduce places removed 26 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 28 rules applied. Total rules applied 55 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 120 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 119 transition count 119
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 58 place count 119 transition count 96
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 47 rules applied. Total rules applied 105 place count 95 transition count 96
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 2 rules applied. Total rules applied 107 place count 94 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 93 transition count 95
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 113 place count 88 transition count 79
Iterating global reduction 6 with 5 rules applied. Total rules applied 118 place count 88 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 118 place count 88 transition count 78
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 120 place count 87 transition count 78
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 168 place count 63 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 182 place count 56 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 56 transition count 67
Applied a total of 183 rules in 11 ms. Remains 56 /149 variables (removed 93) and now considering 67/149 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11715512750025388061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8895995353872340304.kers'
[2026-05-25 09:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11715512750025388061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8895995353872340304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 56 cols 340 entries
Finished phase 1 with 36 SingleSign rule and 5 generalized
[2026-05-25 09:12:09] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8895995353872340304.kers
Total runtime 1 ms.
[2026-05-25 09:12:09] [INFO ] Implicit Places using invariants in 58 ms returned [15, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/149 places, 67/149 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 54/149 places, 67/149 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 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 9693 reset in 190 ms.
Product exploration explored 100000 steps with 9632 reset in 163 ms.
Computed a total of 2 stabilizing places and 10 stable transitions
Computed a total of 2 stabilizing places and 10 stable transitions
Knowledge based reduction with 5 factoid took 36 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 1432 steps (132 resets) in 6 ms. (204 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 243 ms.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 67/67 (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-11584696277459655660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11059240734679549929.kers'
[2026-05-25 09:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11584696277459655660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11059240734679549929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 54 cols 315 entries
Finished phase 1 with 35 SingleSign rule and 6 generalized
[2026-05-25 09:12:09] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11059240734679549929.kers
Total runtime 0 ms.
[2026-05-25 09:12:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:12:09] [INFO ] Invariant cache hit.
[2026-05-25 09:12:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 09:12:10] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-25 09:12:10] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-25 09:12:10] [INFO ] Invariant cache hit.
[2026-05-25 09:12:10] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 67/121 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 71 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 67/121 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 59/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 132 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2681 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3735ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3827 ms. Remains : 54/54 places, 67/67 transitions.
Computed a total of 2 stabilizing places and 10 stable transitions
Computed a total of 2 stabilizing places and 10 stable transitions
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 1521 steps (148 resets) in 9 ms. (152 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 385 ms.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 9652 reset in 178 ms.
Product exploration explored 100000 steps with 9696 reset in 120 ms.
Built C files in :
/tmp/ltsmin3187290964313469427
[2026-05-25 09:12:14] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2026-05-25 09:12:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:12:14] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2026-05-25 09:12:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:12:14] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2026-05-25 09:12:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:12:14] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3187290964313469427
Running compilation step : cd /tmp/ltsmin3187290964313469427;'/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 189 ms.
Running link step : cd /tmp/ltsmin3187290964313469427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3187290964313469427;'/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/stateBased2257253406651116969.hoa' '--buchi-type=spotba'
LTSmin run took 408 ms.
FORMULA MedleyA-PT-12-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-12-LTLFireability-08 finished in 6536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(G(p1))) U X(p2)))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 145 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 145 transition count 146
Applied a total of 7 rules in 7 ms. Remains 145 /149 variables (removed 4) and now considering 146/149 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3010184278696007588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16413652368086590243.kers'
[2026-05-25 09:12:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3010184278696007588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16413652368086590243.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 145 cols 406 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:12:15] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16413652368086590243.kers
Total runtime 2 ms.
[2026-05-25 09:12:15] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 09:12:15] [INFO ] Invariant cache hit.
[2026-05-25 09:12:15] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-25 09:12:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/167 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 169 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12628 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 145/313 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 323 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42685ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 42685ms
Starting structural reductions in LTL mode, iteration 1 : 145/149 places, 146/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42943 ms. Remains : 145/149 places, 146/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(G(p1))) U X(p2)))'
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-10 finished in 43328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(G(p0))))) U (p1||(F(p3)&&p2))))'
Support contains 10 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 145 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 145 transition count 146
Applied a total of 7 rules in 7 ms. Remains 145 /149 variables (removed 4) and now considering 146/149 (removed 3) transitions.
[2026-05-25 09:12:58] [INFO ] Invariant cache hit.
[2026-05-25 09:12:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 09:12:59] [INFO ] Invariant cache hit.
[2026-05-25 09:12:59] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 145/149 places, 146/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 145/149 places, 146/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(G(p0))))) U (p1||(F(p3)&&p2))))'
Stuttering acceptance computed with spot in 555 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (NOT p3)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-11 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(X(F(p1)))))))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 141 transition count 131
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 141 transition count 131
Applied a total of 15 rules in 7 ms. Remains 141 /149 variables (removed 8) and now considering 131/149 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17425305366663186102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2215622593511221946.kers'
[2026-05-25 09:12:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17425305366663186102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2215622593511221946.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 141 cols 331 entries
Finished phase 1 with 115 SingleSign rule and 9 generalized
[2026-05-25 09:12:59] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2215622593511221946.kers
Total runtime 3 ms.
[2026-05-25 09:12:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 09:12:59] [INFO ] Invariant cache hit.
[2026-05-25 09:13:00] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-25 09:13:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 131/272 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 165 constraints, problems are : Problem set: 0 solved, 130 unsolved in 13742 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/294 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 303 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43772ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 43774ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 131/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44126 ms. Remains : 141/149 places, 131/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-12
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-12 finished in 44456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!p0 U (p1||G(!p0))))) U (X(!p2)&&F(!p3)))))'
Support contains 10 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 145 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 145 transition count 146
Applied a total of 7 rules in 6 ms. Remains 145 /149 variables (removed 4) and now considering 146/149 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6822059725892777420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17130716928414525405.kers'
[2026-05-25 09:13:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6822059725892777420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17130716928414525405.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 145 cols 406 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:13:44] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17130716928414525405.kers
Total runtime 2 ms.
[2026-05-25 09:13:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 09:13:44] [INFO ] Invariant cache hit.
[2026-05-25 09:13:44] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-25 09:13:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/167 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 169 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 145/313 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 323 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42238ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 42238ms
Starting structural reductions in LTL mode, iteration 1 : 145/149 places, 146/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42487 ms. Remains : 145/149 places, 146/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!p0 U (G(!p0)||p1)))) U (X(!p2)&&F(!p3)))))'
Stuttering acceptance computed with spot in 233 ms :[(OR p2 p3), (OR p2 p3), p2, p3, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 29 ms. Proved property starting from automaton with 6 states, 12 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA MedleyA-PT-12-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-12-LTLFireability-13 finished in 42942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 147 transition count 120
Reduce places removed 28 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 30 rules applied. Total rules applied 59 place count 119 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 118 transition count 118
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 60 place count 118 transition count 91
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 115 place count 90 transition count 91
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 89 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 88 transition count 90
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 124 place count 82 transition count 73
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 82 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 130 place count 82 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 134 place count 80 transition count 71
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 184 place count 55 transition count 46
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 198 place count 48 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 48 transition count 60
Applied a total of 199 rules in 20 ms. Remains 48 /149 variables (removed 101) and now considering 60/149 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10328408242388083138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16109425350758917451.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10328408242388083138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16109425350758917451.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 48 cols 282 entries
Finished phase 1 with 28 SingleSign rule and 5 generalized
[2026-05-25 09:14:27] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16109425350758917451.kers
Total runtime 1 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 95 ms returned [15, 22, 26, 29]
[2026-05-25 09:14:27] [INFO ] Actually due to overlaps returned [15, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/149 places, 60/149 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 45 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 43 transition count 59
Applied a total of 4 rules in 5 ms. Remains 43 /45 variables (removed 2) and now considering 59/60 (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-6400993385687583728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9698550561983719791.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6400993385687583728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9698550561983719791.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 43 cols 251 entries
Finished phase 1 with 28 SingleSign rule and 3 generalized
[2026-05-25 09:14:27] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9698550561983719791.kers
Total runtime 0 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 54 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/149 places, 59/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 61
Applied a total of 2 rules in 2 ms. Remains 41 /42 variables (removed 1) and now considering 61/59 (removed -2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10924754166769507699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5346117252008186294.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10924754166769507699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5346117252008186294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 41 cols 260 entries
Finished phase 1 with 28 SingleSign rule and 2 generalized
[2026-05-25 09:14:27] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5346117252008186294.kers
Total runtime 1 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 09:14:27] [INFO ] Invariant cache hit.
[2026-05-25 09:14:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 41/149 places, 61/149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 287 ms. Remains : 41/149 places, 61/149 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 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-14
Stuttering criterion allowed to conclude after 31 steps with 7 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-14 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G((p0 U p1)) U p0))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 147 transition count 123
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 122 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 120 transition count 121
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 55 place count 120 transition count 95
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 108 place count 93 transition count 95
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 93 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 92 transition count 94
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 116 place count 86 transition count 77
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 86 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 122 place count 86 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 84 transition count 75
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 176 place count 59 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 188 place count 53 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 53 transition count 70
Applied a total of 189 rules in 10 ms. Remains 53 /149 variables (removed 96) and now considering 70/149 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10702315636472274325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3701529357308865964.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10702315636472274325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3701529357308865964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 53 cols 441 entries
Finished phase 1 with 29 SingleSign rule and 8 generalized
[2026-05-25 09:14:27] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3701529357308865964.kers
Total runtime 0 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 46 ms returned [7, 17, 24, 28, 31]
[2026-05-25 09:14:27] [INFO ] Actually due to overlaps returned [17, 28, 31, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 60 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/149 places, 70/149 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 49 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 46 transition count 68
Applied a total of 6 rules in 2 ms. Remains 46 /49 variables (removed 3) and now considering 68/70 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17151278131518736287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3190726714024274191.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17151278131518736287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3190726714024274191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 46 cols 375 entries
Finished phase 1 with 31 SingleSign rule and 3 generalized
[2026-05-25 09:14:27] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3190726714024274191.kers
Total runtime 0 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 44 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/149 places, 68/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 78
Applied a total of 2 rules in 2 ms. Remains 44 /45 variables (removed 1) and now considering 78/68 (removed -10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12737690339207445452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10878006709187982938.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12737690339207445452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10878006709187982938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 44 cols 478 entries
Finished phase 1 with 31 SingleSign rule and 2 generalized
[2026-05-25 09:14:27] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10878006709187982938.kers
Total runtime 1 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 09:14:27] [INFO ] Invariant cache hit.
[2026-05-25 09:14:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/149 places, 78/149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 240 ms. Remains : 44/149 places, 78/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G((p0 U p1)) U p0))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), p1]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-15 finished in 331 ms.
All properties solved by simple procedures.
Total runtime 405382 ms.

BK_STOP 1779700467908

--------------------
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-12"
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-12, 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-177969019900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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