Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926500077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-16-LTLCardinality-00
FORMULA_NAME MedleyA-PT-16-LTLCardinality-01
FORMULA_NAME MedleyA-PT-16-LTLCardinality-02
FORMULA_NAME MedleyA-PT-16-LTLCardinality-03
FORMULA_NAME MedleyA-PT-16-LTLCardinality-04
FORMULA_NAME MedleyA-PT-16-LTLCardinality-05
FORMULA_NAME MedleyA-PT-16-LTLCardinality-06
FORMULA_NAME MedleyA-PT-16-LTLCardinality-07
FORMULA_NAME MedleyA-PT-16-LTLCardinality-08
FORMULA_NAME MedleyA-PT-16-LTLCardinality-09
FORMULA_NAME MedleyA-PT-16-LTLCardinality-10
FORMULA_NAME MedleyA-PT-16-LTLCardinality-11
FORMULA_NAME MedleyA-PT-16-LTLCardinality-12
FORMULA_NAME MedleyA-PT-16-LTLCardinality-13
FORMULA_NAME MedleyA-PT-16-LTLCardinality-14
FORMULA_NAME MedleyA-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362917570

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:15:20] [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]
[2024-06-02 21:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:15:20] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 21:15:20] [INFO ] Transformed 196 places.
[2024-06-02 21:15:20] [INFO ] Transformed 392 transitions.
[2024-06-02 21:15:20] [INFO ] Found NUPN structural information;
[2024-06-02 21:15:20] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 166 transition count 341
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 166 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 166 transition count 331
Applied a total of 70 rules in 45 ms. Remains 166 /196 variables (removed 30) and now considering 331/390 (removed 59) transitions.
// Phase 1: matrix 331 rows 166 cols
[2024-06-02 21:15:21] [INFO ] Computed 7 invariants in 19 ms
[2024-06-02 21:15:21] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-02 21:15:21] [INFO ] Invariant cache hit.
[2024-06-02 21:15:21] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2024-06-02 21:15:21] [INFO ] Invariant cache hit.
[2024-06-02 21:15:21] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/196 places, 331/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1126 ms. Remains : 166/196 places, 331/390 transitions.
Support contains 27 out of 166 places after structural reductions.
[2024-06-02 21:15:22] [INFO ] Flatten gal took : 76 ms
[2024-06-02 21:15:22] [INFO ] Flatten gal took : 31 ms
[2024-06-02 21:15:22] [INFO ] Input system was already deterministic with 331 transitions.
Support contains 25 out of 166 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-06-02 21:15:25] [INFO ] Invariant cache hit.
[2024-06-02 21:15:25] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-06-02 21:15:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 21:15:26] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-06-02 21:15:26] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 96 ms to minimize.
[2024-06-02 21:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-06-02 21:15:26] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-06-02 21:15:26] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-02 21:15:26] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 5 ms to minimize.
[2024-06-02 21:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-06-02 21:15:26] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:15:27] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:15:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2024-06-02 21:15:27] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:15:27] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:15:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2024-06-02 21:15:27] [INFO ] After 1614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 170 ms.
[2024-06-02 21:15:27] [INFO ] After 1984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 1 properties in 92 ms.
Support contains 21 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 134 edges and 166 vertex of which 9 / 166 are part of one of the 2 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 159 transition count 305
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 142 transition count 302
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 139 transition count 302
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 41 place count 139 transition count 294
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 57 place count 131 transition count 294
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 131 transition count 293
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 130 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 130 transition count 291
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 102 place count 109 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 105 place count 109 transition count 267
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 107 place count 107 transition count 261
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 107 transition count 261
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -130
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 151 place count 86 transition count 391
Drop transitions removed 5 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 172 place count 86 transition count 370
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 6 with 47 rules applied. Total rules applied 219 place count 86 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 84 transition count 349
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 226 place count 84 transition count 346
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 230 place count 84 transition count 342
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 239 place count 84 transition count 333
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 248 place count 75 transition count 333
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 255 place count 75 transition count 326
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 257 place count 75 transition count 326
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 258 place count 75 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 259 place count 74 transition count 324
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 25 edges and 72 vertex of which 7 / 72 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 262 place count 68 transition count 324
Drop transitions removed 21 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 9 with 37 rules applied. Total rules applied 299 place count 68 transition count 287
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 10 with 55 rules applied. Total rules applied 354 place count 68 transition count 232
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 10 with 2 rules applied. Total rules applied 356 place count 67 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 358 place count 66 transition count 244
Applied a total of 358 rules in 218 ms. Remains 66 /166 variables (removed 100) and now considering 244/331 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 66/166 places, 244/331 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-06-02 21:15:28] [INFO ] Flow matrix only has 221 transitions (discarded 23 similar events)
// Phase 1: matrix 221 rows 66 cols
[2024-06-02 21:15:28] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 21:15:28] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:15:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 21:15:28] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:15:28] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-02 21:15:28] [INFO ] After 24ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:15:28] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 21:15:28] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 244/244 transitions.
Graph (trivial) has 58 edges and 66 vertex of which 17 / 66 are part of one of the 5 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions removed 22 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 54 transition count 217
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 51 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 51 transition count 216
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 50 transition count 216
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 45 transition count 211
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 26 place count 45 transition count 204
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 40 transition count 223
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 69 place count 40 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 40 transition count 188
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 38 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 77 place count 36 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 35 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 35 transition count 179
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 35 transition count 176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 32 transition count 176
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 102 place count 32 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 31 transition count 158
Applied a total of 103 rules in 45 ms. Remains 31 /66 variables (removed 35) and now considering 158/244 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 31/66 places, 158/244 transitions.
Finished random walk after 101 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(!p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 155 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 155 transition count 310
Applied a total of 27 rules in 21 ms. Remains 155 /166 variables (removed 11) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 155 cols
[2024-06-02 21:15:28] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:15:28] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:15:28] [INFO ] Invariant cache hit.
[2024-06-02 21:15:29] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 21:15:29] [INFO ] Invariant cache hit.
[2024-06-02 21:15:29] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 155/166 places, 310/331 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 305 ms :[p0, false, p0, false]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s105 0) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 30 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLCardinality-02 finished in 1670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 155 transition count 290
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 125 transition count 288
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 124 transition count 285
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 121 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 120 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 73 place count 120 transition count 274
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 99 place count 103 transition count 259
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 103 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 113 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 102 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 114 place count 102 transition count 252
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 116 place count 101 transition count 252
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 118 place count 99 transition count 246
Iterating global reduction 7 with 2 rules applied. Total rules applied 120 place count 99 transition count 246
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 162 place count 78 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 167 place count 78 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 170 place count 75 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 173 place count 75 transition count 213
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 211 place count 56 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 225 place count 56 transition count 324
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 253 place count 56 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 257 place count 54 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 258 place count 53 transition count 321
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 49 edges and 51 vertex of which 16 / 51 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 261 place count 42 transition count 321
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 298 place count 42 transition count 284
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 300 place count 40 transition count 260
Iterating global reduction 11 with 2 rules applied. Total rules applied 302 place count 40 transition count 260
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 11 with 74 rules applied. Total rules applied 376 place count 40 transition count 186
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 378 place count 38 transition count 176
Iterating global reduction 11 with 2 rules applied. Total rules applied 380 place count 38 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 384 place count 36 transition count 174
Applied a total of 384 rules in 94 ms. Remains 36 /166 variables (removed 130) and now considering 174/331 (removed 157) transitions.
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 36 cols
[2024-06-02 21:15:30] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 21:15:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 21:15:30] [INFO ] Invariant cache hit.
[2024-06-02 21:15:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:15:30] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 21:15:30] [INFO ] Redundant transitions in 37 ms returned [95, 123, 169, 173]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 21:15:30] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:30] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 7 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 21:15:30] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 21:15:30] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 21:15:30] [INFO ] Invariant cache hit.
[2024-06-02 21:15:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:15:31] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 599 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s25 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-03 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 309
Applied a total of 29 rules in 7 ms. Remains 154 /166 variables (removed 12) and now considering 309/331 (removed 22) transitions.
// Phase 1: matrix 309 rows 154 cols
[2024-06-02 21:15:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:15:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:15:31] [INFO ] Invariant cache hit.
[2024-06-02 21:15:31] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-06-02 21:15:31] [INFO ] Invariant cache hit.
[2024-06-02 21:15:31] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 309/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 154/166 places, 309/331 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(AND (EQ s142 0) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-04 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 317
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 310
Applied a total of 29 rules in 11 ms. Remains 154 /166 variables (removed 12) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 21:15:31] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:15:32] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 21:15:32] [INFO ] Invariant cache hit.
[2024-06-02 21:15:32] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 21:15:32] [INFO ] Invariant cache hit.
[2024-06-02 21:15:32] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 154/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s48 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-06 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F((G(F(p3))||p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 289
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 123 transition count 287
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 66 place count 123 transition count 278
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 114 transition count 278
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 106 transition count 263
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 106 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 106 place count 106 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 105 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 105 transition count 256
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 104 transition count 256
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 102 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 102 transition count 250
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 151 place count 83 transition count 231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 156 place count 83 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 159 place count 80 transition count 219
Iterating global reduction 6 with 3 rules applied. Total rules applied 162 place count 80 transition count 219
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 198 place count 62 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 211 place count 62 transition count 316
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 239 place count 62 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 243 place count 60 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 59 transition count 313
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 57 vertex of which 19 / 57 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 247 place count 46 transition count 313
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 290 place count 46 transition count 270
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 292 place count 44 transition count 247
Iterating global reduction 9 with 2 rules applied. Total rules applied 294 place count 44 transition count 247
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 9 with 78 rules applied. Total rules applied 372 place count 44 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 372 place count 44 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 374 place count 43 transition count 168
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 376 place count 41 transition count 160
Iterating global reduction 9 with 2 rules applied. Total rules applied 378 place count 41 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 382 place count 39 transition count 158
Applied a total of 382 rules in 68 ms. Remains 39 /166 variables (removed 127) and now considering 158/331 (removed 173) transitions.
[2024-06-02 21:15:32] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
// Phase 1: matrix 146 rows 39 cols
[2024-06-02 21:15:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 21:15:32] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
[2024-06-02 21:15:32] [INFO ] Invariant cache hit.
[2024-06-02 21:15:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 21:15:32] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-02 21:15:32] [INFO ] Redundant transitions in 26 ms returned [114, 115, 157]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
[2024-06-02 21:15:32] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
// Phase 1: matrix 143 rows 39 cols
[2024-06-02 21:15:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:33] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/166 places, 155/331 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 154
Applied a total of 2 rules in 4 ms. Remains 38 /39 variables (removed 1) and now considering 154/155 (removed 1) transitions.
[2024-06-02 21:15:33] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 21:15:33] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 21:15:33] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
[2024-06-02 21:15:33] [INFO ] Invariant cache hit.
[2024-06-02 21:15:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 21:15:33] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/166 places, 154/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 507 ms. Remains : 38/166 places, 154/331 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s31 1), p0:(NEQ s34 1), p2:(OR (EQ s20 0) (EQ s1 1)), p3:(OR (EQ s20 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-07 finished in 731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&((!p1&&F(!p2)) U (G((!p1&&F(!p2)))||(!p1&&G(!p2))))))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 321
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 320
Applied a total of 16 rules in 5 ms. Remains 158 /166 variables (removed 8) and now considering 320/331 (removed 11) transitions.
// Phase 1: matrix 320 rows 158 cols
[2024-06-02 21:15:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:15:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:15:33] [INFO ] Invariant cache hit.
[2024-06-02 21:15:33] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 21:15:33] [INFO ] Invariant cache hit.
[2024-06-02 21:15:33] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/166 places, 320/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 158/166 places, 320/331 transitions.
Stuttering acceptance computed with spot in 1477 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2), (NOT p0), p2, p2, p1, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), p2, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 8}, { cond=p1, acceptance={0, 1} source=2 dest: 9}], [{ cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 10}], [{ cond=p2, acceptance={0, 1} source=4 dest: 4}], [{ cond=p1, acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=6 dest: 11}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 13}, { cond=p1, acceptance={0, 1} source=6 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={0} source=7 dest: 16}, { cond=(AND p1 (NOT p2)), acceptance={1} source=7 dest: 17}, { cond=(AND p1 p2), acceptance={0, 1} source=7 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={0} source=8 dest: 16}, { cond=p1, acceptance={0, 1} source=8 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 16}, { cond=p1, acceptance={0, 1} source=9 dest: 18}, { cond=(NOT p1), acceptance={0, 1} source=9 dest: 19}], [{ cond=(AND p1 p2), acceptance={0, 1} source=10 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=10 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={1} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=10 dest: 20}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=11 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=11 dest: 13}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=11 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=12 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=12 dest: 16}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=12 dest: 17}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=12 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=13 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=13 dest: 16}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=13 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=14 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=14 dest: 16}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=14 dest: 18}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=14 dest: 19}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=15 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=15 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=15 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=15 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=16 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=16 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=16 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=16 dest: 5}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=17 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=17 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=17 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=17 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=17 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=17 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=17 dest: 20}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=18 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=18 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=18 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=18 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=18 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=19 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=19 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=19 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=19 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=20 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=20 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={0} source=20 dest: 8}, { cond=(AND p1 p2), acceptance={0, 1} source=20 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=20 dest: 21}, { cond=(AND p1 (NOT p2)), acceptance={1} source=20 dest: 22}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=21 dest: 11}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=21 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={0} source=21 dest: 13}, { cond=(AND p1 p2), acceptance={0, 1} source=21 dest: 14}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=21 dest: 23}, { cond=(AND p1 (NOT p2)), acceptance={1} source=21 dest: 24}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=22 dest: 15}, { cond=(AND (NOT p1) p2), acceptance={0} source=22 dest: 16}, { cond=(AND p1 (NOT p2)), acceptance={1} source=22 dest: 17}, { cond=(AND p1 p2), acceptance={0, 1} source=22 dest: 18}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=22 dest: 19}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=22 dest: 25}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=23 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=23 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=23 dest: 13}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=23 dest: 14}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=23 dest: 23}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=23 dest: 24}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=24 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=24 dest: 16}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=24 dest: 17}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=24 dest: 18}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=24 dest: 19}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=24 dest: 25}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=25 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=25 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=25 dest: 8}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=25 dest: 9}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=25 dest: 21}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=25 dest: 22}]], initial=0, aps=[p1:(OR (EQ s81 0) (EQ s56 1)), p2:(OR (EQ s115 0) (EQ s27 1)), p0:(OR (EQ s50 0) (EQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-12 finished in 2220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 176 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 286
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 121 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 119 transition count 282
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 75 place count 119 transition count 274
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 91 place count 111 transition count 274
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 102 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 102 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 115 place count 102 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 101 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 116 place count 101 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 99 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 99 transition count 248
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 160 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 166 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 76 transition count 214
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 206 place count 59 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 59 transition count 328
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 237 place count 59 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 57 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 56 transition count 323
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 54 vertex of which 19 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 245 place count 43 transition count 323
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 288 place count 43 transition count 280
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 290 place count 41 transition count 258
Iterating global reduction 9 with 2 rules applied. Total rules applied 292 place count 41 transition count 258
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 367 place count 41 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 367 place count 41 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 369 place count 40 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 371 place count 38 transition count 174
Iterating global reduction 9 with 2 rules applied. Total rules applied 373 place count 38 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 377 place count 36 transition count 172
Applied a total of 377 rules in 48 ms. Remains 36 /166 variables (removed 130) and now considering 172/331 (removed 159) transitions.
[2024-06-02 21:15:35] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 36 cols
[2024-06-02 21:15:35] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 21:15:35] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
[2024-06-02 21:15:35] [INFO ] Invariant cache hit.
[2024-06-02 21:15:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:15:35] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 21:15:35] [INFO ] Redundant transitions in 26 ms returned [129, 171]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
[2024-06-02 21:15:35] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 21:15:35] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 21:15:36] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 21:15:36] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 21:15:36] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:15:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:15:36] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 21:15:36] [INFO ] Invariant cache hit.
[2024-06-02 21:15:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:15:36] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 552 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-14 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 158 transition count 320
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 158 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 158 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 157 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 157 transition count 314
Applied a total of 23 rules in 5 ms. Remains 157 /166 variables (removed 9) and now considering 314/331 (removed 17) transitions.
// Phase 1: matrix 314 rows 157 cols
[2024-06-02 21:15:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:15:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:15:36] [INFO ] Invariant cache hit.
[2024-06-02 21:15:36] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-02 21:15:36] [INFO ] Invariant cache hit.
[2024-06-02 21:15:36] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/166 places, 314/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 157/166 places, 314/331 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s133 1), p0:(OR (EQ s133 1) (EQ s121 0) (EQ s15 1)), p2:(OR (EQ s82 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0 p2)), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 219 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Finished probabilistic random walk after 46982 steps, run visited all 7 properties in 194 ms. (steps per millisecond=242 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 194 ms. (steps per millisecond=242 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0 p2)), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 584 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-02 21:15:40] [INFO ] Invariant cache hit.
[2024-06-02 21:15:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:15:40] [INFO ] Invariant cache hit.
[2024-06-02 21:15:40] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-06-02 21:15:40] [INFO ] Invariant cache hit.
[2024-06-02 21:15:40] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 157/157 places, 314/314 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 217 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Finished probabilistic random walk after 46982 steps, run visited all 7 properties in 196 ms. (steps per millisecond=239 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 197 ms. (steps per millisecond=238 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 600 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Built C files in :
/tmp/ltsmin10034871592832566626
[2024-06-02 21:15:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10034871592832566626
Running compilation step : cd /tmp/ltsmin10034871592832566626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 915 ms.
Running link step : cd /tmp/ltsmin10034871592832566626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10034871592832566626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1770996722286632450.hoa' '--buchi-type=spotba'
LTSmin run took 795 ms.
FORMULA MedleyA-PT-16-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 9404 ms.
All properties solved by simple procedures.
Total runtime 25383 ms.

BK_STOP 1717362946898

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="MedleyA-PT-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-16, 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 r597-smll-171734926500077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;