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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
460.424 19533.00 37679.00 221.60 FFFFFFTTFFFFFTFT 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-171734910200103.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-21, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 344K 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-21-LTLFireability-00
FORMULA_NAME CO4-PT-21-LTLFireability-01
FORMULA_NAME CO4-PT-21-LTLFireability-02
FORMULA_NAME CO4-PT-21-LTLFireability-03
FORMULA_NAME CO4-PT-21-LTLFireability-04
FORMULA_NAME CO4-PT-21-LTLFireability-05
FORMULA_NAME CO4-PT-21-LTLFireability-06
FORMULA_NAME CO4-PT-21-LTLFireability-07
FORMULA_NAME CO4-PT-21-LTLFireability-08
FORMULA_NAME CO4-PT-21-LTLFireability-09
FORMULA_NAME CO4-PT-21-LTLFireability-10
FORMULA_NAME CO4-PT-21-LTLFireability-11
FORMULA_NAME CO4-PT-21-LTLFireability-12
FORMULA_NAME CO4-PT-21-LTLFireability-13
FORMULA_NAME CO4-PT-21-LTLFireability-14
FORMULA_NAME CO4-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368977922

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:56:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:56:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:56:19] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 22:56:19] [INFO ] Transformed 1400 places.
[2024-06-02 22:56:19] [INFO ] Transformed 1583 transitions.
[2024-06-02 22:56:19] [INFO ] Found NUPN structural information;
[2024-06-02 22:56:19] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 307 places in 16 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 165 places :
Symmetric choice reduction at 1 with 165 rule applications. Total rules 193 place count 905 transition count 1066
Iterating global reduction 1 with 165 rules applied. Total rules applied 358 place count 905 transition count 1066
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 501 place count 762 transition count 922
Iterating global reduction 1 with 143 rules applied. Total rules applied 644 place count 762 transition count 922
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 646 place count 762 transition count 920
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 714 place count 694 transition count 852
Iterating global reduction 2 with 68 rules applied. Total rules applied 782 place count 694 transition count 852
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 831 place count 645 transition count 803
Iterating global reduction 2 with 49 rules applied. Total rules applied 880 place count 645 transition count 803
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 882 place count 645 transition count 801
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 905 place count 622 transition count 778
Iterating global reduction 3 with 23 rules applied. Total rules applied 928 place count 622 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 930 place count 622 transition count 776
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 937 place count 615 transition count 769
Iterating global reduction 4 with 7 rules applied. Total rules applied 944 place count 615 transition count 769
Applied a total of 944 rules in 563 ms. Remains 615 /1093 variables (removed 478) and now considering 769/1236 (removed 467) transitions.
// Phase 1: matrix 769 rows 615 cols
[2024-06-02 22:56:20] [INFO ] Computed 5 invariants in 22 ms
[2024-06-02 22:56:20] [INFO ] Implicit Places using invariants in 394 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 437 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 614/1093 places, 769/1236 transitions.
Applied a total of 0 rules in 12 ms. Remains 614 /614 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1012 ms. Remains : 614/1093 places, 769/1236 transitions.
Support contains 24 out of 614 places after structural reductions.
[2024-06-02 22:56:21] [INFO ] Flatten gal took : 138 ms
[2024-06-02 22:56:21] [INFO ] Flatten gal took : 73 ms
[2024-06-02 22:56:21] [INFO ] Input system was already deterministic with 769 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 769 rows 614 cols
[2024-06-02 22:56:22] [INFO ] Computed 4 invariants in 15 ms
[2024-06-02 22:56:22] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 22:56:23] [INFO ] After 1577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-06-02 22:56:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:24] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-06-02 22:56:25] [INFO ] After 1538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 539 ms.
[2024-06-02 22:56:26] [INFO ] After 2553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 16 properties in 99 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 665 edges and 614 vertex of which 3 / 614 are part of one of the 1 SCC in 16 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 960 edges and 612 vertex of which 595 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 306 rules applied. Total rules applied 308 place count 595 transition count 448
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 283 rules applied. Total rules applied 591 place count 314 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 592 place count 313 transition count 446
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 592 place count 313 transition count 383
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 718 place count 250 transition count 383
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 722 place count 246 transition count 379
Iterating global reduction 3 with 4 rules applied. Total rules applied 726 place count 246 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 726 place count 246 transition count 377
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 730 place count 244 transition count 377
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 732 place count 242 transition count 375
Iterating global reduction 3 with 2 rules applied. Total rules applied 734 place count 242 transition count 375
Performed 98 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 930 place count 144 transition count 256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 937 place count 144 transition count 249
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 946 place count 135 transition count 240
Iterating global reduction 4 with 9 rules applied. Total rules applied 955 place count 135 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 956 place count 135 transition count 239
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 964 place count 131 transition count 235
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 968 place count 131 transition count 231
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 972 place count 127 transition count 227
Iterating global reduction 6 with 4 rules applied. Total rules applied 976 place count 127 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 977 place count 127 transition count 226
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 7 with 6 rules applied. Total rules applied 983 place count 124 transition count 223
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 986 place count 124 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 989 place count 121 transition count 217
Iterating global reduction 8 with 3 rules applied. Total rules applied 992 place count 121 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 994 place count 121 transition count 215
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 995 place count 120 transition count 214
Iterating global reduction 9 with 1 rules applied. Total rules applied 996 place count 120 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 997 place count 120 transition count 213
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 1077 place count 80 transition count 216
Drop transitions removed 16 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 1121 place count 80 transition count 172
Discarding 35 places :
Symmetric choice reduction at 11 with 35 rule applications. Total rules 1156 place count 45 transition count 116
Iterating global reduction 11 with 35 rules applied. Total rules applied 1191 place count 45 transition count 116
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 11 with 28 rules applied. Total rules applied 1219 place count 45 transition count 88
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1225 place count 39 transition count 71
Iterating global reduction 12 with 6 rules applied. Total rules applied 1231 place count 39 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1235 place count 39 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1236 place count 39 transition count 66
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1237 place count 38 transition count 65
Iterating global reduction 13 with 1 rules applied. Total rules applied 1238 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1239 place count 38 transition count 64
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 1244 place count 38 transition count 59
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 1252 place count 33 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1254 place count 33 transition count 56
Graph (complete) has 106 edges and 33 vertex of which 32 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 1255 place count 32 transition count 56
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1256 place count 32 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1257 place count 32 transition count 54
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 17 with 2 rules applied. Total rules applied 1259 place count 31 transition count 53
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 89 edges and 31 vertex of which 24 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 8 rules applied. Total rules applied 1267 place count 24 transition count 46
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 1279 place count 24 transition count 34
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1280 place count 23 transition count 33
Iterating global reduction 19 with 1 rules applied. Total rules applied 1281 place count 23 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1282 place count 23 transition count 32
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 1284 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1285 place count 22 transition count 29
Iterating global reduction 20 with 1 rules applied. Total rules applied 1286 place count 22 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1287 place count 22 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1288 place count 22 transition count 28
Graph (complete) has 55 edges and 22 vertex of which 21 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 21 with 1 rules applied. Total rules applied 1289 place count 21 transition count 28
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1290 place count 21 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 1291 place count 21 transition count 27
Graph (complete) has 52 edges and 21 vertex of which 20 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 23 with 1 rules applied. Total rules applied 1292 place count 20 transition count 27
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 1293 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 25 with 1 rules applied. Total rules applied 1294 place count 19 transition count 25
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t71.t75.t676.t737.t68 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 4 rules applied. Total rules applied 1298 place count 13 transition count 22
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t662.t45.t46.t47.t48.t49.t50.t51.t52.t61.t34.t737.t68.t167.t168.t169.t746.t18.t172 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 26 with 8 rules applied. Total rules applied 1306 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 27 with 8 rules applied. Total rules applied 1314 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 28 with 8 rules applied. Total rules applied 1322 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 29 with 1 Pre rules applied. Total rules applied 1322 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 29 with 2 rules applied. Total rules applied 1324 place count 2 transition count 2
Applied a total of 1324 rules in 153 ms. Remains 2 /614 variables (removed 612) and now considering 2/769 (removed 767) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2/614 places, 2/769 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.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 963 edges and 614 vertex of which 608 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' '!(F((p0||G((F((p1&&X(p2))) U p3)))))'
Support contains 5 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 602 transition count 757
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 602 transition count 757
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 595 transition count 750
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 595 transition count 750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 595 transition count 749
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 591 transition count 745
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 591 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 589 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 589 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 589 transition count 742
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 588 transition count 741
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 588 transition count 741
Applied a total of 54 rules in 70 ms. Remains 588 /614 variables (removed 26) and now considering 741/769 (removed 28) transitions.
// Phase 1: matrix 741 rows 588 cols
[2024-06-02 22:56:27] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 22:56:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 22:56:27] [INFO ] Invariant cache hit.
[2024-06-02 22:56:27] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 22:56:27] [INFO ] Invariant cache hit.
[2024-06-02 22:56:27] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/614 places, 741/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 784 ms. Remains : 588/614 places, 741/769 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 302 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-21-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s165 1) (EQ s323 1)), p3:(EQ s230 1), p1:(EQ s202 1), p2:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 4 ms.
FORMULA CO4-PT-21-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-00 finished in 1164 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||G(p1)))))'
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 664 edges and 614 vertex of which 3 / 614 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 961 edges and 612 vertex of which 606 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 605 transition count 488
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 545 place count 335 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 546 place count 334 transition count 486
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 546 place count 334 transition count 422
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 674 place count 270 transition count 422
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 677 place count 267 transition count 419
Iterating global reduction 3 with 3 rules applied. Total rules applied 680 place count 267 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 680 place count 267 transition count 417
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 684 place count 265 transition count 417
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 686 place count 263 transition count 415
Iterating global reduction 3 with 2 rules applied. Total rules applied 688 place count 263 transition count 415
Performed 105 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 898 place count 158 transition count 282
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 905 place count 158 transition count 275
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 914 place count 149 transition count 266
Iterating global reduction 4 with 9 rules applied. Total rules applied 923 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 924 place count 149 transition count 265
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 5 with 6 rules applied. Total rules applied 930 place count 146 transition count 262
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1020 place count 101 transition count 265
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1049 place count 101 transition count 236
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1087 place count 63 transition count 160
Iterating global reduction 6 with 38 rules applied. Total rules applied 1125 place count 63 transition count 160
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1150 place count 63 transition count 135
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1160 place count 53 transition count 106
Iterating global reduction 7 with 10 rules applied. Total rules applied 1170 place count 53 transition count 106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1177 place count 53 transition count 99
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 8 with 2 rules applied. Total rules applied 1179 place count 52 transition count 109
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1193 place count 52 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1195 place count 50 transition count 93
Applied a total of 1195 rules in 87 ms. Remains 50 /614 variables (removed 564) and now considering 93/769 (removed 676) transitions.
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
// Phase 1: matrix 84 rows 50 cols
[2024-06-02 22:56:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:56:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:28] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-02 22:56:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:28] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/614 places, 93/769 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 50/614 places, 93/769 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-21-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s12 1), p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-01 finished in 335 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)&&F(p1))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 661 edges and 614 vertex of which 3 / 614 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 961 edges and 612 vertex of which 606 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 605 transition count 490
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 270 rules applied. Total rules applied 541 place count 337 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 336 transition count 488
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 542 place count 336 transition count 424
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 670 place count 272 transition count 424
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 673 place count 269 transition count 421
Iterating global reduction 3 with 3 rules applied. Total rules applied 676 place count 269 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 676 place count 269 transition count 419
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 680 place count 267 transition count 419
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 682 place count 265 transition count 417
Iterating global reduction 3 with 2 rules applied. Total rules applied 684 place count 265 transition count 417
Performed 104 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 892 place count 161 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 899 place count 161 transition count 278
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 908 place count 152 transition count 269
Iterating global reduction 4 with 9 rules applied. Total rules applied 917 place count 152 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 918 place count 152 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 924 place count 149 transition count 265
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1014 place count 104 transition count 268
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1042 place count 104 transition count 240
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1080 place count 66 transition count 164
Iterating global reduction 6 with 38 rules applied. Total rules applied 1118 place count 66 transition count 164
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1143 place count 66 transition count 139
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1152 place count 57 transition count 113
Iterating global reduction 7 with 9 rules applied. Total rules applied 1161 place count 57 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1167 place count 57 transition count 107
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 8 with 2 rules applied. Total rules applied 1169 place count 56 transition count 117
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1183 place count 56 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 56 transition count 103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1186 place count 54 transition count 101
Applied a total of 1186 rules in 73 ms. Remains 54 /614 variables (removed 560) and now considering 101/769 (removed 668) transitions.
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
// Phase 1: matrix 91 rows 54 cols
[2024-06-02 22:56:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:56:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 22:56:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 91 transitions (discarded 10 similar events)
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/614 places, 101/769 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 54/614 places, 101/769 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s27 0) (EQ s19 1)), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-02 finished in 358 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 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Graph (trivial) has 665 edges and 614 vertex of which 3 / 614 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 961 edges and 612 vertex of which 606 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 605 transition count 488
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 545 place count 335 transition count 486
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 547 place count 334 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 548 place count 333 transition count 485
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 548 place count 333 transition count 421
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 676 place count 269 transition count 421
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 679 place count 266 transition count 418
Iterating global reduction 4 with 3 rules applied. Total rules applied 682 place count 266 transition count 418
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 682 place count 266 transition count 416
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 686 place count 264 transition count 416
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 688 place count 262 transition count 414
Iterating global reduction 4 with 2 rules applied. Total rules applied 690 place count 262 transition count 414
Performed 105 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 900 place count 157 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 907 place count 157 transition count 274
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 916 place count 148 transition count 265
Iterating global reduction 5 with 9 rules applied. Total rules applied 925 place count 148 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 926 place count 148 transition count 264
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 932 place count 145 transition count 261
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 1022 place count 100 transition count 264
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 1052 place count 100 transition count 234
Discarding 40 places :
Symmetric choice reduction at 7 with 40 rule applications. Total rules 1092 place count 60 transition count 154
Iterating global reduction 7 with 40 rules applied. Total rules applied 1132 place count 60 transition count 154
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 1159 place count 60 transition count 127
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1168 place count 51 transition count 101
Iterating global reduction 8 with 9 rules applied. Total rules applied 1177 place count 51 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1184 place count 51 transition count 94
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 9 with 2 rules applied. Total rules applied 1186 place count 50 transition count 102
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 1198 place count 50 transition count 90
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1199 place count 50 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1201 place count 48 transition count 88
Applied a total of 1201 rules in 68 ms. Remains 48 /614 variables (removed 566) and now considering 88/769 (removed 681) transitions.
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 48 cols
[2024-06-02 22:56:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:56:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:56:28] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:29] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 22:56:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:29] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-06-02 22:56:29] [INFO ] Invariant cache hit.
[2024-06-02 22:56:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/614 places, 88/769 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 48/614 places, 88/769 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 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 0 ms.
FORMULA CO4-PT-21-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-03 finished in 256 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)&&((p0 U (p1&&X(p0)))||G(p2)))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 600 transition count 755
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 600 transition count 755
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 592 transition count 747
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 592 transition count 747
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 592 transition count 746
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 588 transition count 742
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 588 transition count 742
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 586 transition count 740
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 586 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 586 transition count 739
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 585 transition count 738
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 585 transition count 738
Applied a total of 60 rules in 50 ms. Remains 585 /614 variables (removed 29) and now considering 738/769 (removed 31) transitions.
// Phase 1: matrix 738 rows 585 cols
[2024-06-02 22:56:29] [INFO ] Computed 4 invariants in 12 ms
[2024-06-02 22:56:29] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 22:56:29] [INFO ] Invariant cache hit.
[2024-06-02 22:56:29] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-06-02 22:56:29] [INFO ] Invariant cache hit.
[2024-06-02 22:56:29] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 585/614 places, 738/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 585/614 places, 738/769 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s474 1), p1:(EQ s255 1), p2:(EQ s453 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-04 finished in 942 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(((p0 U (p1||G(p2)))||F(p0))))'
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 601 transition count 756
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 601 transition count 756
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 593 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 593 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 593 transition count 747
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 590 transition count 744
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 590 transition count 744
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 588 transition count 742
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 588 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 588 transition count 741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 587 transition count 740
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 587 transition count 740
Applied a total of 56 rules in 55 ms. Remains 587 /614 variables (removed 27) and now considering 740/769 (removed 29) transitions.
// Phase 1: matrix 740 rows 587 cols
[2024-06-02 22:56:30] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 22:56:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 22:56:30] [INFO ] Invariant cache hit.
[2024-06-02 22:56:30] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-06-02 22:56:30] [INFO ] Invariant cache hit.
[2024-06-02 22:56:30] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/614 places, 740/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 741 ms. Remains : 587/614 places, 740/769 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-21-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (EQ s491 1) (EQ s576 1)), p2:(NEQ s187 1), p1:(NEQ s234 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 559 ms.
Product exploration explored 100000 steps with 50000 reset in 553 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 931 edges and 587 vertex of which 582 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 26 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLFireability-07 finished in 2084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 599 transition count 754
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 599 transition count 754
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 590 transition count 745
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 590 transition count 745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 590 transition count 744
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 586 transition count 740
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 586 transition count 740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 584 transition count 738
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 584 transition count 738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 584 transition count 737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 583 transition count 736
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 583 transition count 736
Applied a total of 64 rules in 66 ms. Remains 583 /614 variables (removed 31) and now considering 736/769 (removed 33) transitions.
// Phase 1: matrix 736 rows 583 cols
[2024-06-02 22:56:32] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:56:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-02 22:56:32] [INFO ] Invariant cache hit.
[2024-06-02 22:56:32] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-06-02 22:56:32] [INFO ] Invariant cache hit.
[2024-06-02 22:56:33] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 583/614 places, 736/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 921 ms. Remains : 583/614 places, 736/769 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s438 1) (EQ s572 1)), p1:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-11 finished in 1123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 600 transition count 755
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 600 transition count 755
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 592 transition count 747
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 592 transition count 747
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 592 transition count 746
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 589 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 589 transition count 743
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 588 transition count 742
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 588 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 588 transition count 741
Applied a total of 54 rules in 53 ms. Remains 588 /614 variables (removed 26) and now considering 741/769 (removed 28) transitions.
// Phase 1: matrix 741 rows 588 cols
[2024-06-02 22:56:33] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:56:33] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 22:56:33] [INFO ] Invariant cache hit.
[2024-06-02 22:56:33] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-06-02 22:56:33] [INFO ] Invariant cache hit.
[2024-06-02 22:56:34] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/614 places, 741/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 588/614 places, 741/769 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s407 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-12 finished in 985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (p1 U (p2||G(p1))))))'
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 769/769 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 602 transition count 757
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 602 transition count 757
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 594 transition count 749
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 594 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 591 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 591 transition count 746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 590 transition count 745
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 590 transition count 745
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 589 transition count 744
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 589 transition count 744
Applied a total of 50 rules in 52 ms. Remains 589 /614 variables (removed 25) and now considering 744/769 (removed 25) transitions.
// Phase 1: matrix 744 rows 589 cols
[2024-06-02 22:56:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:56:34] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-02 22:56:34] [INFO ] Invariant cache hit.
[2024-06-02 22:56:34] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-06-02 22:56:34] [INFO ] Invariant cache hit.
[2024-06-02 22:56:35] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/614 places, 744/769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 589/614 places, 744/769 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (NEQ s19 1) (NEQ s13 1)), p1:(NEQ s13 1), p0:(NEQ s555 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 493 ms.
Product exploration explored 100000 steps with 50000 reset in 503 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 935 edges and 589 vertex of which 584 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 165 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLFireability-13 finished in 2269 ms.
All properties solved by simple procedures.
Total runtime 17114 ms.

BK_STOP 1717368997455

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-21"
export BK_EXAMINATION="LTLFireability"
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-21, examination is LTLFireability"
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-171734910200103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-PT-21 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;