About the Execution of ITS-Tools for ErlangenMainframeV1-PT-bP03C03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 519.747 | 131146.00 | 171832.00 | 543.30 | FFTFTFFTFTFTFFFT | normal |
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-178021499100067.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-bP03C03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.7K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K 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 89K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 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 96K 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-bP03C03-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1780261018013
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-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-31 20:57:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:57:01] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2026-05-31 20:57:01] [INFO ] Transformed 213 places.
[2026-05-31 20:57:01] [INFO ] Transformed 327 transitions.
[2026-05-31 20:57:01] [INFO ] Found NUPN structural information;
[2026-05-31 20:57:01] [INFO ] Parsed PT model containing 213 places and 327 transitions and 1410 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 327/327 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 172 transition count 286
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 172 transition count 286
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 104 place count 150 transition count 264
Iterating global reduction 0 with 22 rules applied. Total rules applied 126 place count 150 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 131 place count 145 transition count 240
Iterating global reduction 0 with 5 rules applied. Total rules applied 136 place count 145 transition count 240
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 142 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 142 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 144 place count 140 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 146 place count 140 transition count 198
Applied a total of 146 rules in 138 ms. Remains 140 /213 variables (removed 73) and now considering 198/327 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15411078175443006750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2195080177466536212.kers'
[2026-05-31 20:57:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15411078175443006750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2195080177466536212.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 140 cols 738 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-31 20:57:01] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2195080177466536212.kers
Total runtime 4 ms.
[2026-05-31 20:57:02] [INFO ] Implicit Places using invariants in 485 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 559 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/213 places, 198/327 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 740 ms. Remains : 139/213 places, 198/327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Applied a total of 0 rules in 8 ms. Remains 139 /139 variables (removed 0) and now considering 198/198 (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-2970711226801036544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16347803391938333940.kers'
[2026-05-31 20:57:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2970711226801036544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16347803391938333940.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 139 cols 710 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-31 20:57:02] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16347803391938333940.kers
Total runtime 2 ms.
[2026-05-31 20:57:02] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-31 20:57:02] [INFO ] Invariant cache hit.
[2026-05-31 20:57:02] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-31 20:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/337 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 152 constraints, problems are : Problem set: 0 solved, 197 unsolved in 17670 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/337 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 197/349 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 197 unsolved
SMT process timed out in 48065ms, After SMT, problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 48092ms
Finished structural reductions in LTL mode , in 1 iterations and 48766 ms. Remains : 139/139 places, 198/198 transitions.
Support contains 33 out of 139 places after structural reductions.
[2026-05-31 20:57:51] [INFO ] Flatten gal took : 96 ms
[2026-05-31 20:57:51] [INFO ] Flatten gal took : 48 ms
[2026-05-31 20:57:51] [INFO ] Input system was already deterministic with 198 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 2651 ms. (15 steps per ms) remains 1/20 properties
BEST_FIRST walk for 37165 steps (8 resets) in 373 ms. (99 steps per ms) remains 0/1 properties
Computed a total of 14 stabilizing places and 14 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' '!(X(p0))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 167
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 117 transition count 152
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 45 place count 116 transition count 152
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 49 place count 112 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 53 place count 112 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 55 place count 110 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 110 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 58 place count 109 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 59 place count 109 transition count 140
Applied a total of 59 rules in 34 ms. Remains 109 /139 variables (removed 30) and now considering 140/198 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3683194696066295603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9811473756824662951.kers'
[2026-05-31 20:57:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3683194696066295603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9811473756824662951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 109 cols 382 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-05-31 20:57:53] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9811473756824662951.kers
Total runtime 2 ms.
[2026-05-31 20:57:53] [INFO ] Implicit Places using invariants in 121 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/139 places, 140/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 108/139 places, 140/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-00 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p1))||p0) U (F(p2) U p3)))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Graph (trivial) has 126 edges and 139 vertex of which 11 / 139 are part of one of the 5 SCC in 6 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 132 transition count 161
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 39 rules applied. Total rules applied 69 place count 103 transition count 151
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 77 place count 98 transition count 148
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 95 transition count 147
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 81 place count 95 transition count 140
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 95 place count 88 transition count 140
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 102 place count 81 transition count 118
Iterating global reduction 4 with 7 rules applied. Total rules applied 109 place count 81 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 109 place count 81 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 80 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 116 place count 75 transition count 100
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 74 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 73 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 73 transition count 98
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 174 place count 48 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 176 place count 48 transition count 71
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 179 place count 45 transition count 64
Iterating global reduction 5 with 3 rules applied. Total rules applied 182 place count 45 transition count 64
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 200 place count 36 transition count 67
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 207 place count 36 transition count 60
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 210 place count 33 transition count 54
Iterating global reduction 6 with 3 rules applied. Total rules applied 213 place count 33 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 217 place count 33 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 32 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 32 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 32 transition count 49
Applied a total of 227 rules in 97 ms. Remains 32 /139 variables (removed 107) and now considering 49/198 (removed 149) transitions.
[2026-05-31 20:57:53] [INFO ] Flow matrix only has 41 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17671350341405370097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14839034623141591474.kers'
[2026-05-31 20:57:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17671350341405370097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14839034623141591474.kers]
Normalized transition count is 40 out of 41 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 40 rows 32 cols 162 entries
Finished phase 1 with 21 SingleSign rule and 1 generalized
[2026-05-31 20:57:53] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14839034623141591474.kers
Total runtime 1 ms.
[2026-05-31 20:57:53] [INFO ] Implicit Places using invariants in 59 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/139 places, 49/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 31/139 places, 49/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p1))||p0) U (F(p2) U p3)))'
Stuttering acceptance computed with spot in 329 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-01 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0||X(X((p1 U (p2||G(p1)))))) U (G((!p0||X(X((p1 U (p2||G(p1)))))))||(!p0&&F(!p3))))))'
Support contains 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 127 transition count 174
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 127 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 125 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 125 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 124 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 124 transition count 166
Applied a total of 30 rules in 12 ms. Remains 124 /139 variables (removed 15) and now considering 166/198 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2332531401177362725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15719409694883825717.kers'
[2026-05-31 20:57:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2332531401177362725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15719409694883825717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 124 cols 524 entries
Finished phase 1 with 111 SingleSign rule and 2 generalized
[2026-05-31 20:57:54] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15719409694883825717.kers
Total runtime 2 ms.
[2026-05-31 20:57:54] [INFO ] Implicit Places using invariants in 119 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 166/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 123/139 places, 166/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0||X(X((p1 U (p2||G(p1)))))) U (G((!p0||X(X((p1 U (p2||G(p1)))))))||(!p0&&F(!p3))))))'
Stuttering acceptance computed with spot in 502 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p3 p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p3 p0 (NOT p2) (NOT p1)), (AND p3 p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p3 p0 (NOT p2) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-03
Product exploration explored 100000 steps with 19418 reset in 603 ms.
Stack based approach found an accepted trace after 122 steps with 22 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-03 finished in 1325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(X(F(p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 126 transition count 177
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 126 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 122 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 35 place count 121 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 37 place count 119 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 119 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 40 place count 118 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 118 transition count 155
Applied a total of 41 rules in 14 ms. Remains 118 /139 variables (removed 21) and now considering 155/198 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2554377425197521560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1704168486893483327.kers'
[2026-05-31 20:57:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2554377425197521560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1704168486893483327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 118 cols 440 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-05-31 20:57:55] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1704168486893483327.kers
Total runtime 3 ms.
[2026-05-31 20:57:55] [INFO ] Implicit Places using invariants in 125 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/139 places, 155/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 117/139 places, 155/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(X(F(p2))))))'
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 327 ms.
Entered a terminal (fully accepting) state of product in 82 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-06 finished in 907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 168
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 118 transition count 153
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 117 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 47 place count 113 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 51 place count 113 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 111 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 111 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 110 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 110 transition count 141
Applied a total of 57 rules in 18 ms. Remains 110 /139 variables (removed 29) and now considering 141/198 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12493905995579594521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13951773705054388603.kers'
[2026-05-31 20:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12493905995579594521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13951773705054388603.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 110 cols 384 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-31 20:57:56] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13951773705054388603.kers
Total runtime 5 ms.
[2026-05-31 20:57:56] [INFO ] Implicit Places using invariants in 90 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/139 places, 141/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 109/139 places, 141/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-10 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 166
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 116 transition count 151
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 47 place count 115 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 51 place count 111 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 55 place count 111 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 109 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 109 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 108 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 108 transition count 139
Applied a total of 61 rules in 12 ms. Remains 108 /139 variables (removed 31) and now considering 139/198 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8978950437043615179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16186789023927161508.kers'
[2026-05-31 20:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8978950437043615179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16186789023927161508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 108 cols 380 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-05-31 20:57:56] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16186789023927161508.kers
Total runtime 1 ms.
[2026-05-31 20:57:56] [INFO ] Implicit Places using invariants in 88 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/139 places, 139/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 107/139 places, 139/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 268 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 502 ms.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 139/139 (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-11338522891950391729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15877432285300798030.kers'
[2026-05-31 20:57:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11338522891950391729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15877432285300798030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 107 cols 377 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-31 20:57:58] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15877432285300798030.kers
Total runtime 1 ms.
[2026-05-31 20:57:58] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-31 20:57:58] [INFO ] Invariant cache hit.
[2026-05-31 20:57:58] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-31 20:57:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/246 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 117 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9736 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/246 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 138/255 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 260 constraints, problems are : Problem set: 0 solved, 138 unsolved in 16659 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26416ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 26420ms
Finished structural reductions in LTL mode , in 1 iterations and 26685 ms. Remains : 107/107 places, 139/139 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 458 ms.
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 168 ms.
Spot run failed in 162 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/ltsmin2335149922276445996
[2026-05-31 20:58:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2335149922276445996
Running compilation step : cd /tmp/ltsmin2335149922276445996;'/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 818 ms.
Running link step : cd /tmp/ltsmin2335149922276445996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin2335149922276445996;'/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/stateBased5902051625786066370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2026-05-31 20:58:41] [INFO ] Invariant cache hit.
[2026-05-31 20:58:41] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-31 20:58:41] [INFO ] Invariant cache hit.
[2026-05-31 20:58:42] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 107/107 places, 139/139 transitions.
Built C files in :
/tmp/ltsmin11849181031812862410
[2026-05-31 20:58:42] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11849181031812862410
Running compilation step : cd /tmp/ltsmin11849181031812862410;'/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 490 ms.
Running link step : cd /tmp/ltsmin11849181031812862410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11849181031812862410;'/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/stateBased4094630734889431008.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 20:58:57] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:58:57] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:58:57] [INFO ] Time to serialize gal into /tmp/LTL16069255312162305842.gal : 5 ms
[2026-05-31 20:58:57] [INFO ] Time to serialize properties into /tmp/LTL13609044037449229412.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16069255312162305842.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13168886991353761278.hoa' '-atoms' '/tmp/LTL13609044037449229412.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13609044037449229412.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13168886991353761278.hoa
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t21, t30, t79, t90, t101, t103, t104, t105, t107, t109, t111, t149, t152, t153, t16...258
23 unique states visited
0 strongly connected components in search stack
23 transitions explored
23 items max in DFS search stack
178 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.83186,65772,1,0,394,245126,301,217,3387,358853,873
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-11 finished in 62697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&F(p1)&&F(p2)))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 172
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 119 transition count 160
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 119 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 116 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 116 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 114 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 114 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 113 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 113 transition count 146
Applied a total of 52 rules in 5 ms. Remains 113 /139 variables (removed 26) and now considering 146/198 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8177660016855154670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6444970126185874547.kers'
[2026-05-31 20:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8177660016855154670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6444970126185874547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 113 cols 430 entries
Finished phase 1 with 100 SingleSign rule and 2 generalized
[2026-05-31 20:58:59] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6444970126185874547.kers
Total runtime 1 ms.
[2026-05-31 20:58:59] [INFO ] Implicit Places using invariants in 71 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/139 places, 146/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 112/139 places, 146/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&F(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-12
Product exploration explored 100000 steps with 5 reset in 172 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-12 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(X(X(!p0))&&G(p1))||(!p0&&F(G(!p1)))))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Graph (trivial) has 125 edges and 139 vertex of which 11 / 139 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 132 transition count 160
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 41 rules applied. Total rules applied 72 place count 102 transition count 149
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 79 place count 97 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 95 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 81 place count 95 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 97 place count 87 transition count 139
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 104 place count 80 transition count 117
Ensure Unique test removed 1 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 112 place count 79 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 112 place count 79 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 78 transition count 116
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 119 place count 73 transition count 99
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 72 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 71 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 71 transition count 97
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 177 place count 46 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 46 transition count 71
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 181 place count 43 transition count 64
Iterating global reduction 5 with 3 rules applied. Total rules applied 184 place count 43 transition count 64
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 204 place count 33 transition count 83
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 211 place count 33 transition count 76
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 213 place count 31 transition count 72
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 31 transition count 72
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 227 place count 31 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 237 place count 31 transition count 50
Applied a total of 237 rules in 58 ms. Remains 31 /139 variables (removed 108) and now considering 50/198 (removed 148) transitions.
[2026-05-31 20:59:00] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16542831129608944556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-859325889596505117.kers'
[2026-05-31 20:59:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16542831129608944556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-859325889596505117.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 40 rows 30 cols 148 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-31 20:59:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-859325889596505117.kers
Total runtime 1 ms.
[2026-05-31 20:59:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-31 20:59:00] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
[2026-05-31 20:59:00] [INFO ] Invariant cache hit.
[2026-05-31 20:59:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-31 20:59:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-31 20:59:00] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-31 20:59:00] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
[2026-05-31 20:59:00] [INFO ] Invariant cache hit.
[2026-05-31 20:59:00] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 40/71 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/72 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 53 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 40/71 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 46/98 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 99 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1896 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3561ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/139 places, 50/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3791 ms. Remains : 31/139 places, 50/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(X(p0))&&G(p1))||(F(G(!p1))&&p2)))))'
Stuttering acceptance computed with spot in 686 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), false, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), false]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-13 finished in 4557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 198/198 transitions.
Graph (trivial) has 126 edges and 139 vertex of which 11 / 139 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 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 132 transition count 162
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 41 rules applied. Total rules applied 70 place count 104 transition count 149
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 79 place count 97 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 95 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 81 place count 95 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 97 place count 87 transition count 139
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 104 place count 80 transition count 117
Ensure Unique test removed 1 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 112 place count 79 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 117 place count 74 transition count 100
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 73 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 72 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 72 transition count 98
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 4 with 52 rules applied. Total rules applied 177 place count 46 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 179 place count 46 transition count 70
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 182 place count 43 transition count 63
Iterating global reduction 5 with 3 rules applied. Total rules applied 185 place count 43 transition count 63
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 203 place count 34 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 210 place count 34 transition count 61
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 212 place count 32 transition count 57
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 32 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 32 transition count 56
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 221 place count 32 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 32 transition count 50
Applied a total of 223 rules in 46 ms. Remains 32 /139 variables (removed 107) and now considering 50/198 (removed 148) transitions.
[2026-05-31 20:59:04] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3425178393901971740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12161589776825405881.kers'
[2026-05-31 20:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3425178393901971740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12161589776825405881.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 40 rows 31 cols 142 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-31 20:59:04] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12161589776825405881.kers
Total runtime 1 ms.
[2026-05-31 20:59:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-31 20:59:04] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
[2026-05-31 20:59:04] [INFO ] Invariant cache hit.
[2026-05-31 20:59:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-31 20:59:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-31 20:59:04] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-31 20:59:04] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
[2026-05-31 20:59:04] [INFO ] Invariant cache hit.
[2026-05-31 20:59:04] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 40/72 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 53 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 40/72 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 46/98 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 99 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4056ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/139 places, 50/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4208 ms. Remains : 32/139 places, 50/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLCardinality-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLCardinality-14 finished in 4369 ms.
All properties solved by simple procedures.
Total runtime 128453 ms.
BK_STOP 1780261149159
--------------------
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-bP03C03"
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-bP03C03, 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-178021499100067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV1-PT-bP03C03.tgz
mv ErlangenMainframeV1-PT-bP03C03 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 '
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 ;