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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-LTLCardinality-00
FORMULA_NAME MedleyA-PT-17-LTLCardinality-01
FORMULA_NAME MedleyA-PT-17-LTLCardinality-02
FORMULA_NAME MedleyA-PT-17-LTLCardinality-03
FORMULA_NAME MedleyA-PT-17-LTLCardinality-04
FORMULA_NAME MedleyA-PT-17-LTLCardinality-05
FORMULA_NAME MedleyA-PT-17-LTLCardinality-06
FORMULA_NAME MedleyA-PT-17-LTLCardinality-07
FORMULA_NAME MedleyA-PT-17-LTLCardinality-08
FORMULA_NAME MedleyA-PT-17-LTLCardinality-09
FORMULA_NAME MedleyA-PT-17-LTLCardinality-10
FORMULA_NAME MedleyA-PT-17-LTLCardinality-11
FORMULA_NAME MedleyA-PT-17-LTLCardinality-12
FORMULA_NAME MedleyA-PT-17-LTLCardinality-13
FORMULA_NAME MedleyA-PT-17-LTLCardinality-14
FORMULA_NAME MedleyA-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717363083592

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-17
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:18:06] [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:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:18:06] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-02 21:18:06] [INFO ] Transformed 248 places.
[2024-06-02 21:18:06] [INFO ] Transformed 591 transitions.
[2024-06-02 21:18:06] [INFO ] Found NUPN structural information;
[2024-06-02 21:18:06] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 264 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-17-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 203 transition count 512
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 203 transition count 512
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 124 place count 203 transition count 478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 128 place count 199 transition count 470
Iterating global reduction 1 with 4 rules applied. Total rules applied 132 place count 199 transition count 470
Applied a total of 132 rules in 80 ms. Remains 199 /248 variables (removed 49) and now considering 470/589 (removed 119) transitions.
// Phase 1: matrix 470 rows 199 cols
[2024-06-02 21:18:07] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 21:18:07] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-02 21:18:07] [INFO ] Invariant cache hit.
[2024-06-02 21:18:07] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2024-06-02 21:18:08] [INFO ] Invariant cache hit.
[2024-06-02 21:18:08] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/248 places, 470/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1363 ms. Remains : 199/248 places, 470/589 transitions.
Support contains 23 out of 199 places after structural reductions.
[2024-06-02 21:18:08] [INFO ] Flatten gal took : 141 ms
[2024-06-02 21:18:08] [INFO ] Flatten gal took : 69 ms
[2024-06-02 21:18:08] [INFO ] Input system was already deterministic with 470 transitions.
Incomplete random walk after 10000 steps, including 344 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-06-02 21:18:10] [INFO ] Invariant cache hit.
[2024-06-02 21:18:10] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2024-06-02 21:18:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 21:18:11] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2024-06-02 21:18:11] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 7 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 2 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 10 ms to minimize.
[2024-06-02 21:18:12] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 1 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 728 ms
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 1 ms to minimize.
[2024-06-02 21:18:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2024-06-02 21:18:14] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 1 ms to minimize.
[2024-06-02 21:18:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-06-02 21:18:14] [INFO ] After 3064ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 355 ms.
[2024-06-02 21:18:14] [INFO ] After 3624ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 15 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 164 edges and 199 vertex of which 9 / 199 are part of one of the 3 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 193 transition count 437
Reduce places removed 24 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 28 rules applied. Total rules applied 53 place count 169 transition count 433
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 165 transition count 433
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 57 place count 165 transition count 422
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 79 place count 154 transition count 422
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 150 transition count 416
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 150 transition count 416
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 127 place count 130 transition count 396
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 129 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 129 transition count 380
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 155 place count 116 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 116 transition count 418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 115 transition count 410
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 115 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 115 transition count 406
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 173 place count 115 transition count 398
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 181 place count 111 transition count 394
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 189 place count 107 transition count 423
Free-agglomeration rule applied 35 times.
Iterating global reduction 5 with 35 rules applied. Total rules applied 224 place count 107 transition count 388
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 291 place count 72 transition count 356
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 307 place count 72 transition count 340
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 311 place count 72 transition count 372
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 323 place count 68 transition count 364
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 324 place count 67 transition count 363
Applied a total of 324 rules in 252 ms. Remains 67 /199 variables (removed 132) and now considering 363/470 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 67/199 places, 363/470 transitions.
Incomplete random walk after 10000 steps, including 548 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:18:15] [INFO ] Flow matrix only has 294 transitions (discarded 69 similar events)
// Phase 1: matrix 294 rows 67 cols
[2024-06-02 21:18:15] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:18:15] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:18:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:18:15] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:18:15] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-06-02 21:18:16] [INFO ] After 593ms SMT Verify possible using 213 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:18:16] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:18:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2024-06-02 21:18:16] [INFO ] After 815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 657 ms.
[2024-06-02 21:18:16] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 363/363 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 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 65 transition count 360
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 64 transition count 360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 63 transition count 358
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 63 transition count 358
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 57 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 57 transition count 351
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 56 transition count 339
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 56 transition count 339
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 31 place count 52 transition count 370
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 39 place count 52 transition count 362
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 44 place count 52 transition count 357
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 52 transition count 356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 51 transition count 356
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 51 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 50 transition count 354
Applied a total of 48 rules in 120 ms. Remains 50 /67 variables (removed 17) and now considering 354/363 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 50/67 places, 354/363 transitions.
Finished random walk after 3880 steps, including 317 resets, run visited all 1 properties in 110 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA MedleyA-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 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((F(p0)&&F(G(p1)))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 196 edges and 199 vertex of which 9 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 192 transition count 433
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 162 transition count 433
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 61 place count 162 transition count 422
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 83 place count 151 transition count 422
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 143 transition count 410
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 143 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 99 place count 143 transition count 408
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 141 transition count 408
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 147 place count 119 transition count 386
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 117 transition count 358
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 117 transition count 358
Performed 23 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 197 place count 94 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 94 transition count 449
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 92 transition count 433
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 92 transition count 433
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 211 place count 92 transition count 425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 91 transition count 440
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 230 place count 91 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 238 place count 87 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 86 transition count 418
Applied a total of 239 rules in 143 ms. Remains 86 /199 variables (removed 113) and now considering 418/470 (removed 52) transitions.
[2024-06-02 21:18:17] [INFO ] Flow matrix only has 390 transitions (discarded 28 similar events)
// Phase 1: matrix 390 rows 86 cols
[2024-06-02 21:18:17] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 21:18:17] [INFO ] Flow matrix only has 390 transitions (discarded 28 similar events)
[2024-06-02 21:18:17] [INFO ] Invariant cache hit.
[2024-06-02 21:18:17] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 21:18:18] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-06-02 21:18:18] [INFO ] Redundant transitions in 34 ms returned []
[2024-06-02 21:18:18] [INFO ] Flow matrix only has 390 transitions (discarded 28 similar events)
[2024-06-02 21:18:18] [INFO ] Invariant cache hit.
[2024-06-02 21:18:18] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/199 places, 418/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1021 ms. Remains : 86/199 places, 418/470 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 338 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s79 0) (EQ s49 1)), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-17-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-01 finished in 1440 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) U (p1 U X((G(p3)||p2)))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 191 transition count 459
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 191 transition count 459
Applied a total of 16 rules in 8 ms. Remains 191 /199 variables (removed 8) and now considering 459/470 (removed 11) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-02 21:18:18] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:18:19] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-02 21:18:19] [INFO ] Invariant cache hit.
[2024-06-02 21:18:19] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-06-02 21:18:19] [INFO ] Invariant cache hit.
[2024-06-02 21:18:19] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/199 places, 459/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 871 ms. Remains : 191/199 places, 459/470 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s127 1), p0:(OR (EQ s97 0) (EQ s71 1)), p2:(OR (EQ s127 1) (EQ s163 0) (EQ s187 1)), p3:(OR (EQ s163 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 141 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-17-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLCardinality-05 finished in 2081 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)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 200 edges and 199 vertex of which 9 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 434
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 163 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 161 transition count 432
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 63 place count 161 transition count 421
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 85 place count 150 transition count 421
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 94 place count 141 transition count 408
Iterating global reduction 3 with 9 rules applied. Total rules applied 103 place count 141 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 103 place count 141 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 138 transition count 405
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 153 place count 116 transition count 383
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 114 transition count 355
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 114 transition count 355
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 203 place count 91 transition count 443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 207 place count 91 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 89 transition count 423
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 89 transition count 423
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 219 place count 89 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 221 place count 88 transition count 430
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 243 place count 88 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 251 place count 84 transition count 404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 83 transition count 403
Applied a total of 252 rules in 90 ms. Remains 83 /199 variables (removed 116) and now considering 403/470 (removed 67) transitions.
[2024-06-02 21:18:21] [INFO ] Flow matrix only has 371 transitions (discarded 32 similar events)
// Phase 1: matrix 371 rows 83 cols
[2024-06-02 21:18:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:18:21] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 21:18:21] [INFO ] Flow matrix only has 371 transitions (discarded 32 similar events)
[2024-06-02 21:18:21] [INFO ] Invariant cache hit.
[2024-06-02 21:18:21] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 21:18:21] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-06-02 21:18:21] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 21:18:21] [INFO ] Flow matrix only has 371 transitions (discarded 32 similar events)
[2024-06-02 21:18:21] [INFO ] Invariant cache hit.
[2024-06-02 21:18:21] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/199 places, 403/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 801 ms. Remains : 83/199 places, 403/470 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s42 0) (NEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-07 finished in 861 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))||(p1 U X(p2))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 190 transition count 457
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 190 transition count 457
Applied a total of 18 rules in 7 ms. Remains 190 /199 variables (removed 9) and now considering 457/470 (removed 13) transitions.
// Phase 1: matrix 457 rows 190 cols
[2024-06-02 21:18:21] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:21] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-02 21:18:21] [INFO ] Invariant cache hit.
[2024-06-02 21:18:22] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-02 21:18:22] [INFO ] Invariant cache hit.
[2024-06-02 21:18:22] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/199 places, 457/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 190/199 places, 457/470 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s78 1), p0:(OR (EQ s54 0) (EQ s130 1)), p2:(OR (EQ s54 0) (EQ s130 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/190 stabilizing places and 16/457 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 100 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-17-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLCardinality-12 finished in 1859 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((G(!p0)||(!p0&&F(G(p1)))))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Graph (trivial) has 195 edges and 199 vertex of which 9 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 434
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 163 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 162 transition count 433
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 162 transition count 422
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 83 place count 151 transition count 422
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 91 place count 143 transition count 411
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 143 transition count 411
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 99 place count 143 transition count 408
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 140 transition count 408
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 3 with 40 rules applied. Total rules applied 145 place count 120 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 118 transition count 360
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 118 transition count 360
Performed 22 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 193 place count 96 transition count 435
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 96 transition count 431
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 94 transition count 415
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 94 transition count 415
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 209 place count 94 transition count 407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 92 transition count 437
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 239 place count 92 transition count 411
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 247 place count 88 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 87 transition count 406
Applied a total of 248 rules in 75 ms. Remains 87 /199 variables (removed 112) and now considering 406/470 (removed 64) transitions.
[2024-06-02 21:18:23] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
// Phase 1: matrix 378 rows 87 cols
[2024-06-02 21:18:23] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:18:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 21:18:23] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
[2024-06-02 21:18:23] [INFO ] Invariant cache hit.
[2024-06-02 21:18:24] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 21:18:24] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-06-02 21:18:24] [INFO ] Redundant transitions in 35 ms returned []
[2024-06-02 21:18:24] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
[2024-06-02 21:18:24] [INFO ] Invariant cache hit.
[2024-06-02 21:18:24] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/199 places, 406/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 817 ms. Remains : 87/199 places, 406/470 transitions.
Stuttering acceptance computed with spot in 136 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s83 0) (EQ s29 1)), p0:(OR (EQ s53 0) (EQ s78 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLCardinality-13 finished in 979 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(p0)||X(X(F(p1)))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 470/470 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 191 transition count 459
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 191 transition count 459
Applied a total of 16 rules in 5 ms. Remains 191 /199 variables (removed 8) and now considering 459/470 (removed 11) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-02 21:18:24] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:24] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 21:18:24] [INFO ] Invariant cache hit.
[2024-06-02 21:18:25] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-06-02 21:18:25] [INFO ] Invariant cache hit.
[2024-06-02 21:18:25] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/199 places, 459/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 191/199 places, 459/470 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-17-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s81 0) (EQ s46 1)), p0:(AND (EQ s92 0) (EQ s79 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Product exploration explored 100000 steps with 33333 reset in 177 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-17-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-17-LTLCardinality-15 finished in 1546 ms.
All properties solved by simple procedures.
Total runtime 19812 ms.

BK_STOP 1717363107302

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

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