Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499200275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 ErlangenMainframeV2-PT-bP09C09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.5K May 27 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 27 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 09:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 09:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 16K May 27 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 27 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 27 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 70M May 26 18:17 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 ErlangenMainframeV2-PT-bP09C09-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV2-PT-bP09C09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780396247663

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP09C09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-02 10:30:49] [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-06-02 10:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 10:30:53] [INFO ] Load time of PNML (sax parser for PT used): 3557 ms
[2026-06-02 10:30:53] [INFO ] Transformed 339 places.
[2026-06-02 10:30:54] [INFO ] Transformed 59407 transitions.
[2026-06-02 10:30:54] [INFO ] Found NUPN structural information;
[2026-06-02 10:30:54] [INFO ] Parsed PT model containing 339 places and 59407 transitions and 1378759 arcs in 4303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 59407/59407 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 273 transition count 59341
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 273 transition count 59341
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 171 place count 234 transition count 59302
Iterating global reduction 0 with 39 rules applied. Total rules applied 210 place count 234 transition count 59302
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 222 place count 222 transition count 39904
Ensure Unique test removed 2 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 236 place count 220 transition count 39904
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 247 place count 209 transition count 1099
Iterating global reduction 0 with 11 rules applied. Total rules applied 258 place count 209 transition count 1099
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 262 place count 205 transition count 1093
Iterating global reduction 0 with 4 rules applied. Total rules applied 266 place count 205 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 267 place count 204 transition count 1092
Iterating global reduction 0 with 1 rules applied. Total rules applied 268 place count 204 transition count 1092
Applied a total of 268 rules in 13750 ms. Remains 204 /339 variables (removed 135) and now considering 1092/59407 (removed 58315) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2039491154186944638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17475086712740353052.kers'
[2026-06-02 10:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2039491154186944638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17475086712740353052.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1092 rows 204 cols 19061 entries
Finished phase 1 with 177 SingleSign rule and 3 generalized
[2026-06-02 10:31:08] [INFO ] Computed 24 invariants in 12 ms
Computed 24 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-17475086712740353052.kers
Total runtime 17 ms.
[2026-06-02 10:31:10] [INFO ] Implicit Places using invariants in 1651 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1717 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/339 places, 1092/59407 transitions.
Applied a total of 0 rules in 14 ms. Remains 203 /203 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15506 ms. Remains : 203/339 places, 1092/59407 transitions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Applied a total of 0 rules in 13 ms. Remains 203 /203 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17244520129451823366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10652631025593321339.kers'
[2026-06-02 10:31:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17244520129451823366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10652631025593321339.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 1092 rows 203 cols 18197 entries
Finished phase 1 with 177 SingleSign rule and 3 generalized
[2026-06-02 10:31:10] [INFO ] Computed 23 invariants in 19 ms
Computed 23 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-10652631025593321339.kers
Total runtime 23 ms.
[2026-06-02 10:31:11] [INFO ] Implicit Places using invariants in 728 ms returned []
[2026-06-02 10:31:11] [INFO ] Invariant cache hit.
[2026-06-02 10:31:12] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
Running 1091 sub problems to find dead transitions.
[2026-06-02 10:31:12] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 2 (OVERLAPS) 1/203 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/1295 variables, and 25 constraints, problems are : Problem set: 0 solved, 1091 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 1091/195 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1091 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 2 (OVERLAPS) 1/203 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/1295 variables, and 27 constraints, problems are : Problem set: 0 solved, 1091 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 896/195 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62487ms problems are : Problem set: 0 solved, 1091 unsolved
Search for dead transitions found 0 dead transitions in 62553ms
Finished structural reductions in LTL mode , in 1 iterations and 64727 ms. Remains : 203/203 places, 1092/1092 transitions.
Support contains 34 out of 203 places after structural reductions.
[2026-06-02 10:32:15] [INFO ] Flatten gal took : 457 ms
[2026-06-02 10:32:16] [INFO ] Flatten gal took : 234 ms
[2026-06-02 10:32:16] [INFO ] Input system was already deterministic with 1092 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 4722 ms. (8 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40002 steps (8 resets) in 435 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 658 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 816 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 634 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 561 ms. (71 steps per ms) remains 6/6 properties
[2026-06-02 10:32:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 65/123 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 80/203 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1092/1295 variables, 203/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1295 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1295 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 226 constraints, problems are : Problem set: 0 solved, 6 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 65/123 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 80/203 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 6369ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Graph (trivial) has 165 edges and 203 vertex of which 11 / 203 are part of one of the 5 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 197 transition count 1042
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 51 rules applied. Total rules applied 90 place count 159 transition count 1029
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 152 transition count 1029
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 97 place count 152 transition count 1018
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 119 place count 141 transition count 1018
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 137 transition count 919
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 137 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 127 place count 137 transition count 918
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 136 transition count 918
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 134 transition count 630
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 133 transition count 630
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 132 transition count 438
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 132 transition count 438
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 228 place count 86 transition count 392
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 231 place count 86 transition count 389
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 235 place count 82 transition count 347
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 82 transition count 347
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 253 place count 75 transition count 354
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 260 place count 75 transition count 347
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 261 place count 74 transition count 345
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 74 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 265 place count 74 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 267 place count 73 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 278 place count 73 transition count 345
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 290 place count 73 transition count 333
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 322 place count 61 transition count 313
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 60 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 327 place count 60 transition count 309
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 329 place count 60 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 331 place count 58 transition count 417
Applied a total of 331 rules in 495 ms. Remains 58 /203 variables (removed 145) and now considering 417/1092 (removed 675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 58/203 places, 417/1092 transitions.
RANDOM walk for 370 steps (0 resets) in 40 ms. (9 steps per ms) remains 0/6 properties
Computed a total of 21 stabilizing places and 21 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(X(X(F(p1)))))))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Graph (trivial) has 169 edges and 203 vertex of which 11 / 203 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 196 transition count 1048
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 50 rules applied. Total rules applied 87 place count 160 transition count 1034
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 152 transition count 1034
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 95 place count 152 transition count 1024
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 115 place count 142 transition count 1024
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 127 place count 130 transition count 772
Ensure Unique test removed 2 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 141 place count 128 transition count 772
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 121 transition count 248
Ensure Unique test removed 3 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 158 place count 118 transition count 248
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 113 transition count 158
Iterating global reduction 3 with 5 rules applied. Total rules applied 168 place count 113 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 111 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 111 transition count 154
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 260 place count 67 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 67 transition count 108
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 266 place count 63 transition count 99
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 271 place count 62 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 272 place count 61 transition count 95
Iterating global reduction 4 with 1 rules applied. Total rules applied 273 place count 61 transition count 95
Performed 10 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 293 place count 51 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 295 place count 51 transition count 102
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 296 place count 50 transition count 100
Iterating global reduction 5 with 1 rules applied. Total rules applied 297 place count 50 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 50 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 321 place count 50 transition count 76
Applied a total of 321 rules in 160 ms. Remains 50 /203 variables (removed 153) and now considering 76/1092 (removed 1016) transitions.
[2026-06-02 10:32:26] [INFO ] Flow matrix only has 56 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16592969123726581950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15860405605792350177.kers'
[2026-06-02 10:32:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16592969123726581950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15860405605792350177.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 49 cols 292 entries
Finished phase 1 with 31 SingleSign rule and 2 generalized
[2026-06-02 10:32:26] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15860405605792350177.kers
Total runtime 3 ms.
[2026-06-02 10:32:26] [INFO ] Implicit Places using invariants in 63 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/203 places, 76/1092 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 75
Applied a total of 2 rules in 5 ms. Remains 48 /49 variables (removed 1) and now considering 75/76 (removed 1) transitions.
[2026-06-02 10:32:26] [INFO ] Flow matrix only has 55 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2440857373367656030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2662076198806625534.kers'
[2026-06-02 10:32:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2440857373367656030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2662076198806625534.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 54 rows 47 cols 289 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-06-02 10:32:26] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2662076198806625534.kers
Total runtime 1 ms.
[2026-06-02 10:32:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-06-02 10:32:26] [INFO ] Flow matrix only has 55 transitions (discarded 20 similar events)
[2026-06-02 10:32:26] [INFO ] Invariant cache hit.
[2026-06-02 10:32:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 10:32:26] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/203 places, 75/1092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 48/203 places, 75/1092 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(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-01 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 188 transition count 837
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 31 place count 187 transition count 837
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 44 place count 174 transition count 332
Iterating global reduction 0 with 13 rules applied. Total rules applied 57 place count 174 transition count 332
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 67 place count 164 transition count 262
Ensure Unique test removed 5 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 82 place count 159 transition count 262
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 154 transition count 200
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 154 transition count 200
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 150 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 150 transition count 192
Applied a total of 100 rules in 34 ms. Remains 150 /203 variables (removed 53) and now considering 192/1092 (removed 900) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16967061943041434425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5470027500421329761.kers'
[2026-06-02 10:32:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16967061943041434425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5470027500421329761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 150 cols 578 entries
Finished phase 1 with 132 SingleSign rule and 1 generalized
[2026-06-02 10:32:27] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5470027500421329761.kers
Total runtime 1 ms.
[2026-06-02 10:32:27] [INFO ] Implicit Places using invariants in 108 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/203 places, 192/1092 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 149/203 places, 192/1092 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-04
Product exploration explored 100000 steps with 2 reset in 395 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 6 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-04 finished in 691 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 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Graph (trivial) has 175 edges and 203 vertex of which 11 / 203 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 196 transition count 1045
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 52 rules applied. Total rules applied 92 place count 157 transition count 1032
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 99 place count 150 transition count 1032
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 99 place count 150 transition count 1021
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 121 place count 139 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 131 place count 129 transition count 821
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 142 place count 128 transition count 821
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 142 place count 128 transition count 820
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 144 place count 127 transition count 820
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 151 place count 120 transition count 344
Ensure Unique test removed 4 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 162 place count 116 transition count 344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 166 place count 112 transition count 168
Iterating global reduction 3 with 4 rules applied. Total rules applied 170 place count 112 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 109 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 109 transition count 162
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 262 place count 66 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 265 place count 66 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 268 place count 63 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 271 place count 63 transition count 106
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 291 place count 53 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 298 place count 53 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 299 place count 52 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 300 place count 52 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 303 place count 52 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
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 305 place count 51 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 320 place count 51 transition count 100
Applied a total of 320 rules in 117 ms. Remains 51 /203 variables (removed 152) and now considering 100/1092 (removed 992) transitions.
[2026-06-02 10:32:28] [INFO ] Flow matrix only has 79 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12218927247659236367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9143074753884359280.kers'
[2026-06-02 10:32:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12218927247659236367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9143074753884359280.kers]
Normalized transition count is 78 out of 79 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 78 rows 50 cols 584 entries
Finished phase 1 with 31 SingleSign rule and 2 generalized
[2026-06-02 10:32:28] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9143074753884359280.kers
Total runtime 3 ms.
[2026-06-02 10:32:28] [INFO ] Implicit Places using invariants in 90 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/203 places, 100/1092 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 50/203 places, 100/1092 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 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 257 ms.
Product exploration explored 100000 steps with 0 reset in 208 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 7328 steps (184 resets) in 126 ms. (57 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 333 ms.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-06-02 10:32:29] [INFO ] Flow matrix only has 79 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11091479321310965968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9524350238635803772.kers'
[2026-06-02 10:32:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11091479321310965968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9524350238635803772.kers]
Normalized transition count is 78 out of 79 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 78 rows 49 cols 564 entries
Finished phase 1 with 31 SingleSign rule and 2 generalized
[2026-06-02 10:32:29] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9524350238635803772.kers
Total runtime 2 ms.
[2026-06-02 10:32:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-06-02 10:32:29] [INFO ] Flow matrix only has 79 transitions (discarded 21 similar events)
[2026-06-02 10:32:29] [INFO ] Invariant cache hit.
[2026-06-02 10:32:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-06-02 10:32:29] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2026-06-02 10:32:29] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2026-06-02 10:32:29] [INFO ] Flow matrix only has 79 transitions (discarded 21 similar events)
[2026-06-02 10:32:29] [INFO ] Invariant cache hit.
[2026-06-02 10:32:29] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 78/128 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 90 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 78/128 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 92/181 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 182 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11249ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 11250ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11464 ms. Remains : 50/50 places, 100/100 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 5 factoid took 58 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 5194 steps (109 resets) in 29 ms. (173 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 271 ms.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 252 ms.
Built C files in :
/tmp/ltsmin5571854435979131575
[2026-06-02 10:32:41] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2026-06-02 10:32:41] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 10:32:41] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2026-06-02 10:32:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 10:32:41] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2026-06-02 10:32:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 10:32:41] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5571854435979131575
Running compilation step : cd /tmp/ltsmin5571854435979131575;'/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 865 ms.
Running link step : cd /tmp/ltsmin5571854435979131575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 146 ms.
Running LTSmin : cd /tmp/ltsmin5571854435979131575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12357975662989741380.hoa' '--buchi-type=spotba'
LTSmin run took 977 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-05 finished in 15938 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&&(G(p1) U X(X(p2)))&&X(G((p0||G(!p1)))))))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 187 transition count 836
Ensure Unique test removed 1 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 33 place count 186 transition count 836
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 46 place count 173 transition count 331
Iterating global reduction 0 with 13 rules applied. Total rules applied 59 place count 173 transition count 331
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 67 place count 165 transition count 264
Ensure Unique test removed 5 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 160 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 155 transition count 202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 151 transition count 194
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 151 transition count 194
Applied a total of 98 rules in 34 ms. Remains 151 /203 variables (removed 52) and now considering 194/1092 (removed 898) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7709533404034443928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17291330723619725314.kers'
[2026-06-02 10:32:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7709533404034443928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17291330723619725314.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 151 cols 582 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-06-02 10:32:43] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17291330723619725314.kers
Total runtime 2 ms.
[2026-06-02 10:32:44] [INFO ] Implicit Places using invariants in 92 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/203 places, 194/1092 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 150/203 places, 194/1092 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U X(X(p2)))&&X(G((p0||G(!p1)))))))'
Stuttering acceptance computed with spot in 460 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (AND p1 (NOT p0)), (NOT p2), (NOT p2), p1, (NOT p2), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-06 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Graph (trivial) has 175 edges and 203 vertex of which 11 / 203 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 196 transition count 1046
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 52 rules applied. Total rules applied 91 place count 158 transition count 1032
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 99 place count 150 transition count 1032
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 99 place count 150 transition count 1020
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 123 place count 138 transition count 1020
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 135 place count 126 transition count 768
Ensure Unique test removed 2 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 149 place count 124 transition count 768
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 149 place count 124 transition count 767
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 151 place count 123 transition count 767
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 159 place count 115 transition count 241
Ensure Unique test removed 4 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 171 place count 111 transition count 241
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 105 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 105 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 102 transition count 141
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 102 transition count 141
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 265 place count 64 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 268 place count 64 transition count 100
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 272 place count 60 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 277 place count 59 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 278 place count 58 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 58 transition count 90
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 4 with 2 rules applied. Total rules applied 281 place count 57 transition count 89
Performed 12 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 305 place count 45 transition count 107
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 317 place count 45 transition count 95
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 319 place count 43 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 321 place count 43 transition count 91
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 331 place count 43 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 333 place count 42 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 359 place count 42 transition count 68
Applied a total of 359 rules in 166 ms. Remains 42 /203 variables (removed 161) and now considering 68/1092 (removed 1024) transitions.
[2026-06-02 10:32:44] [INFO ] Flow matrix only has 48 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1287677165738255345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3141367942890626243.kers'
[2026-06-02 10:32:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1287677165738255345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3141367942890626243.kers]
Normalized transition count is 47 out of 48 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 42 cols 203 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-06-02 10:32:44] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3141367942890626243.kers
Total runtime 3 ms.
[2026-06-02 10:32:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-06-02 10:32:44] [INFO ] Flow matrix only has 48 transitions (discarded 20 similar events)
[2026-06-02 10:32:44] [INFO ] Invariant cache hit.
[2026-06-02 10:32:44] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 10:32:44] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2026-06-02 10:32:44] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2026-06-02 10:32:44] [INFO ] Flow matrix only has 48 transitions (discarded 20 similar events)
[2026-06-02 10:32:44] [INFO ] Invariant cache hit.
[2026-06-02 10:32:44] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 47/89 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 73 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 42/42 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 47/89 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 134 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4453 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 42/42 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6986ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/203 places, 68/1092 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7358 ms. Remains : 42/203 places, 68/1092 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-07 finished in 7445 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) U (G((X(!p0)||G(!p1)))||(!p2&&(X(!p0)||G(!p1)))))))'
Support contains 6 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 190 transition count 839
Ensure Unique test removed 1 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 27 place count 189 transition count 839
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 37 place count 179 transition count 337
Iterating global reduction 0 with 10 rules applied. Total rules applied 47 place count 179 transition count 337
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 53 place count 173 transition count 282
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 172 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 171 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 171 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 170 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 170 transition count 248
Applied a total of 64 rules in 21 ms. Remains 170 /203 variables (removed 33) and now considering 248/1092 (removed 844) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15467242135142478480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5803306057112901389.kers'
[2026-06-02 10:32:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15467242135142478480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5803306057112901389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 170 cols 1437 entries
Finished phase 1 with 147 SingleSign rule and 2 generalized
[2026-06-02 10:32:52] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5803306057112901389.kers
Total runtime 3 ms.
[2026-06-02 10:32:52] [INFO ] Implicit Places using invariants in 218 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/203 places, 248/1092 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 169/203 places, 248/1092 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) U (G((X(!p0)||G(!p1)))||(!p2&&(X(!p0)||G(!p1)))))))'
Stuttering acceptance computed with spot in 293 ms :[(AND p0 p1), (AND p0 p1), p0, (AND p1 p0), true, p1]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-08 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X((!p1 U X(p2)))))||p0))))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 189 transition count 838
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 29 place count 188 transition count 838
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 41 place count 176 transition count 349
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 176 transition count 349
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 61 place count 168 transition count 298
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 73 place count 164 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 78 place count 159 transition count 206
Iterating global reduction 0 with 5 rules applied. Total rules applied 83 place count 159 transition count 206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 157 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 157 transition count 202
Applied a total of 87 rules in 30 ms. Remains 157 /203 variables (removed 46) and now considering 202/1092 (removed 890) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12214004789402293817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17032801567956729776.kers'
[2026-06-02 10:32:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12214004789402293817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17032801567956729776.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 157 cols 641 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-06-02 10:32:52] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17032801567956729776.kers
Total runtime 3 ms.
[2026-06-02 10:32:52] [INFO ] Implicit Places using invariants in 138 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/203 places, 202/1092 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 156/203 places, 202/1092 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X((!p1 U X(p2)))))||p0))))'
Stuttering acceptance computed with spot in 880 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 276 ms.
Product exploration explored 100000 steps with 1 reset in 296 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 3 factoid took 483 ms. Reduced automaton from 16 states, 40 edges and 3 AP (stutter sensitive) to 16 states, 40 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12497917571231824036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10975698084632532867.kers'
[2026-06-02 10:32:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12497917571231824036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10975698084632532867.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 156 cols 635 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-06-02 10:32:55] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10975698084632532867.kers
Total runtime 2 ms.
Problem apf7 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/96 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/156 variables, 10/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 202/358 variables, 156/173 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 173 constraints, problems are : Problem set: 2 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/96 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/156 variables, 10/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 202/358 variables, 156/174 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 175 constraints, problems are : Problem set: 2 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 8 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 5 factoid took 616 ms. Reduced automaton from 16 states, 40 edges and 3 AP (stutter sensitive) to 14 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 780 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 2691 ms.
Stuttering acceptance computed with spot in 808 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-06-02 10:32:57] [INFO ] Invariant cache hit.
[2026-06-02 10:32:57] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-06-02 10:32:57] [INFO ] Invariant cache hit.
[2026-06-02 10:32:58] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-06-02 10:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/358 variables, 156/173 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 173 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15774 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/358 variables, 156/173 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 201/374 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 386 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45836ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 45837ms
Finished structural reductions in LTL mode , in 1 iterations and 46253 ms. Remains : 156/156 places, 202/202 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 3 factoid took 671 ms. Reduced automaton from 14 states, 32 edges and 3 AP (stutter sensitive) to 14 states, 32 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
[2026-06-02 10:33:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/96 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/156 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 202/358 variables, 156/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/96 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 60/156 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 202/358 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 789ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1307 steps, including 34 resets, run visited all 3 properties in 38 ms. (steps per millisecond=34 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 39 ms.
Knowledge based reduction with 3 factoid took 749 ms. Reduced automaton from 14 states, 32 edges and 3 AP (stutter sensitive) to 14 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 702 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 3244 ms.
Stuttering acceptance computed with spot in 717 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 762 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 270 ms.
Product exploration explored 100000 steps with 1 reset in 196 ms.
Spot run failed in 161 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/ltsmin16503464969830308561
[2026-06-02 10:33:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16503464969830308561
Running compilation step : cd /tmp/ltsmin16503464969830308561;'/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 541 ms.
Running link step : cd /tmp/ltsmin16503464969830308561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16503464969830308561;'/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/stateBased9513884506892629746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-06-02 10:34:04] [INFO ] Invariant cache hit.
[2026-06-02 10:34:04] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-06-02 10:34:04] [INFO ] Invariant cache hit.
[2026-06-02 10:34:04] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 156/156 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin17452428373184620157
[2026-06-02 10:34:04] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17452428373184620157
Running compilation step : cd /tmp/ltsmin17452428373184620157;'/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 724 ms.
Running link step : cd /tmp/ltsmin17452428373184620157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17452428373184620157;'/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/stateBased12224138032313424059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 10:34:20] [INFO ] Flatten gal took : 15 ms
[2026-06-02 10:34:20] [INFO ] Flatten gal took : 16 ms
[2026-06-02 10:34:20] [INFO ] Time to serialize gal into /tmp/LTL2933379762644608721.gal : 7 ms
[2026-06-02 10:34:20] [INFO ] Time to serialize properties into /tmp/LTL7342575069201112428.prop : 2 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/LTL2933379762644608721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut582809738998871535.hoa' '-atoms' '/tmp/LTL7342575069201112428.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...316
Loading property file /tmp/LTL7342575069201112428.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut582809738998871535.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t23, t28, t32, t40, t83, t86, t93, t103, t105, t107, t109, t113, t116, t118, t120, t122, ...428
41 unique states visited
41 strongly connected components in search stack
42 transitions explored
41 items max in DFS search stack
208 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,2.1565,66184,1,0,441,245693,436,180,5625,236521,786
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-12 finished in 90126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Graph (trivial) has 177 edges and 203 vertex of which 11 / 203 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 196 transition count 1045
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 53 rules applied. Total rules applied 93 place count 157 transition count 1031
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 101 place count 149 transition count 1031
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 101 place count 149 transition count 1020
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 123 place count 138 transition count 1020
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 134 place count 127 transition count 792
Ensure Unique test removed 2 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 147 place count 125 transition count 792
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 125 transition count 791
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 149 place count 124 transition count 791
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 156 place count 117 transition count 291
Ensure Unique test removed 3 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 166 place count 114 transition count 291
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 108 transition count 153
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 108 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 181 place count 105 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 184 place count 105 transition count 147
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 266 place count 64 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 269 place count 64 transition count 103
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 273 place count 60 transition count 94
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 278 place count 59 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 279 place count 58 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 58 transition count 90
Performed 12 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 304 place count 46 transition count 108
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 316 place count 46 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 318 place count 44 transition count 92
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 44 transition count 92
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 330 place count 44 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 332 place count 43 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 356 place count 43 transition count 71
Applied a total of 356 rules in 89 ms. Remains 43 /203 variables (removed 160) and now considering 71/1092 (removed 1021) transitions.
[2026-06-02 10:34:22] [INFO ] Flow matrix only has 51 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-328613600036630586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6297345005670107705.kers'
[2026-06-02 10:34:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-328613600036630586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6297345005670107705.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 50 rows 42 cols 308 entries
Finished phase 1 with 24 SingleSign rule and 2 generalized
[2026-06-02 10:34:22] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6297345005670107705.kers
Total runtime 2 ms.
[2026-06-02 10:34:22] [INFO ] Implicit Places using invariants in 69 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/203 places, 71/1092 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 70
Applied a total of 2 rules in 2 ms. Remains 41 /42 variables (removed 1) and now considering 70/71 (removed 1) transitions.
[2026-06-02 10:34:22] [INFO ] Flow matrix only has 50 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5610064511316274311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12557066138745792607.kers'
[2026-06-02 10:34:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5610064511316274311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12557066138745792607.kers]
Normalized transition count is 49 out of 50 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 49 rows 40 cols 305 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-02 10:34:22] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12557066138745792607.kers
Total runtime 2 ms.
[2026-06-02 10:34:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-06-02 10:34:22] [INFO ] Flow matrix only has 50 transitions (discarded 20 similar events)
[2026-06-02 10:34:22] [INFO ] Invariant cache hit.
[2026-06-02 10:34:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-06-02 10:34:23] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/203 places, 70/1092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 312 ms. Remains : 41/203 places, 70/1092 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-13 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((F((!p0&&X(!p1))) U G(p2))))))'
Support contains 6 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1092/1092 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 190 transition count 886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 190 transition count 886
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 178 transition count 461
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 178 transition count 461
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 170 transition count 332
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 166 transition count 332
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 162 transition count 212
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 162 transition count 212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 159 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 159 transition count 206
Applied a total of 84 rules in 24 ms. Remains 159 /203 variables (removed 44) and now considering 206/1092 (removed 886) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10466130553504907349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5952220664989964587.kers'
[2026-06-02 10:34:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10466130553504907349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5952220664989964587.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 159 cols 741 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-06-02 10:34:23] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5952220664989964587.kers
Total runtime 1 ms.
[2026-06-02 10:34:23] [INFO ] Implicit Places using invariants in 152 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/203 places, 206/1092 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 158/203 places, 206/1092 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((F((!p0&&X(!p1))) U G(p2))))))'
Stuttering acceptance computed with spot in 342 ms :[(NOT p2), (NOT p2), (NOT p2), (OR p1 p0), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP09C09-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 338 ms.
Product exploration explored 100000 steps with 0 reset in 381 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 10 factoid took 90 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 434 ms. (91 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-43576720442824251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3008329836854893788.kers'
[2026-06-02 10:34:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-43576720442824251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3008329836854893788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 158 cols 729 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-06-02 10:34:24] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3008329836854893788.kers
Total runtime 2 ms.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/158 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 206/364 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/158 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 206/364 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1766ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=71 )
Parikh walk visited 4 properties in 150 ms.
Knowledge based reduction with 10 factoid took 218 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (NOT p2), (OR p1 p0), p1, (NOT p2), (NOT p2)]
Knowledge-based reduction took 2959 ms.
Stuttering acceptance computed with spot in 304 ms :[(NOT p2), (NOT p2), (OR p1 p0), p1, (NOT p2), (NOT p2)]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 206/206 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2026-06-02 10:34:27] [INFO ] Invariant cache hit.
[2026-06-02 10:34:27] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-06-02 10:34:27] [INFO ] Invariant cache hit.
[2026-06-02 10:34:28] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-06-02 10:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/364 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 182 constraints, problems are : Problem set: 0 solved, 205 unsolved in 18938 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/364 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 205/387 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 399 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48986ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 48987ms
Finished structural reductions in LTL mode , in 1 iterations and 49366 ms. Remains : 158/158 places, 206/206 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge based reduction with 9 factoid took 59 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
[2026-06-02 10:35:17] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/158 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 206/364 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 59/158 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 206/364 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1472ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 4 properties in 81 ms.
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (NOT p2), (OR p1 p0), p1, (NOT p2), (NOT p2)]
Knowledge-based reduction took 2373 ms.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (NOT p2), (OR p1 p0), p1, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p2), (OR p1 p0), p1, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 196 ms.
Product exploration explored 100000 steps with 0 reset in 202 ms.
Spot run failed in 58 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/ltsmin11086869847157458692
[2026-06-02 10:35:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11086869847157458692
Running compilation step : cd /tmp/ltsmin11086869847157458692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin11086869847157458692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11086869847157458692;'/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/stateBased2074387270295208647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 206/206 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2026-06-02 10:35:35] [INFO ] Invariant cache hit.
[2026-06-02 10:35:35] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-06-02 10:35:35] [INFO ] Invariant cache hit.
[2026-06-02 10:35:35] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 158/158 places, 206/206 transitions.
Built C files in :
/tmp/ltsmin3317718609427861481
[2026-06-02 10:35:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3317718609427861481
Running compilation step : cd /tmp/ltsmin3317718609427861481;'/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 618 ms.
Running link step : cd /tmp/ltsmin3317718609427861481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3317718609427861481;'/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/stateBased10440015275952420234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 10:35:50] [INFO ] Flatten gal took : 9 ms
[2026-06-02 10:35:50] [INFO ] Flatten gal took : 8 ms
[2026-06-02 10:35:50] [INFO ] Time to serialize gal into /tmp/LTL93944635784767475.gal : 4 ms
[2026-06-02 10:35:50] [INFO ] Time to serialize properties into /tmp/LTL16705697572631543781.prop : 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/LTL93944635784767475.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2828483875932053561.hoa' '-atoms' '/tmp/LTL16705697572631543781.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...316
Loading property file /tmp/LTL16705697572631543781.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2828483875932053561.hoa
Detected timeout of ITS tools.
[2026-06-02 10:36:06] [INFO ] Flatten gal took : 7 ms
[2026-06-02 10:36:06] [INFO ] Flatten gal took : 7 ms
[2026-06-02 10:36:06] [INFO ] Time to serialize gal into /tmp/LTL3006791708923696715.gal : 3 ms
[2026-06-02 10:36:06] [INFO ] Time to serialize properties into /tmp/LTL1061660196806629054.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/LTL3006791708923696715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1061660196806629054.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...275
Read 1 LTL properties
Checking formula 0 : !((("((p320==0)||(p241==1))")U(X(X((F((!("((p320==0)||(p241==1))"))&&(X(!("((p125==0)||(p12==1))")))))U(G("((p108==0)||(p3==1))"))))))...156
Formula 0 simplified : !"((p320==0)||(p241==1))" R XX(G("((p320==0)||(p241==1))" | X"((p125==0)||(p12==1))") R F!"((p108==0)||(p3==1))")
Detected timeout of ITS tools.
[2026-06-02 10:36:21] [INFO ] Flatten gal took : 6 ms
[2026-06-02 10:36:21] [INFO ] Applying decomposition
[2026-06-02 10:36:21] [INFO ] Flatten gal took : 6 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/graph4942573559922922890.txt' '-o' '/tmp/graph4942573559922922890.bin' '-w' '/tmp/graph4942573559922922890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4942573559922922890.bin' '-l' '-1' '-v' '-w' '/tmp/graph4942573559922922890.weights' '-q' '0' '-e' '0.001'
[2026-06-02 10:36:21] [INFO ] Decomposing Gal with order
[2026-06-02 10:36:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 10:36:21] [INFO ] Removed a total of 242 redundant transitions.
[2026-06-02 10:36:21] [INFO ] Flatten gal took : 98 ms
[2026-06-02 10:36:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 14 ms.
[2026-06-02 10:36:21] [INFO ] Time to serialize gal into /tmp/LTL15828003428341550176.gal : 6 ms
[2026-06-02 10:36:21] [INFO ] Time to serialize properties into /tmp/LTL822834645889742896.ltl : 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/LTL15828003428341550176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL822834645889742896.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...254
Read 1 LTL properties
Checking formula 0 : !((("((i14.i1.u45.p320==0)||(i12.u34.p241==1))")U(X(X((F((!("((i14.i1.u45.p320==0)||(i12.u34.p241==1))"))&&(X(!("((i7.u18.p125==0)||(i...219
Formula 0 simplified : !"((i14.i1.u45.p320==0)||(i12.u34.p241==1))" R XX(G("((i14.i1.u45.p320==0)||(i12.u34.p241==1))" | X"((i7.u18.p125==0)||(i1.u3.p12==1...199
Reverse transition relation is NOT exact ! Due to transitions t40, t83, t141, t394, i1.u24.t103, i1.u24.t105, i1.u24.t1061, i2.t1070, i2.t149, i2.u1.t150, ...625
7 unique states visited
6 strongly connected components in search stack
9 transitions explored
7 items max in DFS search stack
78 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,0.82343,48384,1,0,73331,1625,3413,77289,664,5333,200821
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP09C09-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV2-PT-bP09C09-LTLCardinality-15 finished in 119161 ms.
All properties solved by simple procedures.
Total runtime 332591 ms.

BK_STOP 1780396582344

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ErlangenMainframeV2-PT-bP09C09"
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 ErlangenMainframeV2-PT-bP09C09, 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 r338-smll-178021499200275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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