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-178021499000051.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 ErlangenMainframeV1-PT-bP01C01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499000051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 14K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 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 52K 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 ErlangenMainframeV1-PT-bP01C01-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780259926296

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-31 20:38:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:38:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:38:49] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2026-05-31 20:38:49] [INFO ] Transformed 173 places.
[2026-05-31 20:38:49] [INFO ] Transformed 219 transitions.
[2026-05-31 20:38:49] [INFO ] Found NUPN structural information;
[2026-05-31 20:38:49] [INFO ] Parsed PT model containing 173 places and 219 transitions and 608 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 219/219 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 140 transition count 186
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 140 transition count 186
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 127 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 127 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 124 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 124 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 123 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 122 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 122 transition count 160
Applied a total of 102 rules in 113 ms. Remains 122 /173 variables (removed 51) and now considering 160/219 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16926758759994535671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13125882714840387975.kers'
[2026-05-31 20:38:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16926758759994535671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13125882714840387975.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 122 cols 452 entries
Finished phase 1 with 112 SingleSign rule and 2 generalized
[2026-05-31 20:38:49] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13125882714840387975.kers
Total runtime 3 ms.
[2026-05-31 20:38:50] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-05-31 20:38:50] [INFO ] Invariant cache hit.
[2026-05-31 20:38:50] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2026-05-31 20:38:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/282 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 136 constraints, problems are : Problem set: 0 solved, 159 unsolved in 15882 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 160/282 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 159/296 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (OVERLAPS) 0/282 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 302 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46055ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 46083ms
Starting structural reductions in LTL mode, iteration 1 : 122/173 places, 160/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47064 ms. Remains : 122/173 places, 160/219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2026-05-31 20:39:36] [INFO ] Invariant cache hit.
[2026-05-31 20:39:36] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-31 20:39:36] [INFO ] Invariant cache hit.
[2026-05-31 20:39:36] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 122/122 places, 160/160 transitions.
Support contains 23 out of 122 places after structural reductions.
[2026-05-31 20:39:37] [INFO ] Flatten gal took : 80 ms
[2026-05-31 20:39:37] [INFO ] Flatten gal took : 34 ms
[2026-05-31 20:39:37] [INFO ] Input system was already deterministic with 160 transitions.
RANDOM walk for 27285 steps (6 resets) in 1325 ms. (20 steps per ms) remains 0/13 properties
Computed a total of 15 stabilizing places and 15 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)&&F(p1))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Graph (trivial) has 113 edges and 122 vertex of which 11 / 122 are part of one of the 5 SCC in 4 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 115 transition count 128
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 60 place count 91 transition count 117
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 85 transition count 117
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 66 place count 85 transition count 105
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 90 place count 73 transition count 105
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 98 place count 65 transition count 91
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 65 transition count 91
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 106 place count 65 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 62 transition count 88
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 59 transition count 81
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 58 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 57 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 57 transition count 79
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 151 place count 42 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 42 transition count 63
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 39 transition count 56
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 39 transition count 56
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
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 172 place count 32 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 179 place count 32 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 31 transition count 52
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 31 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 182 place count 31 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 184 place count 30 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 30 transition count 56
Applied a total of 185 rules in 92 ms. Remains 30 /122 variables (removed 92) and now considering 56/160 (removed 104) transitions.
[2026-05-31 20:39:38] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11358600854971619157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10087481306540047060.kers'
[2026-05-31 20:39:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11358600854971619157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10087481306540047060.kers]
Normalized transition count is 50 out of 51 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 30 cols 171 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-31 20:39:38] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10087481306540047060.kers
Total runtime 1 ms.
[2026-05-31 20:39:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-31 20:39:38] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
[2026-05-31 20:39:38] [INFO ] Invariant cache hit.
[2026-05-31 20:39:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-31 20:39:38] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2026-05-31 20:39:38] [INFO ] Redundant transitions in 25 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-31 20:39:38] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
[2026-05-31 20:39:38] [INFO ] Invariant cache hit.
[2026-05-31 20:39:38] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 50/80 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 30/30 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 50/80 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 48/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2854 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 30/30 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4910ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 4912ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/122 places, 56/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5201 ms. Remains : 30/122 places, 56/160 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-01 finished in 5787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Graph (trivial) has 122 edges and 122 vertex of which 11 / 122 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 115 transition count 120
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 47 rules applied. Total rules applied 80 place count 83 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 87 place count 76 transition count 105
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 87 place count 76 transition count 96
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 105 place count 67 transition count 96
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 113 place count 59 transition count 82
Iterating global reduction 3 with 8 rules applied. Total rules applied 121 place count 59 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 121 place count 59 transition count 79
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 127 place count 56 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 54 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 54 transition count 73
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 161 place count 39 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 39 transition count 57
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 165 place count 36 transition count 50
Iterating global reduction 4 with 3 rules applied. Total rules applied 168 place count 36 transition count 50
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 186 place count 27 transition count 70
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 200 place count 27 transition count 56
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 203 place count 24 transition count 48
Iterating global reduction 5 with 3 rules applied. Total rules applied 206 place count 24 transition count 48
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 217 place count 24 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 219 place count 23 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 226 place count 23 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 22 transition count 35
Applied a total of 227 rules in 59 ms. Remains 22 /122 variables (removed 100) and now considering 35/160 (removed 125) transitions.
[2026-05-31 20:39:44] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-153535389794078489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5852672269101489595.kers'
[2026-05-31 20:39:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-153535389794078489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5852672269101489595.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 29 rows 18 cols 74 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-31 20:39:44] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5852672269101489595.kers
Total runtime 1 ms.
[2026-05-31 20:39:44] [INFO ] Implicit Places using invariants in 56 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/122 places, 35/160 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 20 transition count 34
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 34/35 (removed 1) transitions.
[2026-05-31 20:39:44] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-618937435764927831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10179103245822736815.kers'
[2026-05-31 20:39:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-618937435764927831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10179103245822736815.kers]
Normalized transition count is 28 out of 29 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 28 rows 16 cols 66 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-31 20:39:44] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10179103245822736815.kers
Total runtime 0 ms.
[2026-05-31 20:39:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-31 20:39:44] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2026-05-31 20:39:44] [INFO ] Invariant cache hit.
[2026-05-31 20:39:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-31 20:39:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/122 places, 34/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 20/122 places, 34/160 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-02 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 104 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 104 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 102 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 102 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 101 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 101 transition count 129
Applied a total of 42 rules in 11 ms. Remains 101 /122 variables (removed 21) and now considering 129/160 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12514262587509491287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9761798294356997497.kers'
[2026-05-31 20:39:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12514262587509491287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9761798294356997497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 101 cols 342 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-31 20:39:44] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9761798294356997497.kers
Total runtime 2 ms.
[2026-05-31 20:39:44] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-31 20:39:44] [INFO ] Invariant cache hit.
[2026-05-31 20:39:44] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-31 20:39:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 129/230 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 112 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9070 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 129/230 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 128/240 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 244 constraints, problems are : Problem set: 0 solved, 128 unsolved in 14940 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24041ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 24044ms
Starting structural reductions in LTL mode, iteration 1 : 101/122 places, 129/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24344 ms. Remains : 101/122 places, 129/160 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-04 finished in 24550 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((F(G(p1))&&p0))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 105 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 105 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 102 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 100 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 100 transition count 127
Applied a total of 44 rules in 9 ms. Remains 100 /122 variables (removed 22) and now considering 127/160 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-31402040094742027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11347689810606103468.kers'
[2026-05-31 20:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-31402040094742027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11347689810606103468.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 100 cols 328 entries
Finished phase 1 with 91 SingleSign rule and 1 generalized
[2026-05-31 20:40:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11347689810606103468.kers
Total runtime 1 ms.
[2026-05-31 20:40:09] [INFO ] Implicit Places using invariants in 65 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/122 places, 127/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 99/122 places, 127/160 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((F(G(p1))&&p0))))'
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-05 finished in 278 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 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 145
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 103 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 103 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 101 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 101 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 99 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 99 transition count 129
Applied a total of 46 rules in 15 ms. Remains 99 /122 variables (removed 23) and now considering 129/160 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8295444367130772445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6619481267648650956.kers'
[2026-05-31 20:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8295444367130772445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6619481267648650956.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 99 cols 348 entries
Finished phase 1 with 90 SingleSign rule and 1 generalized
[2026-05-31 20:40:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6619481267648650956.kers
Total runtime 1 ms.
[2026-05-31 20:40:09] [INFO ] Implicit Places using invariants in 93 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/122 places, 129/160 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 98/122 places, 129/160 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 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 594 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-07 finished in 852 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(p0)||(p0&&G(p1)))))))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 112 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 112 transition count 144
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 106 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 106 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 103 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 101 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 101 transition count 128
Applied a total of 42 rules in 15 ms. Remains 101 /122 variables (removed 21) and now considering 128/160 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1010713831253033138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7882214220728400730.kers'
[2026-05-31 20:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1010713831253033138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7882214220728400730.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 101 cols 330 entries
Finished phase 1 with 92 SingleSign rule and 1 generalized
[2026-05-31 20:40:10] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7882214220728400730.kers
Total runtime 0 ms.
[2026-05-31 20:40:10] [INFO ] Implicit Places using invariants in 73 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/122 places, 128/160 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 100/122 places, 128/160 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(p0)||(G(p1)&&p0))))))'
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 305 ms.
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-08 finished in 714 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(((F(G(p0)) U p1)&&X(X(X(F(p1)))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 140
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 103 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 101 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 99 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 99 transition count 126
Applied a total of 46 rules in 7 ms. Remains 99 /122 variables (removed 23) and now considering 126/160 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5785920186669230569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12516373703848931021.kers'
[2026-05-31 20:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5785920186669230569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12516373703848931021.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 99 cols 326 entries
Finished phase 1 with 90 SingleSign rule and 1 generalized
[2026-05-31 20:40:10] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12516373703848931021.kers
Total runtime 1 ms.
[2026-05-31 20:40:11] [INFO ] Implicit Places using invariants in 55 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/122 places, 126/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 98/122 places, 126/160 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(((F(G(p0)) U p1)&&X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 317 ms.
Product exploration explored 100000 steps with 25000 reset in 274 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 70 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 366 ms.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 126/126 (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-10557542048949147287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13041231579535580047.kers'
[2026-05-31 20:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10557542048949147287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13041231579535580047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 98 cols 323 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-31 20:40:12] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13041231579535580047.kers
Total runtime 2 ms.
[2026-05-31 20:40:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-31 20:40:12] [INFO ] Invariant cache hit.
[2026-05-31 20:40:12] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-31 20:40:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/224 variables, 98/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 108 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/224 variables, 98/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 125/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 234 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9664 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16906ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 16908ms
Finished structural reductions in LTL mode , in 1 iterations and 17159 ms. Remains : 98/98 places, 126/126 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 76 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 341 ms.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Spot run failed in 148 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/ltsmin17762313481599074826
[2026-05-31 20:40:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17762313481599074826
Running compilation step : cd /tmp/ltsmin17762313481599074826;'/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 729 ms.
Running link step : cd /tmp/ltsmin17762313481599074826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin17762313481599074826;'/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/stateBased7786191623219541794.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-09 finished in 20707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)||X(!p1)) U X(X(X(p0)))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 106 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 106 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 105 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 105 transition count 138
Applied a total of 34 rules in 4 ms. Remains 105 /122 variables (removed 17) and now considering 138/160 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12329725986854552019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11293210116444149283.kers'
[2026-05-31 20:40:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12329725986854552019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11293210116444149283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 105 cols 384 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-31 20:40:31] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11293210116444149283.kers
Total runtime 2 ms.
[2026-05-31 20:40:31] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-31 20:40:31] [INFO ] Invariant cache hit.
[2026-05-31 20:40:31] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-31 20:40:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 138/243 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 117 constraints, problems are : Problem set: 0 solved, 137 unsolved in 9212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/243 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 137/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 257 constraints, problems are : Problem set: 0 solved, 137 unsolved in 14226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23469ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 23472ms
Starting structural reductions in LTL mode, iteration 1 : 105/122 places, 138/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23759 ms. Remains : 105/122 places, 138/160 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)||X(!p1)) U X(X(X(p0)))))'
Stuttering acceptance computed with spot in 335 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), p0, p0, true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLCardinality-13 finished in 24151 ms.
All properties solved by simple procedures.
Total runtime 126967 ms.

BK_STOP 1780260055843

--------------------
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="ErlangenMainframeV1-PT-bP01C01"
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 ErlangenMainframeV1-PT-bP01C01, 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-178021499000051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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