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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:32 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 200K 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-bP04C04-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780261445695

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-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-31 21:04:08] [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 21:04:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 21:04:08] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2026-05-31 21:04:08] [INFO ] Transformed 233 places.
[2026-05-31 21:04:08] [INFO ] Transformed 507 transitions.
[2026-05-31 21:04:08] [INFO ] Found NUPN structural information;
[2026-05-31 21:04:08] [INFO ] Parsed PT model containing 233 places and 507 transitions and 3455 arcs in 475 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.
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 507/507 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 185 transition count 459
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 185 transition count 459
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 123 place count 158 transition count 432
Iterating global reduction 0 with 27 rules applied. Total rules applied 150 place count 158 transition count 432
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 158 place count 150 transition count 354
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 167 place count 149 transition count 354
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 174 place count 142 transition count 197
Iterating global reduction 0 with 7 rules applied. Total rules applied 181 place count 142 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 186 place count 137 transition count 190
Iterating global reduction 0 with 5 rules applied. Total rules applied 191 place count 137 transition count 190
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 194 place count 134 transition count 187
Iterating global reduction 0 with 3 rules applied. Total rules applied 197 place count 134 transition count 187
Applied a total of 197 rules in 118 ms. Remains 134 /233 variables (removed 99) and now considering 187/507 (removed 320) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2749367691276749057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7397893876629112064.kers'
[2026-05-31 21:04:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2749367691276749057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7397893876629112064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 134 cols 729 entries
Finished phase 1 with 118 SingleSign rule and 3 generalized
[2026-05-31 21:04:09] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7397893876629112064.kers
Total runtime 4 ms.
[2026-05-31 21:04:09] [INFO ] Implicit Places using invariants in 376 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/233 places, 187/507 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 577 ms. Remains : 133/233 places, 187/507 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 187/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 187/187 (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-11761607383048531670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1034904814352423291.kers'
[2026-05-31 21:04:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11761607383048531670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1034904814352423291.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 133 cols 699 entries
Finished phase 1 with 118 SingleSign rule and 3 generalized
[2026-05-31 21:04:09] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1034904814352423291.kers
Total runtime 3 ms.
[2026-05-31 21:04:09] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-31 21:04:09] [INFO ] Invariant cache hit.
[2026-05-31 21:04:10] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-31 21:04:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/320 variables, 133/150 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 150 constraints, problems are : Problem set: 0 solved, 186 unsolved in 15732 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/320 variables, 133/151 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 186/337 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 341 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45993ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 46019ms
Finished structural reductions in LTL mode , in 1 iterations and 46596 ms. Remains : 133/133 places, 187/187 transitions.
Support contains 17 out of 133 places after structural reductions.
[2026-05-31 21:04:56] [INFO ] Flatten gal took : 96 ms
[2026-05-31 21:04:56] [INFO ] Flatten gal took : 41 ms
[2026-05-31 21:04:56] [INFO ] Input system was already deterministic with 187 transitions.
RANDOM walk for 40000 steps (8 resets) in 2023 ms. (19 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
[2026-05-31 21:04:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/133 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/320 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/133 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 187/320 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Parikh walk visited 1 properties in 12 ms.
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' '!(((p0 U X(X(G(p1))))||F(G(p2))))'
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 187/187 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 128 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 128 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 127 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 127 transition count 169
Applied a total of 12 rules in 12 ms. Remains 127 /133 variables (removed 6) and now considering 169/187 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17762312810979224591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5702266551393058672.kers'
[2026-05-31 21:04:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17762312810979224591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5702266551393058672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 127 cols 567 entries
Finished phase 1 with 112 SingleSign rule and 3 generalized
[2026-05-31 21:04:58] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5702266551393058672.kers
Total runtime 2 ms.
[2026-05-31 21:04:58] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-31 21:04:58] [INFO ] Invariant cache hit.
[2026-05-31 21:04:58] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-31 21:04:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/296 variables, 127/144 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 144 constraints, problems are : Problem set: 0 solved, 168 unsolved in 14368 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 169/296 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 168/313 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/296 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 315 constraints, problems are : Problem set: 0 solved, 168 unsolved in 19449 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33870ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 33873ms
Starting structural reductions in LTL mode, iteration 1 : 127/133 places, 169/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34140 ms. Remains : 127/133 places, 169/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(G(p1))))||F(G(p2))))'
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 596 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 15 factoid took 75 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1080 ms. (37 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
[2026-05-31 21:05:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/105 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/127 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 169/296 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 139 constraints, problems are : Problem set: 0 solved, 3 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/105 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/127 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 169/296 variables, 127/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 2/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 3/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/296 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 146 constraints, problems are : Problem set: 1 solved, 2 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 963ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 181 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 169/169 transitions.
Graph (trivial) has 116 edges and 127 vertex of which 11 / 127 are part of one of the 5 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 121 transition count 133
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 33 rules applied. Total rules applied 58 place count 97 transition count 124
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 91 transition count 124
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 64 place count 91 transition count 112
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 88 place count 79 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 136 place count 55 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 142 place count 55 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 145 place count 52 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 148 place count 52 transition count 75
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 170 place count 41 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 179 place count 41 transition count 94
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 39 transition count 78
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 39 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 187 place count 39 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 189 place count 38 transition count 78
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 196 place count 38 transition count 71
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 203 place count 38 transition count 64
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 219 place count 31 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 225 place count 31 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 226 place count 31 transition count 49
Applied a total of 226 rules in 63 ms. Remains 31 /127 variables (removed 96) and now considering 49/169 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 31/127 places, 49/169 transitions.
RANDOM walk for 298 steps (0 resets) in 7 ms. (37 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 201 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 2212 ms.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 169/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2026-05-31 21:05:36] [INFO ] Invariant cache hit.
[2026-05-31 21:05:36] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-31 21:05:36] [INFO ] Invariant cache hit.
[2026-05-31 21:05:36] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 127/127 places, 169/169 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 9 factoid took 54 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 591 ms. (67 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2026-05-31 21:05:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/104 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/127 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 169/296 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/104 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/127 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 169/296 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/296 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 169/169 transitions.
Graph (trivial) has 120 edges and 127 vertex of which 11 / 127 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 121 transition count 132
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 34 rules applied. Total rules applied 60 place count 96 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 90 transition count 123
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 90 transition count 111
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 78 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 77 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 77 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 76 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 76 transition count 105
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 146 place count 50 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 152 place count 50 transition count 73
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 47 transition count 66
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 47 transition count 66
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 180 place count 36 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 192 place count 36 transition count 78
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 195 place count 33 transition count 65
Iterating global reduction 5 with 3 rules applied. Total rules applied 198 place count 33 transition count 65
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 203 place count 33 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 207 place count 31 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 208 place count 31 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 227 place count 31 transition count 54
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 234 place count 31 transition count 47
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 250 place count 24 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 254 place count 24 transition count 34
Applied a total of 254 rules in 43 ms. Remains 24 /127 variables (removed 103) and now considering 34/169 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 24/127 places, 34/169 transitions.
RANDOM walk for 144 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 1125 ms.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 229 ms.
Spot run failed in 100 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/ltsmin17003756167564248023
[2026-05-31 21:05:38] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17003756167564248023
Running compilation step : cd /tmp/ltsmin17003756167564248023;'/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 599 ms.
Running link step : cd /tmp/ltsmin17003756167564248023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin17003756167564248023;'/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/stateBased15653013577730553783.hoa' '--buchi-type=spotba'
LTSmin run took 91 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLCardinality-01 finished in 41183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 187/187 transitions.
Graph (trivial) has 125 edges and 133 vertex of which 11 / 133 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 126 transition count 151
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 35 rules applied. Total rules applied 64 place count 98 transition count 144
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 94 transition count 144
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 68 place count 94 transition count 133
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 90 place count 83 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 95 place count 78 transition count 115
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 77 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 74 transition count 106
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 73 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 72 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 72 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 71 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 71 transition count 102
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 166 place count 44 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 44 transition count 69
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 41 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 41 transition count 62
Performed 11 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 200 place count 30 transition count 80
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 214 place count 30 transition count 66
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 217 place count 27 transition count 60
Iterating global reduction 5 with 3 rules applied. Total rules applied 220 place count 27 transition count 60
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 231 place count 27 transition count 49
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 233 place count 26 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 248 place count 26 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 25 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 24 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 255 place count 24 transition count 34
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 257 place count 24 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 259 place count 22 transition count 32
Applied a total of 259 rules in 57 ms. Remains 22 /133 variables (removed 111) and now considering 32/187 (removed 155) transitions.
[2026-05-31 21:05:39] [INFO ] Flow matrix only has 27 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-9092467597001775462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7944402329111856139.kers'
[2026-05-31 21:05:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9092467597001775462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7944402329111856139.kers]
Normalized transition count is 26 out of 27 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 26 rows 16 cols 62 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-31 21:05:39] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7944402329111856139.kers
Total runtime 1 ms.
[2026-05-31 21:05:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-31 21:05:39] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2026-05-31 21:05:39] [INFO ] Invariant cache hit.
[2026-05-31 21:05:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 21:05:39] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2026-05-31 21:05:39] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-31 21:05:39] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2026-05-31 21:05:39] [INFO ] Invariant cache hit.
[2026-05-31 21:05:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/22 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 26/48 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/49 variables, and 34 constraints, problems are : Problem set: 0 solved, 15 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 22/22 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/22 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 26/48 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/49 variables, and 49 constraints, problems are : Problem set: 0 solved, 15 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 22/22 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 771ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/133 places, 32/187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 979 ms. Remains : 22/133 places, 32/187 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 46 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLCardinality-05 finished in 1055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 187/187 transitions.
Graph (trivial) has 121 edges and 133 vertex of which 11 / 133 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 126 transition count 153
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 100 transition count 148
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 97 transition count 148
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 97 transition count 137
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 83 place count 86 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 90 place count 79 transition count 116
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 78 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 75 transition count 107
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 74 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 73 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 73 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 72 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 72 transition count 103
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 159 place count 47 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 165 place count 47 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 168 place count 44 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 171 place count 44 transition count 65
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 193 place count 33 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 201 place count 33 transition count 76
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 203 place count 31 transition count 72
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 31 transition count 72
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 212 place count 31 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 226 place count 31 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 228 place count 30 transition count 61
Applied a total of 228 rules in 28 ms. Remains 30 /133 variables (removed 103) and now considering 61/187 (removed 126) transitions.
[2026-05-31 21:05:40] [INFO ] Flow matrix only has 51 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14686311583348240873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4775666530273852400.kers'
[2026-05-31 21:05:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14686311583348240873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4775666530273852400.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 50 rows 29 cols 246 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-31 21:05:40] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4775666530273852400.kers
Total runtime 1 ms.
[2026-05-31 21:05:40] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-31 21:05:40] [INFO ] Flow matrix only has 51 transitions (discarded 10 similar events)
[2026-05-31 21:05:40] [INFO ] Invariant cache hit.
[2026-05-31 21:05:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-31 21:05:40] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2026-05-31 21:05:40] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2026-05-31 21:05:40] [INFO ] Flow matrix only has 51 transitions (discarded 10 similar events)
[2026-05-31 21:05:40] [INFO ] Invariant cache hit.
[2026-05-31 21:05:40] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/80 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 58 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/80 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 49/106 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 107 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2638 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4045ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4046ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/133 places, 61/187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4217 ms. Remains : 30/133 places, 61/187 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-bP04C04-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Computed a total of 2 stabilizing places and 12 stable transitions
Computed a total of 2 stabilizing places and 12 stable transitions
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 228 steps (9 resets) in 5 ms. (38 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Knowledge-based reduction took 232 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2026-05-31 21:05:45] [INFO ] Flow matrix only has 51 transitions (discarded 10 similar events)
[2026-05-31 21:05:45] [INFO ] Invariant cache hit.
[2026-05-31 21:05:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-31 21:05:45] [INFO ] Flow matrix only has 51 transitions (discarded 10 similar events)
[2026-05-31 21:05:45] [INFO ] Invariant cache hit.
[2026-05-31 21:05:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-31 21:05:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2026-05-31 21:05:45] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 30/30 places, 61/61 transitions.
Computed a total of 2 stabilizing places and 12 stable transitions
Computed a total of 2 stabilizing places and 12 stable transitions
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 89 steps (4 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Knowledge-based reduction took 185 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLCardinality-07 finished in 5245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||G(p1)))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 187/187 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 125 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 125 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 122 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 122 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 121 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 25 place count 120 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 119 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 119 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 118 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 118 transition count 151
Applied a total of 29 rules in 6 ms. Remains 118 /133 variables (removed 15) and now considering 151/187 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1468700958115761866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5303874956125364094.kers'
[2026-05-31 21:05:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1468700958115761866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5303874956125364094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 118 cols 418 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-31 21:05:45] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5303874956125364094.kers
Total runtime 1 ms.
[2026-05-31 21:05:46] [INFO ] Implicit Places using invariants in 64 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/133 places, 151/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 117/133 places, 151/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||G(p1)))))'
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 265 ms.
Entered a terminal (fully accepting) state of product in 131 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLCardinality-08 finished in 568 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)&&F(!p1))) U p1) U X(p1)))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 187/187 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 123 transition count 174
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 123 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 119 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 119 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 118 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 117 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 116 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 116 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 115 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 115 transition count 149
Applied a total of 35 rules in 8 ms. Remains 115 /133 variables (removed 18) and now considering 149/187 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5289921983365012067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7678393538880126455.kers'
[2026-05-31 21:05:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5289921983365012067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7678393538880126455.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 115 cols 428 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-31 21:05:46] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7678393538880126455.kers
Total runtime 1 ms.
[2026-05-31 21:05:46] [INFO ] Implicit Places using invariants in 81 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/133 places, 149/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 114/133 places, 149/187 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)&&F(!p1))) U p1) U X(p1)))'
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (OR p1 p0), p0, p1]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 12 ms. Proved property starting from automaton with 6 states, 12 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLCardinality-10 finished in 875 ms.
All properties solved by simple procedures.
Total runtime 99146 ms.

BK_STOP 1780261547521

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

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