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.r571-tall-171734910100057.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 CO4-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 177K 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 CO4-PT-12-LTLCardinality-00
FORMULA_NAME CO4-PT-12-LTLCardinality-01
FORMULA_NAME CO4-PT-12-LTLCardinality-02
FORMULA_NAME CO4-PT-12-LTLCardinality-03
FORMULA_NAME CO4-PT-12-LTLCardinality-04
FORMULA_NAME CO4-PT-12-LTLCardinality-05
FORMULA_NAME CO4-PT-12-LTLCardinality-06
FORMULA_NAME CO4-PT-12-LTLCardinality-07
FORMULA_NAME CO4-PT-12-LTLCardinality-08
FORMULA_NAME CO4-PT-12-LTLCardinality-09
FORMULA_NAME CO4-PT-12-LTLCardinality-10
FORMULA_NAME CO4-PT-12-LTLCardinality-11
FORMULA_NAME CO4-PT-12-LTLCardinality-12
FORMULA_NAME CO4-PT-12-LTLCardinality-13
FORMULA_NAME CO4-PT-12-LTLCardinality-14
FORMULA_NAME CO4-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368698038

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=CO4-PT-12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:51:39] [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 22:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:39] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 22:51:39] [INFO ] Transformed 649 places.
[2024-06-02 22:51:40] [INFO ] Transformed 782 transitions.
[2024-06-02 22:51:40] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:40] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 105 place count 376 transition count 472
Iterating global reduction 1 with 85 rules applied. Total rules applied 190 place count 376 transition count 472
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 256 place count 310 transition count 388
Iterating global reduction 1 with 66 rules applied. Total rules applied 322 place count 310 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 324 place count 310 transition count 386
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 354 place count 280 transition count 356
Iterating global reduction 2 with 30 rules applied. Total rules applied 384 place count 280 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 386 place count 280 transition count 354
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 404 place count 262 transition count 336
Iterating global reduction 3 with 18 rules applied. Total rules applied 422 place count 262 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 424 place count 262 transition count 334
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 430 place count 256 transition count 328
Iterating global reduction 4 with 6 rules applied. Total rules applied 436 place count 256 transition count 328
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 438 place count 254 transition count 326
Iterating global reduction 4 with 2 rules applied. Total rules applied 440 place count 254 transition count 326
Applied a total of 440 rules in 93 ms. Remains 254 /477 variables (removed 223) and now considering 326/563 (removed 237) transitions.
// Phase 1: matrix 326 rows 254 cols
[2024-06-02 22:51:40] [INFO ] Computed 6 invariants in 22 ms
[2024-06-02 22:51:40] [INFO ] Implicit Places using invariants in 227 ms returned [6, 175]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 253 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/477 places, 326/563 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 252/477 places, 326/563 transitions.
Support contains 10 out of 252 places after structural reductions.
[2024-06-02 22:51:40] [INFO ] Flatten gal took : 49 ms
[2024-06-02 22:51:40] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:51:40] [INFO ] Input system was already deterministic with 326 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 326 rows 252 cols
[2024-06-02 22:51:41] [INFO ] Computed 4 invariants in 15 ms
[2024-06-02 22:51:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:51:41] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:51:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:51:41] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 22:51:42] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 22:51:42] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 326/326 transitions.
Graph (trivial) has 268 edges and 252 vertex of which 3 / 252 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 428 edges and 250 vertex of which 236 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 236 transition count 193
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 221 place count 135 transition count 193
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 221 place count 135 transition count 172
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 263 place count 114 transition count 172
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 248 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 265 place count 113 transition count 171
Drop transitions 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 3 with 2 rules applied. Total rules applied 267 place count 113 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 112 transition count 169
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 272 place count 108 transition count 164
Iterating global reduction 5 with 4 rules applied. Total rules applied 276 place count 108 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 279 place count 108 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 279 place count 108 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 107 transition count 160
Performed 45 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 371 place count 62 transition count 98
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 377 place count 62 transition count 92
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 382 place count 57 transition count 87
Iterating global reduction 7 with 5 rules applied. Total rules applied 387 place count 57 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 388 place count 57 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 392 place count 55 transition count 84
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 394 place count 55 transition count 82
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 396 place count 53 transition count 80
Iterating global reduction 9 with 2 rules applied. Total rules applied 398 place count 53 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 399 place count 53 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 401 place count 52 transition count 78
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 402 place count 52 transition count 77
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 403 place count 51 transition count 76
Iterating global reduction 11 with 1 rules applied. Total rules applied 404 place count 51 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 405 place count 51 transition count 75
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 425 place count 41 transition count 76
Drop transitions removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 443 place count 41 transition count 58
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 452 place count 32 transition count 49
Iterating global reduction 13 with 9 rules applied. Total rules applied 461 place count 32 transition count 49
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 469 place count 32 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 471 place count 31 transition count 44
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 474 place count 31 transition count 41
Free-agglomeration rule applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 481 place count 31 transition count 34
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 489 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 490 place count 23 transition count 32
Reduce places removed 2 places and 0 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 15 with 4 rules applied. Total rules applied 494 place count 21 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 496 place count 19 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 2 Pre rules applied. Total rules applied 496 place count 19 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 500 place count 17 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 504 place count 15 transition count 26
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 509 place count 15 transition count 21
Applied a total of 509 rules in 62 ms. Remains 15 /252 variables (removed 237) and now considering 21/326 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 15/252 places, 21/326 transitions.
Finished random walk after 122 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA CO4-PT-12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 431 edges and 252 vertex of which 247 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 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 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 326/326 transitions.
Graph (trivial) has 271 edges and 252 vertex of which 3 / 252 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 429 edges and 250 vertex of which 245 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 244 transition count 219
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 198 place count 146 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 198 place count 146 transition count 197
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 242 place count 124 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 246 place count 120 transition count 191
Iterating global reduction 2 with 4 rules applied. Total rules applied 250 place count 120 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 252 place count 120 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 252 place count 120 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 119 transition count 188
Performed 48 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 350 place count 71 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 355 place count 71 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 359 place count 67 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 363 place count 67 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 365 place count 66 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 393 place count 52 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 402 place count 52 transition count 107
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 413 place count 41 transition count 85
Iterating global reduction 5 with 11 rules applied. Total rules applied 424 place count 41 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 432 place count 41 transition count 77
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 435 place count 38 transition count 68
Iterating global reduction 6 with 3 rules applied. Total rules applied 438 place count 38 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 440 place count 38 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 442 place count 37 transition count 72
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 450 place count 37 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 452 place count 35 transition count 62
Applied a total of 452 rules in 48 ms. Remains 35 /252 variables (removed 217) and now considering 62/326 (removed 264) transitions.
[2024-06-02 22:51:42] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
// Phase 1: matrix 58 rows 35 cols
[2024-06-02 22:51:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:51:42] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
[2024-06-02 22:51:42] [INFO ] Invariant cache hit.
[2024-06-02 22:51:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 22:51:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:42] [INFO ] Flow matrix only has 58 transitions (discarded 4 similar events)
[2024-06-02 22:51:42] [INFO ] Invariant cache hit.
[2024-06-02 22:51:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/252 places, 62/326 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 35/252 places, 62/326 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 125 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 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 6 steps with 0 reset in 2 ms.
FORMULA CO4-PT-12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLCardinality-03 finished in 352 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)||G(p1))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 326/326 transitions.
Graph (trivial) has 270 edges and 252 vertex of which 3 / 252 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 429 edges and 250 vertex of which 245 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 244 transition count 220
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 196 place count 147 transition count 220
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 196 place count 147 transition count 198
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 240 place count 125 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 242 place count 123 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 123 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 123 transition count 194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 245 place count 123 transition count 193
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 122 transition count 193
Performed 49 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 345 place count 73 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 349 place count 73 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 352 place count 70 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 355 place count 70 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 357 place count 69 transition count 117
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 385 place count 55 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 394 place count 55 transition count 111
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 405 place count 44 transition count 89
Iterating global reduction 5 with 11 rules applied. Total rules applied 416 place count 44 transition count 89
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 424 place count 44 transition count 81
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 427 place count 41 transition count 72
Iterating global reduction 6 with 3 rules applied. Total rules applied 430 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 432 place count 41 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 40 transition count 76
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 443 place count 40 transition count 67
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 444 place count 40 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 446 place count 38 transition count 65
Applied a total of 446 rules in 33 ms. Remains 38 /252 variables (removed 214) and now considering 65/326 (removed 261) transitions.
[2024-06-02 22:51:42] [INFO ] Flow matrix only has 61 transitions (discarded 4 similar events)
// Phase 1: matrix 61 rows 38 cols
[2024-06-02 22:51:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 22:51:42] [INFO ] Flow matrix only has 61 transitions (discarded 4 similar events)
[2024-06-02 22:51:42] [INFO ] Invariant cache hit.
[2024-06-02 22:51:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-02 22:51:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:42] [INFO ] Flow matrix only has 61 transitions (discarded 4 similar events)
[2024-06-02 22:51:42] [INFO ] Invariant cache hit.
[2024-06-02 22:51:42] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/252 places, 65/326 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 38/252 places, 65/326 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s7 1), p1:(EQ s17 1)], nbAcceptance=2, 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 7 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLCardinality-06 finished in 234 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(F(p0)))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 326/326 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 247 transition count 321
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 247 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 247 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 242 transition count 313
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 242 transition count 313
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 238 transition count 309
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 238 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 238 transition count 306
Applied a total of 34 rules in 14 ms. Remains 238 /252 variables (removed 14) and now considering 306/326 (removed 20) transitions.
// Phase 1: matrix 306 rows 238 cols
[2024-06-02 22:51:42] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:51:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:51:42] [INFO ] Invariant cache hit.
[2024-06-02 22:51:42] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 22:51:43] [INFO ] Invariant cache hit.
[2024-06-02 22:51:43] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/252 places, 306/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 238/252 places, 306/326 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s176 0) (EQ s99 0))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 411 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 21 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 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-12-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-12-LTLCardinality-13 finished in 995 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(p1)||p0))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 326/326 transitions.
Graph (trivial) has 268 edges and 252 vertex of which 3 / 252 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 429 edges and 250 vertex of which 245 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 244 transition count 223
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 150 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 149 transition count 222
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 192 place count 149 transition count 199
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 238 place count 126 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 241 place count 123 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 123 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 123 transition count 192
Performed 48 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 342 place count 75 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 346 place count 75 transition count 123
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 350 place count 71 transition count 119
Iterating global reduction 5 with 4 rules applied. Total rules applied 354 place count 71 transition count 119
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 5 with 2 rules applied. Total rules applied 356 place count 70 transition count 118
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 384 place count 56 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 393 place count 56 transition count 112
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 404 place count 45 transition count 90
Iterating global reduction 6 with 11 rules applied. Total rules applied 415 place count 45 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 423 place count 45 transition count 82
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 425 place count 43 transition count 76
Iterating global reduction 7 with 2 rules applied. Total rules applied 427 place count 43 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 428 place count 43 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 430 place count 42 transition count 82
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 439 place count 42 transition count 73
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 441 place count 42 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 443 place count 40 transition count 71
Applied a total of 443 rules in 33 ms. Remains 40 /252 variables (removed 212) and now considering 71/326 (removed 255) transitions.
[2024-06-02 22:51:43] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
// Phase 1: matrix 66 rows 40 cols
[2024-06-02 22:51:43] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:51:43] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:51:43] [INFO ] Invariant cache hit.
[2024-06-02 22:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-02 22:51:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:43] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:51:43] [INFO ] Invariant cache hit.
[2024-06-02 22:51:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/252 places, 71/326 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 40/252 places, 71/326 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s24 0), p0:(OR (EQ s26 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27 reset in 145 ms.
Product exploration explored 100000 steps with 43 reset in 70 ms.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Detected a total of 9/40 stabilizing places and 13/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 804 steps, including 79 resets, run visited all 2 properties in 15 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 71/71 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-06-02 22:51:44] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:51:44] [INFO ] Invariant cache hit.
[2024-06-02 22:51:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:51:44] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:51:44] [INFO ] Invariant cache hit.
[2024-06-02 22:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:44] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-02 22:51:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:44] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:51:44] [INFO ] Invariant cache hit.
[2024-06-02 22:51:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 40/40 places, 71/71 transitions.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Detected a total of 9/40 stabilizing places and 13/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 303 steps, including 29 resets, run visited all 2 properties in 12 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 60 reset in 53 ms.
Product exploration explored 100000 steps with 76 reset in 150 ms.
Built C files in :
/tmp/ltsmin5700690008229025259
[2024-06-02 22:51:45] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-06-02 22:51:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:45] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-06-02 22:51:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:45] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-06-02 22:51:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5700690008229025259
Running compilation step : cd /tmp/ltsmin5700690008229025259;'/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 269 ms.
Running link step : cd /tmp/ltsmin5700690008229025259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5700690008229025259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11167916584966105897.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA CO4-PT-12-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-12-LTLCardinality-15 finished in 2551 ms.
All properties solved by simple procedures.
Total runtime 6684 ms.

BK_STOP 1717368707806

--------------------
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="CO4-PT-12"
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 CO4-PT-12, 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 r571-tall-171734910100057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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