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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 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 39K 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-13-LTLCardinality-00
FORMULA_NAME MedleyA-PT-13-LTLCardinality-01
FORMULA_NAME MedleyA-PT-13-LTLCardinality-02
FORMULA_NAME MedleyA-PT-13-LTLCardinality-03
FORMULA_NAME MedleyA-PT-13-LTLCardinality-04
FORMULA_NAME MedleyA-PT-13-LTLCardinality-05
FORMULA_NAME MedleyA-PT-13-LTLCardinality-06
FORMULA_NAME MedleyA-PT-13-LTLCardinality-07
FORMULA_NAME MedleyA-PT-13-LTLCardinality-08
FORMULA_NAME MedleyA-PT-13-LTLCardinality-09
FORMULA_NAME MedleyA-PT-13-LTLCardinality-10
FORMULA_NAME MedleyA-PT-13-LTLCardinality-11
FORMULA_NAME MedleyA-PT-13-LTLCardinality-12
FORMULA_NAME MedleyA-PT-13-LTLCardinality-13
FORMULA_NAME MedleyA-PT-13-LTLCardinality-14
FORMULA_NAME MedleyA-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779700220274

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:10:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:10:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:10:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2026-05-25 09:10:21] [INFO ] Transformed 173 places.
[2026-05-25 09:10:21] [INFO ] Transformed 159 transitions.
[2026-05-25 09:10:21] [INFO ] Found NUPN structural information;
[2026-05-25 09:10:21] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-13-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 157 transition count 148
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 157 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 155 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 155 transition count 146
Applied a total of 31 rules in 50 ms. Remains 155 /173 variables (removed 18) and now considering 146/159 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4369402908170686738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11699767827502172003.kers'
[2026-05-25 09:10:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4369402908170686738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11699767827502172003.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 155 cols 363 entries
Finished phase 1 with 126 SingleSign rule and 13 generalized
[2026-05-25 09:10:22] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11699767827502172003.kers
Total runtime 2 ms.
[2026-05-25 09:10:22] [INFO ] Implicit Places using invariants in 324 ms returned [33, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 355 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 146/159 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 153/173 places, 146/159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 146/146 (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-15569853389696513694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14636442490837672787.kers'
[2026-05-25 09:10:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15569853389696513694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14636442490837672787.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 146 rows 153 cols 359 entries
Finished phase 1 with 130 SingleSign rule and 9 generalized
[2026-05-25 09:10:22] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14636442490837672787.kers
Total runtime 4 ms.
[2026-05-25 09:10:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 09:10:22] [INFO ] Invariant cache hit.
[2026-05-25 09:10:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-25 09:10:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 146/299 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (OVERLAPS) 0/299 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 187 constraints, problems are : Problem set: 0 solved, 145 unsolved in 19621 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/299 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 145/332 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 343 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 49691ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 49706ms
Finished structural reductions in LTL mode , in 1 iterations and 50000 ms. Remains : 153/153 places, 146/146 transitions.
Support contains 38 out of 153 places after structural reductions.
[2026-05-25 09:11:12] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:11:12] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:11:12] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 36 out of 153 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (1140 resets) in 1263 ms. (31 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40003 steps (285 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2026-05-25 09:11:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/80 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/153 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/299 variables, 153/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/299 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 153/153 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) 54/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/80 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/153 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 153/299 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA MedleyA-PT-13-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 152 transition count 115
Reduce places removed 30 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 32 rules applied. Total rules applied 62 place count 122 transition count 113
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 64 place count 121 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 120 transition count 112
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 65 place count 120 transition count 84
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 57 rules applied. Total rules applied 122 place count 91 transition count 84
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 124 place count 90 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 89 transition count 83
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 132 place count 82 transition count 76
Iterating global reduction 6 with 7 rules applied. Total rules applied 139 place count 82 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 139 place count 82 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 143 place count 80 transition count 74
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 79 transition count 73
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 79 transition count 73
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 191 place count 56 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 207 place count 48 transition count 70
Applied a total of 207 rules in 41 ms. Remains 48 /153 variables (removed 105) and now considering 70/146 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12981851639357276933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1420591156172494964.kers'
[2026-05-25 09:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12981851639357276933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1420591156172494964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 48 cols 316 entries
Finished phase 1 with 29 SingleSign rule and 7 generalized
[2026-05-25 09:11:14] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1420591156172494964.kers
Total runtime 3 ms.
[2026-05-25 09:11:14] [INFO ] Implicit Places using invariants in 75 ms returned [0, 12, 22, 26, 29]
[2026-05-25 09:11:14] [INFO ] Actually due to overlaps returned [12, 26, 0, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/153 places, 70/146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 43 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 39 transition count 65
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 2 with 2 rules applied. Total rules applied 12 place count 38 transition count 65
Applied a total of 12 rules in 15 ms. Remains 38 /44 variables (removed 6) and now considering 65/70 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14764040563600307718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7401826392697617427.kers'
[2026-05-25 09:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14764040563600307718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7401826392697617427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 38 cols 274 entries
Finished phase 1 with 26 SingleSign rule and 4 generalized
[2026-05-25 09:11:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7401826392697617427.kers
Total runtime 1 ms.
[2026-05-25 09:11:14] [INFO ] Implicit Places using invariants in 53 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/153 places, 65/146 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 36 transition count 67
Applied a total of 2 rules in 5 ms. Remains 36 /37 variables (removed 1) and now considering 67/65 (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-11204703920533250323.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3739912289237705889.kers'
[2026-05-25 09:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11204703920533250323.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3739912289237705889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 36 cols 283 entries
Finished phase 1 with 27 SingleSign rule and 2 generalized
[2026-05-25 09:11:14] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3739912289237705889.kers
Total runtime 1 ms.
[2026-05-25 09:11:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 09:11:14] [INFO ] Invariant cache hit.
[2026-05-25 09:11:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 09:11:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 36/153 places, 67/146 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 304 ms. Remains : 36/153 places, 67/146 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 231 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-00
Product exploration explored 100000 steps with 19230 reset in 238 ms.
Stack based approach found an accepted trace after 33496 steps with 6440 reset with depth 19 and stack size 18 in 52 ms.
FORMULA MedleyA-PT-13-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-00 finished in 976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 142 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 142 transition count 135
Applied a total of 22 rules in 32 ms. Remains 142 /153 variables (removed 11) and now considering 135/146 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16466226774587751019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2446778691462456631.kers'
[2026-05-25 09:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16466226774587751019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2446778691462456631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 142 cols 337 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:11:14] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2446778691462456631.kers
Total runtime 2 ms.
[2026-05-25 09:11:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 09:11:15] [INFO ] Invariant cache hit.
[2026-05-25 09:11:15] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-25 09:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/277 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 159 constraints, problems are : Problem set: 0 solved, 134 unsolved in 11971 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/277 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 134/293 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 304 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42011ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 42013ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 135/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42339 ms. Remains : 142/153 places, 135/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 100 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 3 factoid took 27 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA MedleyA-PT-13-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLCardinality-03 finished in 42796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 141 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 141 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 140 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 140 transition count 133
Applied a total of 26 rules in 17 ms. Remains 140 /153 variables (removed 13) and now considering 133/146 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7201062725135421301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10609607228365611280.kers'
[2026-05-25 09:11:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7201062725135421301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10609607228365611280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 140 cols 329 entries
Finished phase 1 with 117 SingleSign rule and 9 generalized
[2026-05-25 09:11:57] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10609607228365611280.kers
Total runtime 2 ms.
[2026-05-25 09:11:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:11:57] [INFO ] Invariant cache hit.
[2026-05-25 09:11:57] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-25 09:11:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 133/273 variables, 140/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 160 constraints, problems are : Problem set: 0 solved, 132 unsolved in 12122 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/292 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 25140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 37282ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 37287ms
Starting structural reductions in LTL mode, iteration 1 : 140/153 places, 133/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37510 ms. Remains : 140/153 places, 133/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 131 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 5 factoid took 11 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 13 ms.
FORMULA MedleyA-PT-13-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLCardinality-04 finished in 37982 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(X(!p1)) U ((p1&&X(X(!p1)))||X(X(G(!p1)))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 138
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 143 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 143 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 142 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 142 transition count 135
Applied a total of 22 rules in 10 ms. Remains 142 /153 variables (removed 11) and now considering 135/146 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9495657854585602427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16765842832604686749.kers'
[2026-05-25 09:12:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9495657854585602427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16765842832604686749.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 142 cols 333 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:12:35] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16765842832604686749.kers
Total runtime 1 ms.
[2026-05-25 09:12:35] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 09:12:35] [INFO ] Invariant cache hit.
[2026-05-25 09:12:35] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-25 09:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/277 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 164 constraints, problems are : Problem set: 0 solved, 134 unsolved in 15211 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 135/277 variables, 142/165 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 134/299 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/277 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 306 constraints, problems are : Problem set: 0 solved, 134 unsolved in 26255 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41490ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 41491ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 135/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41782 ms. Remains : 142/153 places, 135/146 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(X(!p1)) U ((p1&&X(X(!p1)))||X(X(G(!p1)))))))'
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) p1), p1, p1, (AND p1 (NOT p0)), p1, (AND (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-05 finished in 42301 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&&X((p0 U (!p1||G(p0))))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 136
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 140 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 140 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 139 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 139 transition count 132
Applied a total of 28 rules in 16 ms. Remains 139 /153 variables (removed 14) and now considering 132/146 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-354168276203757603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13286754484677306381.kers'
[2026-05-25 09:13:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-354168276203757603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13286754484677306381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 139 cols 327 entries
Finished phase 1 with 116 SingleSign rule and 9 generalized
[2026-05-25 09:13:17] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13286754484677306381.kers
Total runtime 2 ms.
[2026-05-25 09:13:18] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 09:13:18] [INFO ] Invariant cache hit.
[2026-05-25 09:13:18] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-05-25 09:13:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 156 constraints, problems are : Problem set: 0 solved, 131 unsolved in 10223 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 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/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 293 constraints, problems are : Problem set: 0 solved, 131 unsolved in 21046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 31293ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 31299ms
Starting structural reductions in LTL mode, iteration 1 : 139/153 places, 132/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31750 ms. Remains : 139/153 places, 132/146 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&&X((p0 U (!p1||G(p0))))))))'
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-07
Product exploration explored 100000 steps with 2838 reset in 203 ms.
Product exploration explored 100000 steps with 2847 reset in 197 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 9 factoid took 97 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 19324 steps (540 resets) in 229 ms. (84 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Knowledge-based reduction took 490 ms.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2026-05-25 09:13:51] [INFO ] Invariant cache hit.
[2026-05-25 09:13:51] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 09:13:51] [INFO ] Invariant cache hit.
[2026-05-25 09:13:51] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 139/139 places, 132/132 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 9 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 21864 steps (616 resets) in 106 ms. (204 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Knowledge-based reduction took 492 ms.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 2862 reset in 174 ms.
Product exploration explored 100000 steps with 2849 reset in 108 ms.
Spot run failed in 85 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/ltsmin4390830894912203784
[2026-05-25 09:13:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4390830894912203784
Running compilation step : cd /tmp/ltsmin4390830894912203784;'/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 511 ms.
Running link step : cd /tmp/ltsmin4390830894912203784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin4390830894912203784;'/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/stateBased17015148671134069928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2026-05-25 09:14:07] [INFO ] Invariant cache hit.
[2026-05-25 09:14:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:14:07] [INFO ] Invariant cache hit.
[2026-05-25 09:14:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 139/139 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin6594025964958151038
[2026-05-25 09:14:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6594025964958151038
Running compilation step : cd /tmp/ltsmin6594025964958151038;'/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 205 ms.
Running link step : cd /tmp/ltsmin6594025964958151038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6594025964958151038;'/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/stateBased7334790398078469225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:14:22] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:22] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:22] [INFO ] Time to serialize gal into /tmp/LTL11062665376436612180.gal : 2 ms
[2026-05-25 09:14:22] [INFO ] Time to serialize properties into /tmp/LTL5146705656929527581.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/LTL11062665376436612180.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15667058579788716299.hoa' '-atoms' '/tmp/LTL5146705656929527581.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...319
Loading property file /tmp/LTL5146705656929527581.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15667058579788716299.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t21, t39, t41, t48, t53, t60, t63, t66, t68, t70, t84, t87, t98, Intersection with reach...231
Computing Next relation with stutter on 168 deadlock states
3477 unique states visited
0 strongly connected components in search stack
6675 transitions explored
142 items max in DFS search stack
632 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,6.35169,223888,1,0,9582,906568,301,11514,3923,1.52484e+06,30658
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-13-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-13-LTLCardinality-07 finished in 72792 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||X(G(p1)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 142 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 142 transition count 135
Applied a total of 22 rules in 9 ms. Remains 142 /153 variables (removed 11) and now considering 135/146 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-110304117226208529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12915398531486197761.kers'
[2026-05-25 09:14:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-110304117226208529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12915398531486197761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 142 cols 337 entries
Finished phase 1 with 119 SingleSign rule and 9 generalized
[2026-05-25 09:14:30] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12915398531486197761.kers
Total runtime 2 ms.
[2026-05-25 09:14:30] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 09:14:30] [INFO ] Invariant cache hit.
[2026-05-25 09:14:31] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-25 09:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/277 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 159 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8181 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/277 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 134/293 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 304 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 38197ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 38197ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 135/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38531 ms. Remains : 142/153 places, 135/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p1)))'
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-08 finished in 38669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U p2)) U p3)&&X(p4)))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 146 transition count 139
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 146 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 145 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 145 transition count 138
Applied a total of 16 rules in 3 ms. Remains 145 /153 variables (removed 8) and now considering 138/146 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13815547412879571233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16065312220202026833.kers'
[2026-05-25 09:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13815547412879571233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16065312220202026833.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 145 cols 343 entries
Finished phase 1 with 122 SingleSign rule and 9 generalized
[2026-05-25 09:15:09] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16065312220202026833.kers
Total runtime 1 ms.
[2026-05-25 09:15:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:15:09] [INFO ] Invariant cache hit.
[2026-05-25 09:15:09] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-25 09:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 138/283 variables, 145/162 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 162 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6813 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 138/283 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 137/305 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 15 (OVERLAPS) 0/283 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 312 constraints, problems are : Problem set: 0 solved, 137 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 36833ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 36833ms
Starting structural reductions in LTL mode, iteration 1 : 145/153 places, 138/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37053 ms. Remains : 145/153 places, 138/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U p2)) U p3)&&X(p4)))'
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p3) (NOT p4)), true, (NOT p2), (NOT p2), (NOT p3), (NOT p4)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-11 finished in 37352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(p1)||p0)))) U G(p2)))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 138
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 142 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 141 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 141 transition count 134
Applied a total of 24 rules in 6 ms. Remains 141 /153 variables (removed 12) and now considering 134/146 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3779708151568247840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8319150069959906613.kers'
[2026-05-25 09:15:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3779708151568247840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8319150069959906613.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 141 cols 331 entries
Finished phase 1 with 118 SingleSign rule and 9 generalized
[2026-05-25 09:15:46] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8319150069959906613.kers
Total runtime 1 ms.
[2026-05-25 09:15:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:15:46] [INFO ] Invariant cache hit.
[2026-05-25 09:15:47] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-25 09:15:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 161 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12849 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/294 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 8/302 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 305 constraints, problems are : Problem set: 0 solved, 133 unsolved in 24120 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36995ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 36996ms
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 134/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37273 ms. Remains : 141/153 places, 134/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(p1)||p0)))) U G(p2)))'
Stuttering acceptance computed with spot in 496 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-12
Product exploration explored 100000 steps with 19990 reset in 122 ms.
Product exploration explored 100000 steps with 19991 reset in 101 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 3 factoid took 105 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1145 resets) in 224 ms. (177 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (281 resets) in 351 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (271 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (281 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (274 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (279 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (276 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
[2026-05-25 09:16:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/141 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 134/275 variables, 141/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 155 constraints, problems are : Problem set: 0 solved, 6 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 64/141 variables, 8/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 134/275 variables, 141/156 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 3/159 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 159 constraints, problems are : Problem set: 3 solved, 3 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 3 solved, 3 unsolved
Finished Parikh walk after 7883 steps, including 165 resets, run visited all 3 properties in 38 ms. (steps per millisecond=207 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 44 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 6 factoid took 182 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p2)]
Knowledge-based reduction took 1206 ms.
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Support contains 2 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 134/134 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 140 transition count 103
Reduce places removed 30 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 32 rules applied. Total rules applied 62 place count 110 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 109 transition count 101
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 63 place count 109 transition count 75
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 116 place count 82 transition count 75
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 118 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 80 transition count 74
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 163 place count 58 transition count 52
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
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 177 place count 51 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 178 place count 51 transition count 60
Applied a total of 178 rules in 28 ms. Remains 51 /141 variables (removed 90) and now considering 60/134 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7395793298039880068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17843812032838443188.kers'
[2026-05-25 09:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7395793298039880068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17843812032838443188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 51 cols 250 entries
Finished phase 1 with 33 SingleSign rule and 6 generalized
[2026-05-25 09:16:26] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17843812032838443188.kers
Total runtime 1 ms.
[2026-05-25 09:16:26] [INFO ] Implicit Places using invariants in 78 ms returned [0, 10, 17, 24, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 79 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/141 places, 60/134 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 46 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 41 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 14 place count 39 transition count 53
Applied a total of 14 rules in 7 ms. Remains 39 /46 variables (removed 7) and now considering 53/60 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7857199487095286329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4747108241370812505.kers'
[2026-05-25 09:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7857199487095286329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4747108241370812505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 39 cols 195 entries
Finished phase 1 with 30 SingleSign rule and 2 generalized
[2026-05-25 09:16:26] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4747108241370812505.kers
Total runtime 1 ms.
[2026-05-25 09:16:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 09:16:26] [INFO ] Invariant cache hit.
[2026-05-25 09:16:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:16:26] [INFO ] Implicit Places using invariants and state equation in 48 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 2 : 39/141 places, 53/134 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 39/141 places, 53/134 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 741 steps (121 resets) in 9 ms. (74 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p2)]
Knowledge-based reduction took 246 ms.
Stuttering acceptance computed with spot in 63 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2)]
Product exploration explored 100000 steps with 15752 reset in 125 ms.
Stack based approach found an accepted trace after 58292 steps with 9188 reset with depth 11 and stack size 11 in 50 ms.
FORMULA MedleyA-PT-13-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-12 finished in 40071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 141 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 141 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 140 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 140 transition count 133
Applied a total of 26 rules in 7 ms. Remains 140 /153 variables (removed 13) and now considering 133/146 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13421002357004489140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14900405002277620097.kers'
[2026-05-25 09:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13421002357004489140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14900405002277620097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 140 cols 329 entries
Finished phase 1 with 117 SingleSign rule and 9 generalized
[2026-05-25 09:16:26] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14900405002277620097.kers
Total runtime 2 ms.
[2026-05-25 09:16:26] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:16:27] [INFO ] Invariant cache hit.
[2026-05-25 09:16:27] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-25 09:16:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 159 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11130 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/291 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 298 constraints, problems are : Problem set: 0 solved, 132 unsolved in 22567 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33716ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 33717ms
Starting structural reductions in LTL mode, iteration 1 : 140/153 places, 133/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33991 ms. Remains : 140/153 places, 133/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-13
Product exploration explored 100000 steps with 25000 reset in 97 ms.
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 51 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 381 ms.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2026-05-25 09:17:01] [INFO ] Invariant cache hit.
[2026-05-25 09:17:02] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:17:02] [INFO ] Invariant cache hit.
[2026-05-25 09:17:02] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 140/140 places, 133/133 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge based reduction with 1 factoid took 41 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 226 ms.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 87 ms.
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Spot run failed in 77 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/ltsmin10473148692717382645
[2026-05-25 09:17:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10473148692717382645
Running compilation step : cd /tmp/ltsmin10473148692717382645;'/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 208 ms.
Running link step : cd /tmp/ltsmin10473148692717382645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10473148692717382645;'/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/stateBased15575542547468277409.hoa' '--buchi-type=spotba'
LTSmin run took 21 ms.
FORMULA MedleyA-PT-13-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLCardinality-13 finished in 36473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G((p1||G(p2))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 146/146 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 142 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 141 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 141 transition count 134
Applied a total of 24 rules in 9 ms. Remains 141 /153 variables (removed 12) and now considering 134/146 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4999478929783041667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12343993525256216588.kers'
[2026-05-25 09:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4999478929783041667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12343993525256216588.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 141 cols 331 entries
Finished phase 1 with 118 SingleSign rule and 9 generalized
[2026-05-25 09:17:03] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12343993525256216588.kers
Total runtime 1 ms.
[2026-05-25 09:17:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:17:03] [INFO ] Invariant cache hit.
[2026-05-25 09:17:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-25 09:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 159 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/292 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 299 constraints, problems are : Problem set: 0 solved, 133 unsolved in 21445 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32612ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 32613ms
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 134/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32917 ms. Remains : 141/153 places, 134/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G((p1||G(p2))))))'
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-14 finished in 33179 ms.
All properties solved by simple procedures.
Total runtime 434701 ms.

BK_STOP 1779700656588

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-13"
export BK_EXAMINATION="LTLCardinality"
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-13, examination is LTLCardinality"
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-177969020000195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-13.tgz
mv MedleyA-PT-13 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;