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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 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 150K 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-23-LTLCardinality-00
FORMULA_NAME MedleyA-PT-23-LTLCardinality-01
FORMULA_NAME MedleyA-PT-23-LTLCardinality-02
FORMULA_NAME MedleyA-PT-23-LTLCardinality-03
FORMULA_NAME MedleyA-PT-23-LTLCardinality-04
FORMULA_NAME MedleyA-PT-23-LTLCardinality-05
FORMULA_NAME MedleyA-PT-23-LTLCardinality-06
FORMULA_NAME MedleyA-PT-23-LTLCardinality-07
FORMULA_NAME MedleyA-PT-23-LTLCardinality-08
FORMULA_NAME MedleyA-PT-23-LTLCardinality-09
FORMULA_NAME MedleyA-PT-23-LTLCardinality-10
FORMULA_NAME MedleyA-PT-23-LTLCardinality-11
FORMULA_NAME MedleyA-PT-23-LTLCardinality-12
FORMULA_NAME MedleyA-PT-23-LTLCardinality-13
FORMULA_NAME MedleyA-PT-23-LTLCardinality-14
FORMULA_NAME MedleyA-PT-23-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779703544601

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-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 10:05:46] [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 10:05:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:05:46] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-25 10:05:46] [INFO ] Transformed 378 places.
[2026-05-25 10:05:46] [INFO ] Transformed 614 transitions.
[2026-05-25 10:05:46] [INFO ] Found NUPN structural information;
[2026-05-25 10:05:46] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-23-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 93 place count 285 transition count 524
Iterating global reduction 1 with 90 rules applied. Total rules applied 183 place count 285 transition count 524
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 251 place count 217 transition count 456
Iterating global reduction 1 with 68 rules applied. Total rules applied 319 place count 217 transition count 456
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 347 place count 189 transition count 406
Iterating global reduction 1 with 28 rules applied. Total rules applied 375 place count 189 transition count 406
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 387 place count 177 transition count 372
Iterating global reduction 1 with 12 rules applied. Total rules applied 399 place count 177 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 401 place count 177 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 406 place count 172 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 411 place count 172 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 416 place count 172 transition count 353
Applied a total of 416 rules in 92 ms. Remains 172 /378 variables (removed 206) and now considering 353/614 (removed 261) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4999740835790630236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9043075036977544405.kers'
[2026-05-25 10:05:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4999740835790630236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9043075036977544405.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 353 rows 172 cols 1222 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-25 10:05:46] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9043075036977544405.kers
Total runtime 2 ms.
[2026-05-25 10:05:47] [INFO ] Implicit Places using invariants in 450 ms returned []
[2026-05-25 10:05:47] [INFO ] Invariant cache hit.
[2026-05-25 10:05:47] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2026-05-25 10:05:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (OVERLAPS) 353/525 variables, 172/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 184 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 353/525 variables, 172/181 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 352/533 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 539 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in LTL mode, iteration 1 : 172/378 places, 353/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61358 ms. Remains : 172/378 places, 353/614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2026-05-25 10:06:47] [INFO ] Invariant cache hit.
[2026-05-25 10:06:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 10:06:48] [INFO ] Invariant cache hit.
[2026-05-25 10:06:48] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 172/172 places, 353/353 transitions.
Support contains 21 out of 172 places after structural reductions.
[2026-05-25 10:06:48] [INFO ] Flatten gal took : 46 ms
[2026-05-25 10:06:48] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:06:48] [INFO ] Input system was already deterministic with 353 transitions.
RANDOM walk for 40000 steps (34 resets) in 2053 ms. (19 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40000 steps (21 resets) in 286 ms. (139 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31754 steps (58 resets) in 83 ms. (378 steps per ms) remains 0/1 properties
Computed a total of 17 stabilizing places and 22 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(F(p0))||F(p1)))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Graph (trivial) has 140 edges and 172 vertex of which 20 / 172 are part of one of the 3 SCC in 2 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 154 transition count 313
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 142 transition count 312
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 142 transition count 303
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 133 transition count 303
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 120 transition count 278
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 120 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 120 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 120 transition count 276
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 119 transition count 276
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 116 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 116 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 116 transition count 267
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 115 transition count 264
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 115 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 115 transition count 263
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 131 place count 91 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 135 place count 91 transition count 235
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 141 place count 85 transition count 217
Iterating global reduction 6 with 6 rules applied. Total rules applied 147 place count 85 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 150 place count 85 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 152 place count 84 transition count 213
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 170 place count 75 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 179 place count 75 transition count 219
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 182 place count 72 transition count 210
Iterating global reduction 7 with 3 rules applied. Total rules applied 185 place count 72 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 188 place count 72 transition count 207
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 190 place count 70 transition count 205
Applied a total of 190 rules in 97 ms. Remains 70 /172 variables (removed 102) and now considering 205/353 (removed 148) transitions.
[2026-05-25 10:06:49] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2448382803940098733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4018279666292229417.kers'
[2026-05-25 10:06:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2448382803940098733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4018279666292229417.kers]
Normalized transition count is 194 out of 195 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 194 rows 69 cols 719 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 10:06:49] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4018279666292229417.kers
Total runtime 1 ms.
[2026-05-25 10:06:49] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 10:06:49] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2026-05-25 10:06:49] [INFO ] Invariant cache hit.
[2026-05-25 10:06:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:06:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2026-05-25 10:06:49] [INFO ] Redundant transitions in 4 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-25 10:06:49] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2026-05-25 10:06:49] [INFO ] Invariant cache hit.
[2026-05-25 10:06:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 191/258 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 6/264 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 80 constraints, problems are : Problem set: 0 solved, 177 unsolved in 11111 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 191/258 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 6/264 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 176/258 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/264 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 259 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19522 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 30696ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 30697ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/172 places, 205/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31046 ms. Remains : 70/172 places, 205/353 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(F(p0))||F(p1)))))'
Stuttering acceptance computed with spot in 459 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-00
Product exploration explored 100000 steps with 33891 reset in 308 ms.
Product exploration explored 100000 steps with 33837 reset in 238 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (28 resets) in 769 ms. (51 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (26 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
[2026-05-25 10:07:22] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2026-05-25 10:07:22] [INFO ] Invariant cache hit.
[2026-05-25 10:07:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/119 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 133/252 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/260 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/261 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/264 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/264 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 15/119 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 252/265 variables, and 65 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/8 constraints, State Equation: 60/70 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 756 ms.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 205/205 transitions.
Applied a total of 0 rules in 40 ms. Remains 70 /70 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2026-05-25 10:07:22] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2026-05-25 10:07:22] [INFO ] Invariant cache hit.
[2026-05-25 10:07:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 10:07:22] [INFO ] Flow matrix only has 195 transitions (discarded 10 similar events)
[2026-05-25 10:07:22] [INFO ] Invariant cache hit.
[2026-05-25 10:07:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:07:22] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2026-05-25 10:07:22] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 70/70 places, 205/205 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 62 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 30161 steps (31 resets) in 58 ms. (511 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 276 ms.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 137 ms.
Stuttering criterion allowed to conclude after 105 steps with 12 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-00 finished in 34052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(p1) U X(p0)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 163 transition count 338
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 163 transition count 338
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 158 transition count 330
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 158 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 158 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 157 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 157 transition count 326
Applied a total of 31 rules in 11 ms. Remains 157 /172 variables (removed 15) and now considering 326/353 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15234118289682061848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4518699550027663286.kers'
[2026-05-25 10:07:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15234118289682061848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4518699550027663286.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 157 cols 1120 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-25 10:07:23] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4518699550027663286.kers
Total runtime 5 ms.
[2026-05-25 10:07:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 10:07:23] [INFO ] Invariant cache hit.
[2026-05-25 10:07:23] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 10:07:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/483 variables, 157/165 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 0/483 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 169 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/483 variables, 157/166 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 325/491 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 496 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 157/172 places, 326/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 157/172 places, 326/353 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) U X(p1))&&p1)))'
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 24 ms. Proved property starting from automaton with 6 states, 9 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA MedleyA-PT-23-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLCardinality-03 finished in 61097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Graph (trivial) has 139 edges and 172 vertex of which 20 / 172 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 154 transition count 314
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 143 transition count 314
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 23 place count 143 transition count 305
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 134 transition count 305
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 54 place count 121 transition count 282
Iterating global reduction 2 with 13 rules applied. Total rules applied 67 place count 121 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 67 place count 121 transition count 281
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 69 place count 120 transition count 281
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 117 transition count 273
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 117 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 117 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 116 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 116 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 116 transition count 268
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 127 place count 92 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 131 place count 92 transition count 240
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 138 place count 85 transition count 219
Iterating global reduction 5 with 7 rules applied. Total rules applied 145 place count 85 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 148 place count 85 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 84 transition count 215
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 170 place count 74 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 179 place count 74 transition count 222
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 181 place count 72 transition count 216
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 72 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 185 place count 72 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 187 place count 70 transition count 212
Applied a total of 187 rules in 82 ms. Remains 70 /172 variables (removed 102) and now considering 212/353 (removed 141) transitions.
[2026-05-25 10:08:24] [INFO ] Flow matrix only has 202 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8749237128457038742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5136599026518630938.kers'
[2026-05-25 10:08:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8749237128457038742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5136599026518630938.kers]
Normalized transition count is 201 out of 202 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 201 rows 69 cols 745 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 10:08:24] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5136599026518630938.kers
Total runtime 4 ms.
[2026-05-25 10:08:24] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 10:08:24] [INFO ] Flow matrix only has 202 transitions (discarded 10 similar events)
[2026-05-25 10:08:24] [INFO ] Invariant cache hit.
[2026-05-25 10:08:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:08:24] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-25 10:08:25] [INFO ] Redundant transitions in 3 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-25 10:08:25] [INFO ] Flow matrix only has 202 transitions (discarded 10 similar events)
[2026-05-25 10:08:25] [INFO ] Invariant cache hit.
[2026-05-25 10:08:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 198/265 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 6/271 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 81 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 198/265 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 6/271 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 181/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 263 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 25432ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 25433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/172 places, 212/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25748 ms. Remains : 70/172 places, 212/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-04 finished in 25959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 162 transition count 337
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 162 transition count 337
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 155 transition count 326
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 155 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 155 transition count 325
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 152 transition count 319
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 152 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 152 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 151 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 151 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 151 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 150 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 150 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 150 transition count 310
Applied a total of 49 rules in 21 ms. Remains 150 /172 variables (removed 22) and now considering 310/353 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4306981487580503885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4419694430694147481.kers'
[2026-05-25 10:08:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4306981487580503885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4419694430694147481.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 150 cols 1082 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:08:50] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4419694430694147481.kers
Total runtime 1 ms.
[2026-05-25 10:08:50] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 10:08:50] [INFO ] Invariant cache hit.
[2026-05-25 10:08:50] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-25 10:08:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/460 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/460 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 163 constraints, problems are : Problem set: 0 solved, 309 unsolved in 25127 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/460 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 309/469 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 477 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 55217ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 55218ms
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 310/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55590 ms. Remains : 150/172 places, 310/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-06 finished in 55735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 162 transition count 337
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 162 transition count 337
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 154 transition count 325
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 154 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 154 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 150 transition count 315
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 150 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 150 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 149 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 149 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 149 transition count 309
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 148 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 148 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 148 transition count 306
Applied a total of 53 rules in 28 ms. Remains 148 /172 variables (removed 24) and now considering 306/353 (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-18208873523886800290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3696812170879641878.kers'
[2026-05-25 10:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18208873523886800290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3696812170879641878.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 306 rows 148 cols 1062 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-25 10:09:46] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3696812170879641878.kers
Total runtime 1 ms.
[2026-05-25 10:09:46] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-25 10:09:46] [INFO ] Invariant cache hit.
[2026-05-25 10:09:46] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-25 10:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 306/454 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 0/454 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 160 constraints, problems are : Problem set: 0 solved, 305 unsolved in 24714 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 306/454 variables, 148/158 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 305/463 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
SMT process timed out in 54837ms, After SMT, problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 54838ms
Starting structural reductions in LTL mode, iteration 1 : 148/172 places, 306/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55320 ms. Remains : 148/172 places, 306/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Product exploration explored 100000 steps with 33333 reset in 125 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 10 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 14 ms.
FORMULA MedleyA-PT-23-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLCardinality-09 finished in 55722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1&&(G(p2)||F(G(p3)))))))'
Support contains 8 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 164 transition count 343
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 164 transition count 343
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 158 transition count 334
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 158 transition count 334
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 155 transition count 328
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 155 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 155 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 154 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 154 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 154 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 153 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 153 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 153 transition count 319
Applied a total of 42 rules in 8 ms. Remains 153 /172 variables (removed 19) and now considering 319/353 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15679666949974136429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12246826560549068804.kers'
[2026-05-25 10:10:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15679666949974136429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12246826560549068804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 153 cols 1118 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-25 10:10:42] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12246826560549068804.kers
Total runtime 2 ms.
[2026-05-25 10:10:42] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 10:10:42] [INFO ] Invariant cache hit.
[2026-05-25 10:10:42] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2026-05-25 10:10:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 319/472 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 165 constraints, problems are : Problem set: 0 solved, 318 unsolved in 28043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/472 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 318/480 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 488 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 58120ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 58121ms
Starting structural reductions in LTL mode, iteration 1 : 153/172 places, 319/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58451 ms. Remains : 153/172 places, 319/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1&&(G(p2)||F(G(p3)))))))'
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-11
Product exploration explored 100000 steps with 33384 reset in 133 ms.
Product exploration explored 100000 steps with 33464 reset in 168 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge based reduction with 35 factoid took 287 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (39 resets) in 582 ms. (68 steps per ms) remains 9/20 properties
BEST_FIRST walk for 40002 steps (33 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (48 resets) in 62 ms. (634 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (15 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
[2026-05-25 10:11:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 241/274 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/308 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 142/450 variables, 98/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 17/467 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/472 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/472 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 161 constraints, problems are : Problem set: 0 solved, 2 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 241/274 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/308 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 142/450 variables, 98/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/467 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf18 is UNSAT
At refinement iteration 13 (OVERLAPS) 5/472 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 163 constraints, problems are : Problem set: 1 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 327 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 36 factoid took 879 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 2631 ms.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 319/319 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2026-05-25 10:11:44] [INFO ] Invariant cache hit.
[2026-05-25 10:11:44] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 10:11:44] [INFO ] Invariant cache hit.
[2026-05-25 10:11:44] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 153/153 places, 319/319 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge based reduction with 29 factoid took 440 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 27 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (35 resets) in 294 ms. (135 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40003 steps (16 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2026-05-25 10:11:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/64 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/288 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 151/439 variables, 71/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/463 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/472 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/472 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/64 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/288 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 151/439 variables, 71/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/463 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/472 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/472 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-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]
After SMT, in 536ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 180 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 29 factoid took 773 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 2271 ms.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 33121 reset in 141 ms.
Product exploration explored 100000 steps with 33300 reset in 145 ms.
Spot run failed in 150 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/ltsmin12231714487502920489
[2026-05-25 10:11:48] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12231714487502920489
Running compilation step : cd /tmp/ltsmin12231714487502920489;'/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 737 ms.
Running link step : cd /tmp/ltsmin12231714487502920489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin12231714487502920489;'/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/stateBased929198497587969621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 319/319 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2026-05-25 10:12:03] [INFO ] Invariant cache hit.
[2026-05-25 10:12:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 10:12:03] [INFO ] Invariant cache hit.
[2026-05-25 10:12:03] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 153/153 places, 319/319 transitions.
Built C files in :
/tmp/ltsmin10262994957547865002
[2026-05-25 10:12:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10262994957547865002
Running compilation step : cd /tmp/ltsmin10262994957547865002;'/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 514 ms.
Running link step : cd /tmp/ltsmin10262994957547865002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10262994957547865002;'/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/stateBased6567820006840998372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:12:18] [INFO ] Flatten gal took : 35 ms
[2026-05-25 10:12:18] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:12:18] [INFO ] Time to serialize gal into /tmp/LTL5862558749316898888.gal : 4 ms
[2026-05-25 10:12:18] [INFO ] Time to serialize properties into /tmp/LTL9864522184575102895.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/LTL5862558749316898888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14047382792173034137.hoa' '-atoms' '/tmp/LTL9864522184575102895.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9864522184575102895.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14047382792173034137.hoa
Detected timeout of ITS tools.
[2026-05-25 10:12:34] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:12:34] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:12:34] [INFO ] Time to serialize gal into /tmp/LTL14771122820007746701.gal : 3 ms
[2026-05-25 10:12:34] [INFO ] Time to serialize properties into /tmp/LTL6117020385667724378.ltl : 7 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/LTL14771122820007746701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6117020385667724378.ltl' '-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...276
Read 1 LTL properties
Checking formula 0 : !((G((X("((p115==0)||(p80==1))"))U(("((p114==0)||(p377==1))")&&((G("((p230==0)||(p247==1))"))||(F(G("((p209==0)||(p180==1))"))))))))
Formula 0 simplified : F(X!"((p115==0)||(p80==1))" R (!"((p114==0)||(p377==1))" | (F!"((p230==0)||(p247==1))" & GF!"((p209==0)||(p180==1))")))
Detected timeout of ITS tools.
[2026-05-25 10:12:49] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:12:49] [INFO ] Applying decomposition
[2026-05-25 10:12:49] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2561000054547577113.txt' '-o' '/tmp/graph2561000054547577113.bin' '-w' '/tmp/graph2561000054547577113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2561000054547577113.bin' '-l' '-1' '-v' '-w' '/tmp/graph2561000054547577113.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:12:49] [INFO ] Decomposing Gal with order
[2026-05-25 10:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:12:49] [INFO ] Removed a total of 474 redundant transitions.
[2026-05-25 10:12:49] [INFO ] Flatten gal took : 217 ms
[2026-05-25 10:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 8 ms.
[2026-05-25 10:12:49] [INFO ] Time to serialize gal into /tmp/LTL2950699721066328277.gal : 4 ms
[2026-05-25 10:12:49] [INFO ] Time to serialize properties into /tmp/LTL16475742193234416596.ltl : 0 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/LTL2950699721066328277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16475742193234416596.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i2.u12.p115==0)||(i2.u16.p80==1))"))U(("((i2.u8.p114==0)||(i9.u47.p377==1))")&&((G("((i4.u27.p230==0)||(i6.u30.p247==1))"))...208
Formula 0 simplified : F(X!"((i2.u12.p115==0)||(i2.u16.p80==1))" R (!"((i2.u8.p114==0)||(i9.u47.p377==1))" | (F!"((i4.u27.p230==0)||(i6.u30.p247==1))" & GF...197
Reverse transition relation is NOT exact ! Due to transitions t21, t64, t159, t161, t162, t169, t189, t198, t200, t201, t215, t224, t226, t227, t233, t234,...899
Computing Next relation with stutter on 140724 deadlock states
34 unique states visited
34 strongly connected components in search stack
35 transitions explored
34 items max in DFS search stack
569 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.73224,135904,1,0,198017,854,3983,437149,378,3210,522651
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-23-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-23-LTLCardinality-11 finished in 133727 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(F((p0&&X(X(F(p0)))))))))'
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 353/353 transitions.
Graph (trivial) has 142 edges and 172 vertex of which 20 / 172 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 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 154 transition count 312
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 141 transition count 311
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 28 place count 141 transition count 302
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 132 transition count 302
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 60 place count 118 transition count 278
Iterating global reduction 2 with 14 rules applied. Total rules applied 74 place count 118 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 118 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 75 place count 118 transition count 276
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 77 place count 117 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 115 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 115 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 115 transition count 269
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 130 place count 91 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 134 place count 91 transition count 241
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 141 place count 84 transition count 220
Iterating global reduction 5 with 7 rules applied. Total rules applied 148 place count 84 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 151 place count 84 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 153 place count 83 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 171 place count 74 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 180 place count 74 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 183 place count 71 transition count 213
Iterating global reduction 6 with 3 rules applied. Total rules applied 186 place count 71 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 189 place count 71 transition count 210
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 69 transition count 208
Applied a total of 191 rules in 67 ms. Remains 69 /172 variables (removed 103) and now considering 208/353 (removed 145) transitions.
[2026-05-25 10:12:55] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18216043761637088640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16925466921224911022.kers'
[2026-05-25 10:12:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18216043761637088640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16925466921224911022.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 197 rows 68 cols 731 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-25 10:12:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16925466921224911022.kers
Total runtime 14 ms.
[2026-05-25 10:12:56] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 10:12:56] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2026-05-25 10:12:56] [INFO ] Invariant cache hit.
[2026-05-25 10:12:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:12:56] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2026-05-25 10:12:56] [INFO ] Redundant transitions in 3 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-25 10:12:56] [INFO ] Flow matrix only has 198 transitions (discarded 10 similar events)
[2026-05-25 10:12:56] [INFO ] Invariant cache hit.
[2026-05-25 10:12:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/260 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 6/266 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/266 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/267 variables, and 80 constraints, problems are : Problem set: 0 solved, 179 unsolved in 12831 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 194/260 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 6/266 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 179/259 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/267 variables, and 260 constraints, problems are : Problem set: 0 solved, 179 unsolved in 17930 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 30804ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 30805ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/172 places, 208/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31274 ms. Remains : 69/172 places, 208/353 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(F((p0&&X(X(F(p0)))))))))'
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-14 finished in 31596 ms.
All properties solved by simple procedures.
Total runtime 461310 ms.

BK_STOP 1779704007464

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ 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-23"
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-23, 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-177969020000275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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