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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 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 26K 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-03-LTLCardinality-00
FORMULA_NAME MedleyA-PT-03-LTLCardinality-01
FORMULA_NAME MedleyA-PT-03-LTLCardinality-02
FORMULA_NAME MedleyA-PT-03-LTLCardinality-03
FORMULA_NAME MedleyA-PT-03-LTLCardinality-04
FORMULA_NAME MedleyA-PT-03-LTLCardinality-05
FORMULA_NAME MedleyA-PT-03-LTLCardinality-06
FORMULA_NAME MedleyA-PT-03-LTLCardinality-07
FORMULA_NAME MedleyA-PT-03-LTLCardinality-08
FORMULA_NAME MedleyA-PT-03-LTLCardinality-09
FORMULA_NAME MedleyA-PT-03-LTLCardinality-10
FORMULA_NAME MedleyA-PT-03-LTLCardinality-11
FORMULA_NAME MedleyA-PT-03-LTLCardinality-12
FORMULA_NAME MedleyA-PT-03-LTLCardinality-13
FORMULA_NAME MedleyA-PT-03-LTLCardinality-14
FORMULA_NAME MedleyA-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699028664

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:50:30] [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 08:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:50:30] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2026-05-25 08:50:30] [INFO ] Transformed 108 places.
[2026-05-25 08:50:30] [INFO ] Transformed 100 transitions.
[2026-05-25 08:50:30] [INFO ] Found NUPN structural information;
[2026-05-25 08:50:30] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 99 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 99 transition count 91
Applied a total of 18 rules in 22 ms. Remains 99 /108 variables (removed 9) and now considering 91/100 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10009599572886332518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12133561206886247310.kers'
[2026-05-25 08:50:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10009599572886332518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12133561206886247310.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 99 cols 254 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-25 08:50:30] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12133561206886247310.kers
Total runtime 13 ms.
[2026-05-25 08:50:30] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-25 08:50:30] [INFO ] Invariant cache hit.
[2026-05-25 08:50:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-25 08:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/190 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 121 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5886 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/190 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 90/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 221 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35958ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 35974ms
Starting structural reductions in LTL mode, iteration 1 : 99/108 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36455 ms. Remains : 99/108 places, 91/100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-25 08:51:07] [INFO ] Invariant cache hit.
[2026-05-25 08:51:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 08:51:07] [INFO ] Invariant cache hit.
[2026-05-25 08:51:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 99/99 places, 91/91 transitions.
Support contains 23 out of 99 places after structural reductions.
[2026-05-25 08:51:07] [INFO ] Flatten gal took : 35 ms
[2026-05-25 08:51:07] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:51:07] [INFO ] Input system was already deterministic with 91 transitions.
RANDOM walk for 40000 steps (660 resets) in 710 ms. (56 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40002 steps (183 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (178 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (157 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
[2026-05-25 08:51:07] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/99 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 91/190 variables, 99/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 108 constraints, problems are : Problem set: 0 solved, 3 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/99 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 91/190 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 112 constraints, problems are : Problem set: 0 solved, 3 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 181 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 91/91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 99 transition count 75
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 83 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 32 place count 83 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 76 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 74 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 74 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 74 transition count 65
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 52 place count 73 transition count 65
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 2 with 46 rules applied. Total rules applied 98 place count 50 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 50 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 49 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 48 transition count 40
Applied a total of 101 rules in 27 ms. Remains 48 /99 variables (removed 51) and now considering 40/91 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 48/99 places, 40/91 transitions.
RANDOM walk for 40000 steps (2126 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (617 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11084 steps, run visited all 1 properties in 29 ms. (steps per millisecond=382 )
Probabilistic random walk after 11084 steps, saw 4949 distinct states, run finished after 36 ms. (steps per millisecond=307 ) properties seen :1
FORMULA MedleyA-PT-03-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 99 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(F((p0&&F(p1)))))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 94 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 94 transition count 87
Applied a total of 9 rules in 12 ms. Remains 94 /99 variables (removed 5) and now considering 87/91 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6630234273682881603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8616876831395476994.kers'
[2026-05-25 08:51:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6630234273682881603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8616876831395476994.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 94 cols 245 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 08:51:08] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8616876831395476994.kers
Total runtime 0 ms.
[2026-05-25 08:51:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 08:51:08] [INFO ] Invariant cache hit.
[2026-05-25 08:51:09] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-25 08:51:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 109 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3726 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33777ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 33781ms
Starting structural reductions in LTL mode, iteration 1 : 94/99 places, 87/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33968 ms. Remains : 94/99 places, 87/91 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-05
Stuttering criterion allowed to conclude after 77 steps with 1 reset in 4 ms.
FORMULA MedleyA-PT-03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-05 finished in 34420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Graph (complete) has 177 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 82 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 31 place count 82 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 47 place count 74 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 73 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 73 transition count 66
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 2 with 46 rules applied. Total rules applied 95 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 49 transition count 42
Applied a total of 96 rules in 37 ms. Remains 49 /99 variables (removed 50) and now considering 42/91 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15528039894421541876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17451463411077736428.kers'
[2026-05-25 08:51:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15528039894421541876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17451463411077736428.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 42 rows 48 cols 155 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 08:51:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17451463411077736428.kers
Total runtime 0 ms.
[2026-05-25 08:51:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 08:51:43] [INFO ] Invariant cache hit.
[2026-05-25 08:51:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2026-05-25 08:51:43] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2026-05-25 08:51:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 42/91 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 59 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 42/91 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 41/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 100 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2240ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/99 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2407 ms. Remains : 49/99 places, 42/91 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 5884 reset in 156 ms.
Product exploration explored 100000 steps with 5872 reset in 157 ms.
Computed a total of 49 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 42
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 44 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2362 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (914 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4324 steps, run visited all 1 properties in 13 ms. (steps per millisecond=332 )
Probabilistic random walk after 4324 steps, saw 1809 distinct states, run finished after 13 ms. (steps per millisecond=332 ) properties seen :1
Knowledge based reduction with 4 factoid took 54 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 283 ms.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 08:51:46] [INFO ] Invariant cache hit.
[2026-05-25 08:51:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 08:51:46] [INFO ] Invariant cache hit.
[2026-05-25 08:51:46] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-05-25 08:51:46] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 49/49 places, 42/42 transitions.
Computed a total of 49 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 42
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 40 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2420 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (907 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4324 steps, run visited all 1 properties in 13 ms. (steps per millisecond=332 )
Probabilistic random walk after 4324 steps, saw 1809 distinct states, run finished after 13 ms. (steps per millisecond=332 ) properties seen :1
Knowledge based reduction with 4 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 307 ms.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5877 reset in 90 ms.
Product exploration explored 100000 steps with 5899 reset in 119 ms.
Built C files in :
/tmp/ltsmin317145452440257463
[2026-05-25 08:51:47] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2026-05-25 08:51:47] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:51:47] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2026-05-25 08:51:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:51:47] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2026-05-25 08:51:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:51:47] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin317145452440257463
Running compilation step : cd /tmp/ltsmin317145452440257463;'/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 237 ms.
Running link step : cd /tmp/ltsmin317145452440257463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin317145452440257463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11074680344056679044.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA MedleyA-PT-03-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-03-LTLCardinality-06 finished in 4403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Graph (complete) has 177 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 97 transition count 77
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 84 transition count 77
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 27 place count 84 transition count 70
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 41 place count 77 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 76 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 76 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 76 transition count 68
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 45 place count 75 transition count 68
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 2 with 46 rules applied. Total rules applied 91 place count 52 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 51 transition count 44
Applied a total of 92 rules in 9 ms. Remains 51 /99 variables (removed 48) and now considering 44/91 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1655215881686700135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17008971805196155122.kers'
[2026-05-25 08:51:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1655215881686700135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17008971805196155122.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 44 rows 50 cols 159 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 08:51:47] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17008971805196155122.kers
Total runtime 8 ms.
[2026-05-25 08:51:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 08:51:47] [INFO ] Invariant cache hit.
[2026-05-25 08:51:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-25 08:51:47] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-25 08:51:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 44/94 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/95 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 60 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 44/94 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/95 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/95 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 103 constraints, problems are : Problem set: 0 solved, 42 unsolved in 2649 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4008ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 4009ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/99 places, 44/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4176 ms. Remains : 51/99 places, 44/91 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 71 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 5458 reset in 100 ms.
Product exploration explored 100000 steps with 5556 reset in 130 ms.
Computed a total of 51 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 44
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 10 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 60 ms.
FORMULA MedleyA-PT-03-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLCardinality-08 finished in 4607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Graph (complete) has 177 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 98 transition count 76
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 83 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 82 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 33 place count 82 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 49 place count 74 transition count 67
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 72 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 72 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 72 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 71 transition count 64
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 3 with 44 rules applied. Total rules applied 99 place count 49 transition count 42
Applied a total of 99 rules in 9 ms. Remains 49 /99 variables (removed 50) and now considering 42/91 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5633044483471037349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2348873159615427562.kers'
[2026-05-25 08:51:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5633044483471037349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2348873159615427562.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 42 rows 49 cols 165 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 08:51:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2348873159615427562.kers
Total runtime 0 ms.
[2026-05-25 08:51:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 08:51:52] [INFO ] Invariant cache hit.
[2026-05-25 08:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 08:51:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2026-05-25 08:51:52] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2026-05-25 08:51:52] [INFO ] Invariant cache hit.
[2026-05-25 08:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 42/91 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 59 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/91 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 41/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 100 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3291 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4387ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 4388ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/99 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4572 ms. Remains : 49/99 places, 42/91 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-09
Stuttering criterion allowed to conclude after 19 steps with 2 reset in 1 ms.
FORMULA MedleyA-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-09 finished in 4697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0 U (G(!p1) U p2)))||(p3 U G(p4)))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 85
Applied a total of 12 rules in 1 ms. Remains 93 /99 variables (removed 6) and now considering 85/91 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13533823110788457495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10151436781162231236.kers'
[2026-05-25 08:51:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13533823110788457495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10151436781162231236.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 93 cols 242 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 08:51:56] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10151436781162231236.kers
Total runtime 1 ms.
[2026-05-25 08:51:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 08:51:57] [INFO ] Invariant cache hit.
[2026-05-25 08:51:57] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-25 08:51:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/178 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 106 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/178 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 84/190 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 193 constraints, problems are : Problem set: 0 solved, 84 unsolved in 13902 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16940ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 16941ms
Starting structural reductions in LTL mode, iteration 1 : 93/99 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17074 ms. Remains : 93/99 places, 85/91 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((X((p0 U (G(!p1) U p2)))||(p3 U G(p4)))))'
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p4) (NOT p2)), (AND (NOT p4) (NOT p2))]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Computed a total of 93 stabilizing places and 85 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 85
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 16 ms. Proved property starting from automaton with 2 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 88 ms.
FORMULA MedleyA-PT-03-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLCardinality-10 finished in 17487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Graph (complete) has 177 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 81 transition count 74
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 33 place count 81 transition count 66
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 49 place count 73 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 71 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 71 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 71 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 70 transition count 63
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 97 place count 49 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 49 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 48 transition count 41
Applied a total of 99 rules in 27 ms. Remains 48 /99 variables (removed 51) and now considering 41/91 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10574508974761445914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14500893977350537607.kers'
[2026-05-25 08:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10574508974761445914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14500893977350537607.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 41 rows 47 cols 153 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-25 08:52:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14500893977350537607.kers
Total runtime 2 ms.
[2026-05-25 08:52:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 08:52:14] [INFO ] Invariant cache hit.
[2026-05-25 08:52:14] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2026-05-25 08:52:14] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-25 08:52:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/88 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 56 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/88 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/89 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3346ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/99 places, 41/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3582 ms. Remains : 48/99 places, 41/91 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 59 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-12
Product exploration explored 100000 steps with 6674 reset in 86 ms.
Product exploration explored 100000 steps with 6639 reset in 96 ms.
Computed a total of 48 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 26 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 76 ms.
FORMULA MedleyA-PT-03-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLCardinality-12 finished in 3936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 93 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 93 transition count 86
Applied a total of 11 rules in 5 ms. Remains 93 /99 variables (removed 6) and now considering 86/91 (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-11135185389741458088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6018677339691310942.kers'
[2026-05-25 08:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11135185389741458088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6018677339691310942.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 93 cols 243 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 08:52:18] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6018677339691310942.kers
Total runtime 1 ms.
[2026-05-25 08:52:18] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 08:52:18] [INFO ] Invariant cache hit.
[2026-05-25 08:52:18] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 08:52:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 105 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5579 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/190 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/179 variables, and 201 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35626ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 35628ms
Starting structural reductions in LTL mode, iteration 1 : 93/99 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35922 ms. Remains : 93/99 places, 86/91 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 460 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-15 finished in 36451 ms.
All properties solved by simple procedures.
Total runtime 144572 ms.

BK_STOP 1779699175240

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

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