About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1301
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 159502.00 | 0.00 | 0.00 | FTTFTFTTFFFTTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339800403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ErlangenMainframeV0-PT-1301, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339800403
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 53M
-rw-r--r-- 1 mcc users 7.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 12:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 6 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 52M Jun 5 20:08 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 ErlangenMainframeV0-PT-1301-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1301-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749380371943
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1301
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 10:59:33] [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]
[2025-06-08 10:59:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 10:59:35] [INFO ] Load time of PNML (sax parser for PT used): 2008 ms
[2025-06-08 10:59:35] [INFO ] Transformed 291 places.
[2025-06-08 10:59:35] [INFO ] Transformed 37156 transitions.
[2025-06-08 10:59:35] [INFO ] Found NUPN structural information;
[2025-06-08 10:59:35] [INFO ] Parsed PT model containing 291 places and 37156 transitions and 1082128 arcs in 2488 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 37156/37156 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 236 transition count 37101
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 236 transition count 37101
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 132 place count 214 transition count 37079
Iterating global reduction 0 with 22 rules applied. Total rules applied 154 place count 214 transition count 37079
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 161 place count 207 transition count 24919
Ensure Unique test removed 6 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 174 place count 201 transition count 24919
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 180 place count 195 transition count 855
Iterating global reduction 0 with 6 rules applied. Total rules applied 186 place count 195 transition count 855
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 194 transition count 853
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 194 transition count 853
Applied a total of 188 rules in 3799 ms. Remains 194 /291 variables (removed 97) and now considering 853/37156 (removed 36303) transitions.
// Phase 1: matrix 853 rows 194 cols
[2025-06-08 10:59:40] [INFO ] Computed 26 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:41] [INFO ] Implicit Places using invariants in 942 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 988 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/291 places, 853/37156 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 853/853 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4809 ms. Remains : 193/291 places, 853/37156 transitions.
Support contains 39 out of 193 places after structural reductions.
[2025-06-08 10:59:41] [INFO ] Flatten gal took : 244 ms
[2025-06-08 10:59:41] [INFO ] Flatten gal took : 132 ms
[2025-06-08 10:59:41] [INFO ] Input system was already deterministic with 853 transitions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (8 resets) in 1985 ms. (20 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
// Phase 1: matrix 853 rows 193 cols
[2025-06-08 10:59:42] [INFO ] Computed 25 invariants in 13 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/93 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/193 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 853/1046 variables, 193/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1046 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1046 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1046/1046 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:43] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 53/93 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 100/193 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:43] [INFO ] Deduced a trap composed of 14 places in 448 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:44] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:44] [INFO ] Deduced a trap composed of 18 places in 346 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 853/1046 variables, 193/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1046 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1046 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1046 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 853/853 transitions.
Graph (trivial) has 143 edges and 193 vertex of which 6 / 193 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 190 transition count 825
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 168 transition count 825
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 45 place count 168 transition count 809
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 77 place count 152 transition count 809
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 94 place count 135 transition count 443
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 112 place count 134 transition count 443
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 112 place count 134 transition count 436
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 127 transition count 436
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 124 transition count 228
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 123 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 122 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 122 transition count 196
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 241 place count 69 transition count 143
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 245 place count 65 transition count 99
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 251 place count 63 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 253 place count 63 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 61 transition count 85
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 61 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 263 place count 58 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 58 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 278 place count 58 transition count 84
Free-agglomeration rule applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 296 place count 58 transition count 66
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 231 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 36 rules applied. Total rules applied 332 place count 38 transition count 49
Ensure Unique test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 345 place count 29 transition count 45
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 346 place count 28 transition count 45
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 352 place count 28 transition count 39
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 354 place count 28 transition count 37
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 360 place count 26 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 362 place count 26 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 363 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 364 place count 24 transition count 30
Applied a total of 364 rules in 163 ms. Remains 24 /193 variables (removed 169) and now considering 30/853 (removed 823) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 24/193 places, 30/853 transitions.
RANDOM walk for 303 steps (0 resets) in 13 ms. (21 steps per ms) remains 0/1 properties
Computed a total of 39 stabilizing places and 39 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Graph (trivial) has 145 edges and 193 vertex of which 6 / 193 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 189 transition count 826
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 166 transition count 825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 165 transition count 825
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 49 place count 165 transition count 810
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 79 place count 150 transition count 810
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 98 place count 131 transition count 442
Ensure Unique test removed 1 places
Iterating global reduction 3 with 20 rules applied. Total rules applied 118 place count 130 transition count 442
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 118 place count 130 transition count 435
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 132 place count 123 transition count 435
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 119 transition count 219
Ensure Unique test removed 2 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 142 place count 117 transition count 219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 115 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 115 transition count 171
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 252 place count 62 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 257 place count 57 transition count 87
Ensure Unique test removed 3 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 265 place count 54 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 267 place count 54 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 269 place count 52 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 52 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 51 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 277 place count 49 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 290 place count 49 transition count 76
Applied a total of 290 rules in 121 ms. Remains 49 /193 variables (removed 144) and now considering 76/853 (removed 777) transitions.
[2025-06-08 10:59:45] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 49 cols
[2025-06-08 10:59:45] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-08 10:59:45] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2025-06-08 10:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 10:59:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 10:59:45] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-08 10:59:45] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
[2025-06-08 10:59:45] [INFO ] Invariant cache hit.
[2025-06-08 10:59:45] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 60/109 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 80 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1717 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 60/109 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 73/152 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:48] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 154 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2806 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4562ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 4563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/193 places, 76/853 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4800 ms. Remains : 49/193 places, 76/853 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-00
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-00 finished in 5090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(!p1)||(!p1&&F(!p2)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 171 transition count 482
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 170 transition count 482
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 58 place count 157 transition count 264
Ensure Unique test removed 1 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 156 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 151 transition count 217
Ensure Unique test removed 3 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 85 place count 148 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 88 place count 145 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 91 place count 145 transition count 189
Applied a total of 91 rules in 14 ms. Remains 145 /193 variables (removed 48) and now considering 189/853 (removed 664) transitions.
// Phase 1: matrix 189 rows 145 cols
[2025-06-08 10:59:50] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:50] [INFO ] Implicit Places using invariants in 72 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/193 places, 189/853 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 144/193 places, 189/853 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, p2, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-02 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 171 transition count 513
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 171 transition count 513
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 158 transition count 327
Ensure Unique test removed 2 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 156 transition count 327
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 150 transition count 217
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 148 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 146 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 146 transition count 193
Applied a total of 90 rules in 13 ms. Remains 146 /193 variables (removed 47) and now considering 193/853 (removed 660) transitions.
// Phase 1: matrix 193 rows 146 cols
[2025-06-08 10:59:51] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:51] [INFO ] Implicit Places using invariants in 74 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/193 places, 193/853 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 145/193 places, 193/853 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-04 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 170 transition count 736
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 47 place count 169 transition count 736
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 61 place count 155 transition count 318
Ensure Unique test removed 2 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 77 place count 153 transition count 318
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 83 place count 147 transition count 214
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 145 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 143 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 143 transition count 190
Applied a total of 95 rules in 18 ms. Remains 143 /193 variables (removed 50) and now considering 190/853 (removed 663) transitions.
// Phase 1: matrix 190 rows 143 cols
[2025-06-08 10:59:51] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:51] [INFO ] Implicit Places using invariants in 77 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/193 places, 190/853 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 142/193 places, 190/853 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-06
Product exploration explored 100000 steps with 20000 reset in 148 ms.
Product exploration explored 100000 steps with 20000 reset in 109 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 450 steps (0 resets) in 8 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 142 cols
[2025-06-08 10:59:53] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-08 10:59:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 10:59:53] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-08 10:59:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:54] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 10:59:54] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/332 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/332 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 163 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7954 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:01] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/332 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 189/353 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:04] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:04] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:07] [INFO ] Deduced a trap along path composed of 10 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:07] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 359 constraints, problems are : Problem set: 0 solved, 189 unsolved in 23476 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31493ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 31496ms
Finished structural reductions in LTL mode , in 1 iterations and 31686 ms. Remains : 142/142 places, 190/190 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 513 steps (0 resets) in 8 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 74 ms.
Product exploration explored 100000 steps with 20000 reset in 67 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 190/190 transitions.
Graph (trivial) has 114 edges and 142 vertex of which 6 / 142 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 139 transition count 187
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 11 place count 139 transition count 200
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 26 place count 139 transition count 200
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 133 transition count 194
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 133 transition count 194
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 89 place count 133 transition count 195
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 104 place count 118 transition count 158
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 119 place count 118 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 118 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 115 transition count 152
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 115 transition count 152
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 141 place count 115 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 114 transition count 189
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 114 transition count 189
Deduced a syphon composed of 67 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 2 with 35 rules applied. Total rules applied 178 place count 114 transition count 154
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 189 place count 103 transition count 143
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 200 place count 103 transition count 143
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 200 rules in 44 ms. Remains 103 /142 variables (removed 39) and now considering 143/190 (removed 47) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 11:00:26] [INFO ] Redundant transitions in 3 ms returned []
Running 141 sub problems to find dead transitions.
[2025-06-08 11:00:26] [INFO ] Flow matrix only has 125 transitions (discarded 18 similar events)
// Phase 1: matrix 125 rows 103 cols
[2025-06-08 11:00:26] [INFO ] Computed 19 invariants in 1 ms
[2025-06-08 11:00:26] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:27] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 19/38 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/38 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 124/227 variables, 103/141 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 28/169 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/169 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/228 variables, 1/170 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/170 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/170 constraints. Problems are: Problem set: 76 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 170 constraints, problems are : Problem set: 76 solved, 65 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 103/103 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 76 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 57/103 variables, 19/19 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 19/38 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/38 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 124/227 variables, 103/141 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 28/169 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 65/234 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/228 variables, 1/235 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/235 constraints. Problems are: Problem set: 76 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/235 constraints. Problems are: Problem set: 76 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 235 constraints, problems are : Problem set: 76 solved, 65 unsolved in 5083 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 103/103 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 65/141 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9353ms problems are : Problem set: 76 solved, 65 unsolved
Search for dead transitions found 76 dead transitions in 9355ms
Found 76 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 76 transitions
Dead transitions reduction (with SMT) removed 76 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/142 places, 67/190 transitions.
Graph (complete) has 424 edges and 103 vertex of which 47 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.7 ms
Discarding 56 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 47 /103 variables (removed 56) and now considering 67/67 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/142 places, 67/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9428 ms. Remains : 47/142 places, 67/190 transitions.
Built C files in :
/tmp/ltsmin13244741417696851293
[2025-06-08 11:00:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13244741417696851293
Running compilation step : cd /tmp/ltsmin13244741417696851293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 424 ms.
Running link step : cd /tmp/ltsmin13244741417696851293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13244741417696851293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4913133272657726840.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-06 finished in 44808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&F(p1))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 170 transition count 481
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 47 place count 169 transition count 481
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 60 place count 156 transition count 256
Ensure Unique test removed 2 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 75 place count 154 transition count 256
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 82 place count 147 transition count 199
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 144 transition count 199
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 141 transition count 185
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 141 transition count 185
Applied a total of 98 rules in 17 ms. Remains 141 /193 variables (removed 52) and now considering 185/853 (removed 668) transitions.
// Phase 1: matrix 185 rows 141 cols
[2025-06-08 11:00:36] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:00:36] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-08 11:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:00:36] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-08 11:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:38] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:38] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/326 variables, 141/162 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 162 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7814 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:45] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/326 variables, 141/163 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 184/347 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:47] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:47] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 5/352 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:49] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:50] [INFO ] Deduced a trap along path composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:57] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:57] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:58] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:00:58] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/326 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:00] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:01] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (OVERLAPS) 0/326 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 360 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37860ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 37861ms
Starting structural reductions in LTL mode, iteration 1 : 141/193 places, 185/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38044 ms. Remains : 141/193 places, 185/853 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 66 ms.
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 24529 steps (5 resets) in 113 ms. (215 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2025-06-08 11:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:01:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-08 11:01:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:01:16] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-08 11:01:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:17] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:17] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/326 variables, 141/162 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 162 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7892 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:24] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/326 variables, 141/163 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 184/347 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:26] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:26] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 5/352 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:29] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:29] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:36] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:36] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:36] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:36] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/326 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:39] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:39] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (OVERLAPS) 0/326 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 360 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37930ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 37931ms
Finished structural reductions in LTL mode , in 1 iterations and 38107 ms. Remains : 141/141 places, 185/185 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 18085 steps (2 resets) in 59 ms. (301 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 25000 reset in 67 ms.
Product exploration explored 100000 steps with 25000 reset in 66 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 185/185 transitions.
Graph (trivial) has 109 edges and 141 vertex of which 6 / 141 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 138 transition count 182
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 10 place count 138 transition count 195
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 27 place count 138 transition count 195
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 132 transition count 189
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 132 transition count 189
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 87 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 99 place count 120 transition count 159
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 111 place count 120 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 114 place count 120 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 117 transition count 153
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 117 transition count 153
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 117 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 116 transition count 188
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 116 transition count 188
Deduced a syphon composed of 67 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 172 place count 116 transition count 150
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 184 place count 104 transition count 138
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 196 place count 104 transition count 138
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 196 rules in 29 ms. Remains 104 /141 variables (removed 37) and now considering 138/185 (removed 47) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 11:01:55] [INFO ] Redundant transitions in 7 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-08 11:01:55] [INFO ] Flow matrix only has 121 transitions (discarded 17 similar events)
// Phase 1: matrix 121 rows 104 cols
[2025-06-08 11:01:55] [INFO ] Computed 19 invariants in 1 ms
[2025-06-08 11:01:55] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:01:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 19/38 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 120/224 variables, 104/142 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 23/165 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/165 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/166 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/166 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/166 constraints. Problems are: Problem set: 72 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 166 constraints, problems are : Problem set: 72 solved, 64 unsolved in 3770 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 104/104 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 72 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 56/104 variables, 19/19 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 19/38 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 120/224 variables, 104/142 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 23/165 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 64/229 constraints. Problems are: Problem set: 72 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:02:00] [INFO ] Deduced a trap along path composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 1/230 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/230 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 1/225 variables, 1/231 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/231 constraints. Problems are: Problem set: 72 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/231 constraints. Problems are: Problem set: 72 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 231 constraints, problems are : Problem set: 72 solved, 64 unsolved in 6177 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 104/104 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 64/136 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9970ms problems are : Problem set: 72 solved, 64 unsolved
Search for dead transitions found 72 dead transitions in 9970ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/141 places, 66/185 transitions.
Graph (complete) has 378 edges and 104 vertex of which 49 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 49 /104 variables (removed 55) and now considering 66/66 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/141 places, 66/185 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10019 ms. Remains : 49/141 places, 66/185 transitions.
Built C files in :
/tmp/ltsmin7511244681033098667
[2025-06-08 11:02:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7511244681033098667
Running compilation step : cd /tmp/ltsmin7511244681033098667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin7511244681033098667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7511244681033098667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4391057218849505185.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-07 finished in 89791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 171 transition count 482
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 170 transition count 482
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 58 place count 157 transition count 257
Ensure Unique test removed 2 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 73 place count 155 transition count 257
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 79 place count 149 transition count 201
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 87 place count 147 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 145 transition count 189
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 145 transition count 189
Applied a total of 91 rules in 12 ms. Remains 145 /193 variables (removed 48) and now considering 189/853 (removed 664) transitions.
// Phase 1: matrix 189 rows 145 cols
[2025-06-08 11:02:06] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:02:06] [INFO ] Implicit Places using invariants in 65 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/193 places, 189/853 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 144/193 places, 189/853 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-08 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Graph (trivial) has 147 edges and 193 vertex of which 6 / 193 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 189 transition count 826
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 166 transition count 826
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 47 place count 166 transition count 810
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 79 place count 150 transition count 810
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 99 place count 130 transition count 696
Ensure Unique test removed 1 places
Iterating global reduction 2 with 21 rules applied. Total rules applied 120 place count 129 transition count 696
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 120 place count 129 transition count 687
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 138 place count 120 transition count 687
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 279
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 114 transition count 279
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 112 transition count 183
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 112 transition count 183
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 252 place count 62 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 56 transition count 89
Ensure Unique test removed 3 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 267 place count 53 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 270 place count 53 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 273 place count 50 transition count 72
Iterating global reduction 3 with 3 rules applied. Total rules applied 276 place count 50 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 49 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 282 place count 47 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 295 place count 47 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 47 transition count 65
Applied a total of 296 rules in 63 ms. Remains 47 /193 variables (removed 146) and now considering 65/853 (removed 788) transitions.
[2025-06-08 11:02:06] [INFO ] Flow matrix only has 47 transitions (discarded 18 similar events)
// Phase 1: matrix 47 rows 47 cols
[2025-06-08 11:02:06] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:02:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-08 11:02:06] [INFO ] Flow matrix only has 47 transitions (discarded 18 similar events)
[2025-06-08 11:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:02:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 11:02:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 11:02:06] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-08 11:02:06] [INFO ] Flow matrix only has 47 transitions (discarded 18 similar events)
[2025-06-08 11:02:06] [INFO ] Invariant cache hit.
[2025-06-08 11:02:06] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 46/93 variables, 47/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 78 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 46/93 variables, 47/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 63/140 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:02:08] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 142 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3431ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3431ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/193 places, 65/853 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3588 ms. Remains : 47/193 places, 65/853 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-09
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-09 finished in 3678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(p2)&&p1)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 171 transition count 513
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 171 transition count 513
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 157 transition count 326
Ensure Unique test removed 2 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 74 place count 155 transition count 326
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 148 transition count 214
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 91 place count 145 transition count 214
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 94 place count 142 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 97 place count 142 transition count 186
Applied a total of 97 rules in 13 ms. Remains 142 /193 variables (removed 51) and now considering 186/853 (removed 667) transitions.
// Phase 1: matrix 186 rows 142 cols
[2025-06-08 11:02:10] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:02:10] [INFO ] Implicit Places using invariants in 57 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/193 places, 186/853 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 141/193 places, 186/853 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-10
Product exploration explored 100000 steps with 3 reset in 153 ms.
Stack based approach found an accepted trace after 105 steps with 1 reset with depth 69 and stack size 69 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-10 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(!p0))&&G(!p1))) U ((!p2&&X((X(X(!p0))&&G(!p1))))||X(G((!p1&&X(X(!p0))))))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 175 transition count 486
Ensure Unique test removed 1 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 37 place count 174 transition count 486
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 48 place count 163 transition count 270
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 162 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 158 transition count 225
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 156 transition count 225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 154 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 154 transition count 201
Applied a total of 74 rules in 14 ms. Remains 154 /193 variables (removed 39) and now considering 201/853 (removed 652) transitions.
// Phase 1: matrix 201 rows 154 cols
[2025-06-08 11:02:10] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:02:10] [INFO ] Implicit Places using invariants in 94 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/193 places, 201/853 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 153/193 places, 201/853 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR p0 p1), (OR p1 p0), true, p0, p1, p0, p0, p0, p0, p0]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-13 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 853/853 transitions.
Graph (trivial) has 143 edges and 193 vertex of which 6 / 193 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 189 transition count 826
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 166 transition count 825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 165 transition count 825
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 49 place count 165 transition count 811
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 77 place count 151 transition count 811
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 97 place count 131 transition count 442
Ensure Unique test removed 1 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 118 place count 130 transition count 442
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 118 place count 130 transition count 434
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 134 place count 122 transition count 434
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 119 transition count 226
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 118 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 117 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 117 transition count 194
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 245 place count 66 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 62 transition count 99
Ensure Unique test removed 2 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 255 place count 60 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 257 place count 60 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 259 place count 58 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 58 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 265 place count 56 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 276 place count 56 transition count 85
Applied a total of 276 rules in 66 ms. Remains 56 /193 variables (removed 137) and now considering 85/853 (removed 768) transitions.
[2025-06-08 11:02:11] [INFO ] Flow matrix only has 66 transitions (discarded 19 similar events)
// Phase 1: matrix 66 rows 56 cols
[2025-06-08 11:02:11] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:02:11] [INFO ] Implicit Places using invariants in 47 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/193 places, 85/853 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 55/193 places, 85/853 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1301-LTLCardinality-14
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1301-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1301-LTLCardinality-14 finished in 209 ms.
All properties solved by simple procedures.
Total runtime 158203 ms.
BK_STOP 1749380531445
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV0-PT-1301"
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-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-1301, 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 r254-tall-174931339800403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1301.tgz
mv ErlangenMainframeV0-PT-1301 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 ;