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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 132K 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-11-LTLCardinality-00
FORMULA_NAME CO4-PT-11-LTLCardinality-01
FORMULA_NAME CO4-PT-11-LTLCardinality-02
FORMULA_NAME CO4-PT-11-LTLCardinality-03
FORMULA_NAME CO4-PT-11-LTLCardinality-04
FORMULA_NAME CO4-PT-11-LTLCardinality-05
FORMULA_NAME CO4-PT-11-LTLCardinality-06
FORMULA_NAME CO4-PT-11-LTLCardinality-07
FORMULA_NAME CO4-PT-11-LTLCardinality-08
FORMULA_NAME CO4-PT-11-LTLCardinality-09
FORMULA_NAME CO4-PT-11-LTLCardinality-10
FORMULA_NAME CO4-PT-11-LTLCardinality-11
FORMULA_NAME CO4-PT-11-LTLCardinality-12
FORMULA_NAME CO4-PT-11-LTLCardinality-13
FORMULA_NAME CO4-PT-11-LTLCardinality-14
FORMULA_NAME CO4-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368683871

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-11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:51:25] [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:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:25] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-02 22:51:25] [INFO ] Transformed 545 places.
[2024-06-02 22:51:25] [INFO ] Transformed 617 transitions.
[2024-06-02 22:51:25] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:25] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 152 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 3 formulas.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 377 transition count 438
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 73 place count 317 transition count 376
Iterating global reduction 1 with 60 rules applied. Total rules applied 133 place count 317 transition count 376
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 177 place count 273 transition count 332
Iterating global reduction 1 with 44 rules applied. Total rules applied 221 place count 273 transition count 332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 224 place count 273 transition count 329
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 247 place count 250 transition count 306
Iterating global reduction 2 with 23 rules applied. Total rules applied 270 place count 250 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 250 transition count 305
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 285 place count 236 transition count 291
Iterating global reduction 3 with 14 rules applied. Total rules applied 299 place count 236 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 301 place count 236 transition count 289
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 306 place count 231 transition count 284
Iterating global reduction 4 with 5 rules applied. Total rules applied 311 place count 231 transition count 284
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 313 place count 229 transition count 282
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 229 transition count 282
Applied a total of 315 rules in 88 ms. Remains 229 /388 variables (removed 159) and now considering 282/440 (removed 158) transitions.
// Phase 1: matrix 282 rows 229 cols
[2024-06-02 22:51:26] [INFO ] Computed 4 invariants in 25 ms
[2024-06-02 22:51:26] [INFO ] Implicit Places using invariants in 201 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 228 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 228/388 places, 282/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 228/388 places, 282/440 transitions.
Support contains 18 out of 228 places after structural reductions.
[2024-06-02 22:51:26] [INFO ] Flatten gal took : 43 ms
[2024-06-02 22:51:26] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:51:26] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 282 rows 228 cols
[2024-06-02 22:51:28] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 22:51:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:28] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 22:51:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:29] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 22:51:29] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-06-02 22:51:29] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 8 properties in 16 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 239 edges and 228 vertex of which 3 / 228 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 350 edges and 226 vertex of which 212 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 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 112 rules applied. Total rules applied 114 place count 212 transition count 155
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 212 place count 114 transition count 155
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 212 place count 114 transition count 137
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 248 place count 96 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 251 place count 93 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 254 place count 93 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 93 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 255 place count 93 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 259 place count 91 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 89 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 89 transition count 129
Performed 39 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 341 place count 50 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 344 place count 50 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 346 place count 48 transition count 77
Iterating global reduction 4 with 2 rules applied. Total rules applied 348 place count 48 transition count 77
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 350 place count 47 transition count 76
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 114 edges and 47 vertex of which 46 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 4 with 6 rules applied. Total rules applied 356 place count 46 transition count 71
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 360 place count 42 transition count 67
Iterating global reduction 5 with 4 rules applied. Total rules applied 364 place count 42 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 365 place count 42 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 371 place count 39 transition count 63
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 374 place count 39 transition count 60
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 377 place count 36 transition count 57
Iterating global reduction 7 with 3 rules applied. Total rules applied 380 place count 36 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 382 place count 36 transition count 55
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 383 place count 35 transition count 54
Iterating global reduction 8 with 1 rules applied. Total rules applied 384 place count 35 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 385 place count 35 transition count 53
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 403 place count 26 transition count 54
Drop transitions removed 9 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 419 place count 26 transition count 38
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 426 place count 19 transition count 31
Iterating global reduction 10 with 7 rules applied. Total rules applied 433 place count 19 transition count 31
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 440 place count 19 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 441 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 442 place count 18 transition count 22
Iterating global reduction 11 with 1 rules applied. Total rules applied 443 place count 18 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 444 place count 18 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 448 place count 18 transition count 17
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 453 place count 14 transition count 16
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 454 place count 14 transition count 16
Graph (complete) has 31 edges and 14 vertex of which 13 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 13 with 1 rules applied. Total rules applied 455 place count 13 transition count 16
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 456 place count 13 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 457 place count 13 transition count 15
Graph (complete) has 28 edges and 13 vertex of which 12 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 15 with 1 rules applied. Total rules applied 458 place count 12 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 459 place count 12 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 460 place count 12 transition count 14
Graph (complete) has 25 edges and 12 vertex of which 11 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 17 with 1 rules applied. Total rules applied 461 place count 11 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 462 place count 11 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 463 place count 10 transition count 12
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t57.t61.t261.t266 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 466 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 7 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 469 place count 4 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 475 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 475 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 22 with 2 rules applied. Total rules applied 477 place count 2 transition count 2
Applied a total of 477 rules in 46 ms. Remains 2 /228 variables (removed 226) and now considering 2/282 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 2/228 places, 2/282 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-11-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 353 edges and 228 vertex of which 222 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 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)&&G(p1))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 281
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 219 transition count 273
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 219 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 214 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 214 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 212 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 212 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 210 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 210 transition count 264
Applied a total of 36 rules in 18 ms. Remains 210 /228 variables (removed 18) and now considering 264/282 (removed 18) transitions.
// Phase 1: matrix 264 rows 210 cols
[2024-06-02 22:51:29] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:51:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:51:29] [INFO ] Invariant cache hit.
[2024-06-02 22:51:29] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 22:51:29] [INFO ] Invariant cache hit.
[2024-06-02 22:51:29] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/228 places, 264/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 210/228 places, 264/282 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 263 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s175 0), p0:(AND (EQ s92 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 3 ms.
FORMULA CO4-PT-11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-01 finished in 621 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 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 239 edges and 228 vertex of which 3 / 228 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 351 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 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 219 transition count 178
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 190 place count 125 transition count 178
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 190 place count 125 transition count 160
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 226 place count 107 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 228 place count 105 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 105 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 230 place count 105 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 103 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 236 place count 101 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 101 transition count 154
Performed 41 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 320 place count 60 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 323 place count 60 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 325 place count 58 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 355 place count 44 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 363 place count 44 transition count 90
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 373 place count 34 transition count 70
Iterating global reduction 4 with 10 rules applied. Total rules applied 383 place count 34 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 390 place count 34 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 393 place count 31 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 396 place count 31 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 398 place count 31 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 400 place count 30 transition count 62
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 415 place count 30 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 28 transition count 45
Applied a total of 417 rules in 29 ms. Remains 28 /228 variables (removed 200) and now considering 45/282 (removed 237) transitions.
[2024-06-02 22:51:30] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
// Phase 1: matrix 41 rows 28 cols
[2024-06-02 22:51:30] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:51:30] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
[2024-06-02 22:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 22:51:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:30] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
[2024-06-02 22:51:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/228 places, 45/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 28/228 places, 45/282 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-04 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:(EQ s6 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 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-04 finished in 242 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||(X(X(X(p2)))&&p1)))))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 281
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 220 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 220 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 215 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 215 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 214 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 214 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 213 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 213 transition count 266
Applied a total of 31 rules in 20 ms. Remains 213 /228 variables (removed 15) and now considering 266/282 (removed 16) transitions.
// Phase 1: matrix 266 rows 213 cols
[2024-06-02 22:51:30] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
[2024-06-02 22:51:30] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/228 places, 266/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 213/228 places, 266/282 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 0) (EQ s212 1)), p1:(AND (EQ s86 0) (EQ s108 1)), p2:(EQ s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-07 finished in 545 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 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 237 edges and 228 vertex of which 3 / 228 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 351 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 219 transition count 180
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 127 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 126 transition count 179
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 188 place count 126 transition count 161
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 224 place count 108 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 226 place count 106 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 106 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 228 place count 106 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 232 place count 104 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 102 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 102 transition count 155
Performed 40 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 316 place count 62 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 319 place count 62 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 321 place count 60 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 60 transition count 99
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
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 351 place count 46 transition count 100
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 359 place count 46 transition count 92
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 369 place count 36 transition count 72
Iterating global reduction 5 with 10 rules applied. Total rules applied 379 place count 36 transition count 72
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 386 place count 36 transition count 65
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 389 place count 33 transition count 56
Iterating global reduction 6 with 3 rules applied. Total rules applied 392 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 394 place count 33 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 396 place count 32 transition count 63
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 410 place count 32 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 412 place count 30 transition count 47
Applied a total of 412 rules in 44 ms. Remains 30 /228 variables (removed 198) and now considering 47/282 (removed 235) transitions.
[2024-06-02 22:51:30] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
// Phase 1: matrix 44 rows 30 cols
[2024-06-02 22:51:30] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:51:30] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 22:51:30] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:30] [INFO ] Invariant cache hit.
[2024-06-02 22:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-02 22:51:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:31] [INFO ] Invariant cache hit.
[2024-06-02 22:51:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/228 places, 47/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 30/228 places, 47/282 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s3 0) (NEQ s8 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 8 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-09 finished in 189 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 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 238 edges and 228 vertex of which 3 / 228 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 351 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 98 rules applied. Total rules applied 100 place count 223 transition count 179
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 197 place count 126 transition count 179
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 126 transition count 161
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 233 place count 108 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 235 place count 106 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 106 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 237 place count 106 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 241 place count 104 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 243 place count 102 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 102 transition count 155
Performed 40 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 325 place count 62 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 328 place count 62 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 60 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 60 transition count 101
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 360 place count 46 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 368 place count 46 transition count 94
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 379 place count 35 transition count 72
Iterating global reduction 4 with 11 rules applied. Total rules applied 390 place count 35 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 398 place count 35 transition count 64
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 401 place count 32 transition count 55
Iterating global reduction 5 with 3 rules applied. Total rules applied 404 place count 32 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 406 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 408 place count 31 transition count 61
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 422 place count 31 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 424 place count 29 transition count 45
Applied a total of 424 rules in 24 ms. Remains 29 /228 variables (removed 199) and now considering 45/282 (removed 237) transitions.
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
// Phase 1: matrix 43 rows 29 cols
[2024-06-02 22:51:31] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 22:51:31] [INFO ] Invariant cache hit.
[2024-06-02 22:51:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-02 22:51:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-02 22:51:31] [INFO ] Invariant cache hit.
[2024-06-02 22:51:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/228 places, 45/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 29/228 places, 45/282 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23 reset in 145 ms.
Stuttering criterion allowed to conclude after 125 steps with 17 reset in 1 ms.
FORMULA CO4-PT-11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLCardinality-14 finished in 329 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(F(p0))||G(p1))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 282/282 transitions.
Graph (trivial) has 234 edges and 228 vertex of which 3 / 228 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 351 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 219 transition count 182
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 183 place count 129 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 128 transition count 181
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 184 place count 128 transition count 163
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 220 place count 110 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 222 place count 108 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 108 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 224 place count 108 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 106 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 230 place count 104 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 104 transition count 157
Performed 39 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 310 place count 65 transition count 111
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 317 place count 65 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 319 place count 63 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 63 transition count 102
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
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 349 place count 49 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 357 place count 49 transition count 95
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 366 place count 40 transition count 77
Iterating global reduction 5 with 9 rules applied. Total rules applied 375 place count 40 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 40 transition count 71
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 383 place count 38 transition count 65
Iterating global reduction 6 with 2 rules applied. Total rules applied 385 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 386 place count 38 transition count 64
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 389 place count 38 transition count 61
Partial Post-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 398 place count 38 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 400 place count 36 transition count 59
Applied a total of 400 rules in 28 ms. Remains 36 /228 variables (removed 192) and now considering 59/282 (removed 223) transitions.
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
// Phase 1: matrix 56 rows 36 cols
[2024-06-02 22:51:31] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
[2024-06-02 22:51:31] [INFO ] Invariant cache hit.
[2024-06-02 22:51:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 22:51:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:31] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
[2024-06-02 22:51:31] [INFO ] Invariant cache hit.
[2024-06-02 22:51:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/228 places, 59/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 36/228 places, 59/282 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-11-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:(OR (EQ s8 0) (EQ s15 1) (EQ s13 1)), p0:(EQ s4 0)], 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 17 reset in 75 ms.
Product exploration explored 100000 steps with 5 reset in 74 ms.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
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)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 56 transitions (discarded 3 similar events)
[2024-06-02 22:51:32] [INFO ] Invariant cache hit.
[2024-06-02 22:51:32] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:51:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:32] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
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))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-11-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-11-LTLCardinality-15 finished in 725 ms.
All properties solved by simple procedures.
Total runtime 6600 ms.

BK_STOP 1717368693232

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

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