fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910100062
Last Updated
July 7, 2024

About the Execution of 2023-gold for CO4-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
326.728 8761.00 18356.00 528.90 FTFFTTFFFTTFTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K 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 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.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 191K 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-13-LTLCardinality-00
FORMULA_NAME CO4-PT-13-LTLCardinality-01
FORMULA_NAME CO4-PT-13-LTLCardinality-02
FORMULA_NAME CO4-PT-13-LTLCardinality-03
FORMULA_NAME CO4-PT-13-LTLCardinality-04
FORMULA_NAME CO4-PT-13-LTLCardinality-05
FORMULA_NAME CO4-PT-13-LTLCardinality-06
FORMULA_NAME CO4-PT-13-LTLCardinality-07
FORMULA_NAME CO4-PT-13-LTLCardinality-08
FORMULA_NAME CO4-PT-13-LTLCardinality-09
FORMULA_NAME CO4-PT-13-LTLCardinality-10
FORMULA_NAME CO4-PT-13-LTLCardinality-11
FORMULA_NAME CO4-PT-13-LTLCardinality-12
FORMULA_NAME CO4-PT-13-LTLCardinality-13
FORMULA_NAME CO4-PT-13-LTLCardinality-14
FORMULA_NAME CO4-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368710389

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-13
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:51:52] [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:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:52] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 22:51:52] [INFO ] Transformed 649 places.
[2024-06-02 22:51:52] [INFO ] Transformed 816 transitions.
[2024-06-02 22:51:52] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:52] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 172 places in 11 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 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 585
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 100 place count 381 transition count 503
Iterating global reduction 1 with 80 rules applied. Total rules applied 180 place count 381 transition count 503
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 244 place count 317 transition count 419
Iterating global reduction 1 with 64 rules applied. Total rules applied 308 place count 317 transition count 419
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 314 place count 317 transition count 413
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 340 place count 291 transition count 385
Iterating global reduction 2 with 26 rules applied. Total rules applied 366 place count 291 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 367 place count 291 transition count 384
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 382 place count 276 transition count 369
Iterating global reduction 3 with 15 rules applied. Total rules applied 397 place count 276 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 401 place count 276 transition count 365
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 404 place count 273 transition count 362
Iterating global reduction 4 with 3 rules applied. Total rules applied 407 place count 273 transition count 362
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 408 place count 272 transition count 361
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 272 transition count 361
Applied a total of 409 rules in 103 ms. Remains 272 /477 variables (removed 205) and now considering 361/589 (removed 228) transitions.
// Phase 1: matrix 361 rows 272 cols
[2024-06-02 22:51:52] [INFO ] Computed 6 invariants in 21 ms
[2024-06-02 22:51:52] [INFO ] Implicit Places using invariants in 235 ms returned [6, 197]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 263 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 270/477 places, 361/589 transitions.
Applied a total of 0 rules in 6 ms. Remains 270 /270 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 270/477 places, 361/589 transitions.
Support contains 14 out of 270 places after structural reductions.
[2024-06-02 22:51:53] [INFO ] Flatten gal took : 54 ms
[2024-06-02 22:51:53] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:51:53] [INFO ] Input system was already deterministic with 361 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 361 rows 270 cols
[2024-06-02 22:51:54] [INFO ] Computed 4 invariants in 10 ms
[2024-06-02 22:51:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:54] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:51:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:54] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 22:51:54] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-06-02 22:51:55] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 5 properties in 32 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 281 edges and 270 vertex of which 3 / 270 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 538 edges and 268 vertex of which 254 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 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 254 transition count 207
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 263 place count 132 transition count 207
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 263 place count 132 transition count 188
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 301 place count 113 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 304 place count 110 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 307 place count 110 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 307 place count 110 transition count 183
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 309 place count 109 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 310 place count 108 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 311 place count 108 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 107 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 107 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 107 transition count 180
Performed 42 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 398 place count 65 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 404 place count 65 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 409 place count 60 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 414 place count 60 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 415 place count 60 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 416 place count 59 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 417 place count 59 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 418 place count 59 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 422 place count 57 transition count 108
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 187 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 3 rules applied. Total rules applied 425 place count 56 transition count 106
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 457 place count 40 transition count 123
Drop transitions removed 32 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 497 place count 40 transition count 83
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 508 place count 29 transition count 61
Iterating global reduction 8 with 11 rules applied. Total rules applied 519 place count 29 transition count 61
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 528 place count 29 transition count 52
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 530 place count 27 transition count 44
Iterating global reduction 9 with 2 rules applied. Total rules applied 532 place count 27 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 533 place count 27 transition count 43
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 537 place count 27 transition count 39
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 538 place count 26 transition count 37
Iterating global reduction 10 with 1 rules applied. Total rules applied 539 place count 26 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 540 place count 26 transition count 36
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 547 place count 26 transition count 29
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 555 place count 19 transition count 28
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 557 place count 19 transition count 28
Graph (complete) has 62 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 558 place count 18 transition count 28
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 560 place count 18 transition count 26
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 562 place count 18 transition count 26
Graph (complete) has 56 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 563 place count 17 transition count 26
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 565 place count 17 transition count 24
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 567 place count 17 transition count 24
Graph (complete) has 50 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 568 place count 16 transition count 24
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 570 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 571 place count 15 transition count 21
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t101.t105.t302.t98.t335 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 18 with 4 rules applied. Total rules applied 575 place count 12 transition count 17
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 9 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 13 rules applied. Total rules applied 588 place count 5 transition count 9
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 8 rules applied. Total rules applied 596 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 596 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 598 place count 2 transition count 2
Applied a total of 598 rules in 59 ms. Remains 2 /270 variables (removed 268) and now considering 2/361 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 2/270 places, 2/361 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 541 edges and 270 vertex of which 265 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 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 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 281 edges and 270 vertex of which 3 / 270 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 539 edges and 268 vertex of which 263 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 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 262 transition count 234
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 238 place count 144 transition count 234
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 238 place count 144 transition count 214
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 278 place count 124 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 281 place count 121 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 284 place count 121 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 284 place count 121 transition count 209
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 286 place count 120 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 287 place count 119 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 119 transition count 208
Performed 44 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 376 place count 75 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 382 place count 75 transition count 143
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 387 place count 70 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 392 place count 70 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 70 transition count 135
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 429 place count 52 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 438 place count 52 transition count 146
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 449 place count 41 transition count 102
Iterating global reduction 5 with 11 rules applied. Total rules applied 460 place count 41 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 468 place count 41 transition count 94
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 471 place count 38 transition count 76
Iterating global reduction 6 with 3 rules applied. Total rules applied 474 place count 38 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 476 place count 38 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 480 place count 36 transition count 90
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 506 place count 36 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 34 transition count 62
Applied a total of 508 rules in 48 ms. Remains 34 /270 variables (removed 236) and now considering 62/361 (removed 299) transitions.
[2024-06-02 22:51:55] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
// Phase 1: matrix 50 rows 34 cols
[2024-06-02 22:51:55] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:51:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 22:51:55] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
[2024-06-02 22:51:55] [INFO ] Invariant cache hit.
[2024-06-02 22:51:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:55] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 22:51:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:55] [INFO ] Flow matrix only has 50 transitions (discarded 12 similar events)
[2024-06-02 22:51:55] [INFO ] Invariant cache hit.
[2024-06-02 22:51:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/270 places, 62/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 34/270 places, 62/361 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 127 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-00 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 (EQ s17 0) (EQ s30 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 7 steps with 0 reset in 3 ms.
FORMULA CO4-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-00 finished in 346 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(G(p0)))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 261 transition count 351
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 261 transition count 351
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 253 transition count 343
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 253 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 253 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 247 transition count 336
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 247 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 247 transition count 335
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 242 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 242 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 242 transition count 329
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 240 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 240 transition count 327
Applied a total of 63 rules in 22 ms. Remains 240 /270 variables (removed 30) and now considering 327/361 (removed 34) transitions.
// Phase 1: matrix 327 rows 240 cols
[2024-06-02 22:51:55] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:51:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:51:55] [INFO ] Invariant cache hit.
[2024-06-02 22:51:55] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 22:51:55] [INFO ] Invariant cache hit.
[2024-06-02 22:51:55] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/270 places, 327/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 240/270 places, 327/361 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-03 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 276 edges and 270 vertex of which 3 / 270 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 539 edges and 268 vertex of which 263 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 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 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 262 transition count 239
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 228 place count 149 transition count 239
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 228 place count 149 transition count 219
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 268 place count 129 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 271 place count 126 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 126 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 274 place count 126 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 125 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 124 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 124 transition count 213
Performed 44 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 366 place count 80 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 372 place count 80 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 377 place count 75 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 382 place count 75 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 75 transition count 141
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 419 place count 57 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 425 place count 57 transition count 155
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 434 place count 48 transition count 119
Iterating global reduction 5 with 9 rules applied. Total rules applied 443 place count 48 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 448 place count 48 transition count 114
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 451 place count 45 transition count 96
Iterating global reduction 6 with 3 rules applied. Total rules applied 454 place count 45 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 456 place count 45 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 460 place count 43 transition count 118
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 494 place count 43 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 496 place count 41 transition count 82
Applied a total of 496 rules in 44 ms. Remains 41 /270 variables (removed 229) and now considering 82/361 (removed 279) transitions.
[2024-06-02 22:51:56] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
// Phase 1: matrix 64 rows 41 cols
[2024-06-02 22:51:56] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:51:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:51:56] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
[2024-06-02 22:51:56] [INFO ] Invariant cache hit.
[2024-06-02 22:51:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-02 22:51:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:56] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
[2024-06-02 22:51:56] [INFO ] Invariant cache hit.
[2024-06-02 22:51:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/270 places, 82/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 41/270 places, 82/361 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 1) (AND (NEQ s5 0) (NEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-07 finished in 259 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) U p1) U (p1&&X(p2))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 264 transition count 355
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 264 transition count 355
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 258 transition count 349
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 258 transition count 349
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 253 transition count 344
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 253 transition count 344
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 248 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 248 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 248 transition count 338
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 246 transition count 336
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 246 transition count 336
Applied a total of 49 rules in 31 ms. Remains 246 /270 variables (removed 24) and now considering 336/361 (removed 25) transitions.
// Phase 1: matrix 336 rows 246 cols
[2024-06-02 22:51:56] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:51:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:51:56] [INFO ] Invariant cache hit.
[2024-06-02 22:51:56] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-02 22:51:56] [INFO ] Invariant cache hit.
[2024-06-02 22:51:56] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 246/270 places, 336/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 246/270 places, 336/361 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s212 0) (EQ s217 1)), p0:(OR (EQ s151 0) (EQ s193 1)), p2:(EQ s106 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 320 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 511 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 154 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-13-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-13-LTLCardinality-09 finished in 1313 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 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 361/361 transitions.
Graph (trivial) has 281 edges and 270 vertex of which 3 / 270 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 539 edges and 268 vertex of which 263 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 262 transition count 236
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 234 place count 146 transition count 236
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 234 place count 146 transition count 216
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 274 place count 126 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 123 transition count 212
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 123 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 280 place count 123 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 122 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 283 place count 121 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 121 transition count 210
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 374 place count 76 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 380 place count 76 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 385 place count 71 transition count 137
Iterating global reduction 3 with 5 rules applied. Total rules applied 390 place count 71 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 71 transition count 136
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 427 place count 53 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 435 place count 53 transition count 148
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 445 place count 43 transition count 108
Iterating global reduction 5 with 10 rules applied. Total rules applied 455 place count 43 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 462 place count 43 transition count 101
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 465 place count 40 transition count 83
Iterating global reduction 6 with 3 rules applied. Total rules applied 468 place count 40 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 470 place count 40 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 474 place count 38 transition count 101
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 504 place count 38 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 506 place count 36 transition count 69
Applied a total of 506 rules in 34 ms. Remains 36 /270 variables (removed 234) and now considering 69/361 (removed 292) transitions.
[2024-06-02 22:51:57] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
// Phase 1: matrix 54 rows 36 cols
[2024-06-02 22:51:57] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:51:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:51:57] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
[2024-06-02 22:51:57] [INFO ] Invariant cache hit.
[2024-06-02 22:51:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:51:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:57] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
[2024-06-02 22:51:57] [INFO ] Invariant cache hit.
[2024-06-02 22:51:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/270 places, 69/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 36/270 places, 69/361 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLCardinality-15 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 s3 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 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLCardinality-15 finished in 237 ms.
All properties solved by simple procedures.
Total runtime 5653 ms.

BK_STOP 1717368719150

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

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