fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910200102
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
496.632 26381.00 44974.00 299.40 FTFTFFTFFFFTTFFT 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-171734910200102.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200102
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CO4-PT-21-LTLCardinality-01
FORMULA_NAME CO4-PT-21-LTLCardinality-02
FORMULA_NAME CO4-PT-21-LTLCardinality-03
FORMULA_NAME CO4-PT-21-LTLCardinality-04
FORMULA_NAME CO4-PT-21-LTLCardinality-05
FORMULA_NAME CO4-PT-21-LTLCardinality-06
FORMULA_NAME CO4-PT-21-LTLCardinality-07
FORMULA_NAME CO4-PT-21-LTLCardinality-08
FORMULA_NAME CO4-PT-21-LTLCardinality-09
FORMULA_NAME CO4-PT-21-LTLCardinality-10
FORMULA_NAME CO4-PT-21-LTLCardinality-11
FORMULA_NAME CO4-PT-21-LTLCardinality-12
FORMULA_NAME CO4-PT-21-LTLCardinality-13
FORMULA_NAME CO4-PT-21-LTLCardinality-14
FORMULA_NAME CO4-PT-21-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368973864

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-21
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:56:15] [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:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:56:15] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 22:56:15] [INFO ] Transformed 1400 places.
[2024-06-02 22:56:15] [INFO ] Transformed 1583 transitions.
[2024-06-02 22:56:15] [INFO ] Found NUPN structural information;
[2024-06-02 22:56:15] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 307 places in 17 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 164 places :
Symmetric choice reduction at 1 with 164 rule applications. Total rules 192 place count 906 transition count 1067
Iterating global reduction 1 with 164 rules applied. Total rules applied 356 place count 906 transition count 1067
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 505 place count 757 transition count 917
Iterating global reduction 1 with 149 rules applied. Total rules applied 654 place count 757 transition count 917
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 657 place count 757 transition count 914
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 727 place count 687 transition count 844
Iterating global reduction 2 with 70 rules applied. Total rules applied 797 place count 687 transition count 844
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 847 place count 637 transition count 794
Iterating global reduction 2 with 50 rules applied. Total rules applied 897 place count 637 transition count 794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 900 place count 637 transition count 791
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 925 place count 612 transition count 766
Iterating global reduction 3 with 25 rules applied. Total rules applied 950 place count 612 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 952 place count 612 transition count 764
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 960 place count 604 transition count 756
Iterating global reduction 4 with 8 rules applied. Total rules applied 968 place count 604 transition count 756
Applied a total of 968 rules in 322 ms. Remains 604 /1093 variables (removed 489) and now considering 756/1236 (removed 480) transitions.
// Phase 1: matrix 756 rows 604 cols
[2024-06-02 22:56:16] [INFO ] Computed 5 invariants in 15 ms
[2024-06-02 22:56:16] [INFO ] Implicit Places using invariants in 318 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 432 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 603/1093 places, 756/1236 transitions.
Applied a total of 0 rules in 9 ms. Remains 603 /603 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 764 ms. Remains : 603/1093 places, 756/1236 transitions.
Support contains 18 out of 603 places after structural reductions.
[2024-06-02 22:56:16] [INFO ] Flatten gal took : 74 ms
[2024-06-02 22:56:16] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:56:16] [INFO ] Input system was already deterministic with 756 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :1
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 10001 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 756 rows 603 cols
[2024-06-02 22:56:18] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:56:18] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 22:56:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:56:19] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-06-02 22:56:19] [INFO ] After 863ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-06-02 22:56:20] [INFO ] After 1362ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 42 ms.
Support contains 7 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 756/756 transitions.
Graph (trivial) has 643 edges and 603 vertex of which 3 / 603 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 944 edges and 601 vertex of which 593 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 288 rules applied. Total rules applied 290 place count 593 transition count 455
Reduce places removed 274 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 276 rules applied. Total rules applied 566 place count 319 transition count 453
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 568 place count 318 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 317 transition count 452
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 569 place count 317 transition count 388
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 697 place count 253 transition count 388
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 700 place count 250 transition count 385
Iterating global reduction 4 with 3 rules applied. Total rules applied 703 place count 250 transition count 385
Performed 91 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 885 place count 159 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 891 place count 159 transition count 268
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 898 place count 152 transition count 261
Iterating global reduction 5 with 7 rules applied. Total rules applied 905 place count 152 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 906 place count 152 transition count 260
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 912 place count 149 transition count 257
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 916 place count 149 transition count 253
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 920 place count 145 transition count 249
Iterating global reduction 7 with 4 rules applied. Total rules applied 924 place count 145 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 925 place count 145 transition count 248
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 8 with 6 rules applied. Total rules applied 931 place count 142 transition count 245
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 934 place count 142 transition count 242
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 936 place count 140 transition count 240
Iterating global reduction 9 with 2 rules applied. Total rules applied 938 place count 140 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 940 place count 140 transition count 238
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -4
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 1020 place count 100 transition count 242
Drop transitions removed 16 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 1062 place count 100 transition count 200
Discarding 34 places :
Symmetric choice reduction at 11 with 34 rule applications. Total rules 1096 place count 66 transition count 146
Iterating global reduction 11 with 34 rules applied. Total rules applied 1130 place count 66 transition count 146
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 11 with 25 rules applied. Total rules applied 1155 place count 66 transition count 121
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1161 place count 60 transition count 104
Iterating global reduction 12 with 6 rules applied. Total rules applied 1167 place count 60 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1169 place count 60 transition count 102
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1174 place count 60 transition count 97
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1175 place count 59 transition count 96
Iterating global reduction 13 with 1 rules applied. Total rules applied 1176 place count 59 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1177 place count 59 transition count 95
Free-agglomeration rule applied 12 times.
Iterating global reduction 14 with 12 rules applied. Total rules applied 1189 place count 59 transition count 83
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 1203 place count 47 transition count 81
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1207 place count 47 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1208 place count 47 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1210 place count 46 transition count 79
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 120 edges and 46 vertex of which 45 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 7 rules applied. Total rules applied 1217 place count 45 transition count 73
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1218 place count 45 transition count 72
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1220 place count 43 transition count 70
Iterating global reduction 17 with 2 rules applied. Total rules applied 1222 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1223 place count 43 transition count 69
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1228 place count 43 transition count 64
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1229 place count 42 transition count 63
Iterating global reduction 18 with 1 rules applied. Total rules applied 1230 place count 42 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1231 place count 42 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1233 place count 42 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1234 place count 42 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1235 place count 42 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1236 place count 41 transition count 60
Applied a total of 1236 rules in 120 ms. Remains 41 /603 variables (removed 562) and now considering 60/756 (removed 696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 41/603 places, 60/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :2
Finished Best-First random walk after 6705 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1117 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-21-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 947 edges and 603 vertex of which 596 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
FORMULA CO4-PT-21-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)&&F(p2)))))'
Support contains 6 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 595 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 595 transition count 748
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 589 transition count 742
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 589 transition count 742
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 587 transition count 740
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 587 transition count 740
Applied a total of 32 rules in 42 ms. Remains 587 /603 variables (removed 16) and now considering 740/756 (removed 16) transitions.
// Phase 1: matrix 740 rows 587 cols
[2024-06-02 22:56:20] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 22:56:20] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 22:56:20] [INFO ] Invariant cache hit.
[2024-06-02 22:56:21] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 22:56:21] [INFO ] Invariant cache hit.
[2024-06-02 22:56:21] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/603 places, 740/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 816 ms. Remains : 587/603 places, 740/756 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 288 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s203 0) (EQ s304 1)), p1:(OR (EQ s517 0) (EQ s442 1)), p2:(OR (EQ s292 0) (EQ s149 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 493 ms.
Product exploration explored 100000 steps with 50000 reset in 422 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.7 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 76 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLCardinality-01 finished in 2174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 593 transition count 746
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 593 transition count 746
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 586 transition count 739
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 586 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 584 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 584 transition count 737
Applied a total of 38 rules in 36 ms. Remains 584 /603 variables (removed 19) and now considering 737/756 (removed 19) transitions.
// Phase 1: matrix 737 rows 584 cols
[2024-06-02 22:56:22] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 22:56:23] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:56:23] [INFO ] Invariant cache hit.
[2024-06-02 22:56:23] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-06-02 22:56:23] [INFO ] Invariant cache hit.
[2024-06-02 22:56:23] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 584/603 places, 737/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 584/603 places, 737/756 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-05 finished in 792 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))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Graph (trivial) has 653 edges and 603 vertex of which 3 / 603 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 945 edges and 601 vertex of which 594 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 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 593 transition count 476
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 325 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 324 transition count 474
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 324 transition count 410
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 670 place count 260 transition count 410
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 673 place count 257 transition count 407
Iterating global reduction 3 with 3 rules applied. Total rules applied 676 place count 257 transition count 407
Performed 100 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 876 place count 157 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 882 place count 157 transition count 275
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 890 place count 149 transition count 267
Iterating global reduction 4 with 8 rules applied. Total rules applied 898 place count 149 transition count 267
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 4 with 6 rules applied. Total rules applied 904 place count 146 transition count 264
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 4 with 90 rules applied. Total rules applied 994 place count 101 transition count 267
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 1024 place count 101 transition count 237
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 1064 place count 61 transition count 157
Iterating global reduction 5 with 40 rules applied. Total rules applied 1104 place count 61 transition count 157
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1131 place count 61 transition count 130
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1141 place count 51 transition count 101
Iterating global reduction 6 with 10 rules applied. Total rules applied 1151 place count 51 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1158 place count 51 transition count 94
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 7 with 2 rules applied. Total rules applied 1160 place count 50 transition count 104
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 1174 place count 50 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1176 place count 48 transition count 88
Applied a total of 1176 rules in 64 ms. Remains 48 /603 variables (removed 555) and now considering 88/756 (removed 668) transitions.
[2024-06-02 22:56:23] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
// Phase 1: matrix 80 rows 48 cols
[2024-06-02 22:56:23] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:56:23] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:56:23] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:23] [INFO ] Invariant cache hit.
[2024-06-02 22:56:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 22:56:23] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:56:23] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:23] [INFO ] Invariant cache hit.
[2024-06-02 22:56:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/603 places, 88/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 48/603 places, 88/756 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s22 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-07 finished in 239 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(F(p0)) U !p0)))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 593 transition count 746
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 593 transition count 746
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 587 transition count 740
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 587 transition count 740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 586 transition count 739
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 586 transition count 739
Applied a total of 34 rules in 36 ms. Remains 586 /603 variables (removed 17) and now considering 739/756 (removed 17) transitions.
// Phase 1: matrix 739 rows 586 cols
[2024-06-02 22:56:23] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 22:56:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 22:56:24] [INFO ] Invariant cache hit.
[2024-06-02 22:56:24] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-02 22:56:24] [INFO ] Invariant cache hit.
[2024-06-02 22:56:24] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 586/603 places, 739/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 586/603 places, 739/756 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s442 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 100 ms.
Product exploration explored 100000 steps with 2 reset in 120 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 930 edges and 586 vertex of which 581 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1128627 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{}
Probabilistic random walk after 1128627 steps, saw 216600 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-02 22:56:28] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:56:28] [INFO ] After 225ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-06-02 22:56:28] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 739/739 transitions.
Graph (trivial) has 638 edges and 586 vertex of which 3 / 586 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 927 edges and 584 vertex of which 568 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 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 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 291 rules applied. Total rules applied 293 place count 568 transition count 434
Reduce places removed 266 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 268 rules applied. Total rules applied 561 place count 302 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 301 transition count 432
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 562 place count 301 transition count 366
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 694 place count 235 transition count 366
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 695 place count 234 transition count 365
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 234 transition count 365
Performed 90 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 876 place count 144 transition count 255
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 882 place count 144 transition count 249
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 891 place count 135 transition count 240
Iterating global reduction 4 with 9 rules applied. Total rules applied 900 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 901 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 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 909 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 913 place count 131 transition count 231
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 917 place count 127 transition count 227
Iterating global reduction 6 with 4 rules applied. Total rules applied 921 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 922 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 928 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 931 place count 124 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 934 place count 121 transition count 217
Iterating global reduction 8 with 3 rules applied. Total rules applied 937 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 939 place count 121 transition count 215
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 940 place count 120 transition count 214
Iterating global reduction 9 with 1 rules applied. Total rules applied 941 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 942 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 1022 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 1066 place count 80 transition count 172
Discarding 35 places :
Symmetric choice reduction at 11 with 35 rule applications. Total rules 1101 place count 45 transition count 115
Iterating global reduction 11 with 35 rules applied. Total rules applied 1136 place count 45 transition count 115
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 11 with 28 rules applied. Total rules applied 1164 place count 45 transition count 87
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1170 place count 39 transition count 69
Iterating global reduction 12 with 6 rules applied. Total rules applied 1176 place count 39 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1180 place count 39 transition count 65
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1181 place count 39 transition count 64
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1182 place count 38 transition count 63
Iterating global reduction 13 with 1 rules applied. Total rules applied 1183 place count 38 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1184 place count 38 transition count 62
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 1189 place count 38 transition count 57
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 1197 place count 33 transition count 54
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1199 place count 33 transition count 54
Graph (complete) has 105 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 1200 place count 32 transition count 54
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1201 place count 32 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1202 place count 32 transition count 52
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 1204 place count 31 transition count 51
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 90 edges and 31 vertex of which 18 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 6 rules applied. Total rules applied 1210 place count 18 transition count 46
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 18 with 24 rules applied. Total rules applied 1234 place count 18 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1235 place count 18 transition count 22
Graph (complete) has 44 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 1236 place count 17 transition count 22
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1237 place count 17 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1238 place count 17 transition count 21
Graph (complete) has 41 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 1239 place count 16 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1240 place count 16 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1241 place count 15 transition count 19
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t62.t66.t664.t725 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 11 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 23 with 3 rules applied. Total rules applied 1244 place count 9 transition count 17
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t59.t650.t42.t43.t44.t45.t46.t47.t48.t49.t58.t31.t725.t159.t160.t161.t734.t15.t164 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 7 vertex of which 3 / 7 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 24 with 9 rules applied. Total rules applied 1253 place count 5 transition count 9
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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 25 with 7 rules applied. Total rules applied 1260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 1261 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 27 with 2 rules applied. Total rules applied 1263 place count 2 transition count 2
Applied a total of 1263 rules in 67 ms. Remains 2 /586 variables (removed 584) and now considering 2/739 (removed 737) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 2/586 places, 2/739 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.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[p0, (NOT p0), (NOT p0)]
[2024-06-02 22:56:28] [INFO ] Invariant cache hit.
[2024-06-02 22:56:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:29] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-06-02 22:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:29] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-06-02 22:56:29] [INFO ] Computed and/alt/rep : 728/984/728 causal constraints (skipped 10 transitions) in 40 ms.
[2024-06-02 22:56:35] [INFO ] Added : 649 causal constraints over 130 iterations in 5856 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 739/739 transitions.
Graph (trivial) has 638 edges and 586 vertex of which 3 / 586 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 928 edges and 584 vertex of which 579 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 578 transition count 474
Reduce places removed 255 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 257 rules applied. Total rules applied 515 place count 323 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 516 place count 322 transition count 472
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 516 place count 322 transition count 405
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 650 place count 255 transition count 405
Performed 98 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 846 place count 157 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 852 place count 157 transition count 274
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 861 place count 148 transition count 265
Iterating global reduction 4 with 9 rules applied. Total rules applied 870 place count 148 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 871 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 5 with 6 rules applied. Total rules applied 877 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 5 with 90 rules applied. Total rules applied 967 place count 100 transition count 264
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 997 place count 100 transition count 234
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1036 place count 61 transition count 156
Iterating global reduction 6 with 39 rules applied. Total rules applied 1075 place count 61 transition count 156
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1102 place count 61 transition count 129
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1111 place count 52 transition count 102
Iterating global reduction 7 with 9 rules applied. Total rules applied 1120 place count 52 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1126 place count 52 transition count 96
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 1128 place count 51 transition count 106
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1142 place count 51 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1144 place count 49 transition count 90
Applied a total of 1144 rules in 38 ms. Remains 49 /586 variables (removed 537) and now considering 90/739 (removed 649) transitions.
[2024-06-02 22:56:35] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-06-02 22:56:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:56:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 22:56:35] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 22:56:35] [INFO ] Invariant cache hit.
[2024-06-02 22:56:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:35] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-02 22:56:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:35] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 22:56:35] [INFO ] Invariant cache hit.
[2024-06-02 22:56:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/586 places, 90/739 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 49/586 places, 90/739 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, (NOT p0), (NOT p0)]
Finished random walk after 4793 steps, including 451 resets, run visited all 1 properties in 23 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[p0, (NOT p0), (NOT p0)]
[2024-06-02 22:56:36] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 22:56:36] [INFO ] Invariant cache hit.
[2024-06-02 22:56:36] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 22:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-02 22:56:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 22:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-02 22:56:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-02 22:56:36] [INFO ] Computed and/alt/rep : 68/95/63 causal constraints (skipped 5 transitions) in 4 ms.
[2024-06-02 22:56:36] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 112 ms :[p0, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 120 ms.
Product exploration explored 100000 steps with 26 reset in 147 ms.
Built C files in :
/tmp/ltsmin5355608074144322876
[2024-06-02 22:56:36] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-06-02 22:56:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:56:36] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-06-02 22:56:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:56:36] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-06-02 22:56:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:56:36] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5355608074144322876
Running compilation step : cd /tmp/ltsmin5355608074144322876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 276 ms.
Running link step : cd /tmp/ltsmin5355608074144322876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5355608074144322876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13887116960489372615.hoa' '--buchi-type=spotba'
LTSmin run took 388 ms.
FORMULA CO4-PT-21-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-21-LTLCardinality-10 finished in 13712 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 603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Graph (trivial) has 654 edges and 603 vertex of which 3 / 603 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 945 edges and 601 vertex of which 594 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 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 593 transition count 474
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 323 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 546 place count 322 transition count 472
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 322 transition count 408
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 258 transition count 408
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 677 place count 255 transition count 405
Iterating global reduction 3 with 3 rules applied. Total rules applied 680 place count 255 transition count 405
Performed 99 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 878 place count 156 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 884 place count 156 transition count 274
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 892 place count 148 transition count 266
Iterating global reduction 4 with 8 rules applied. Total rules applied 900 place count 148 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 901 place count 148 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 905 place count 146 transition count 263
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 997 place count 100 transition count 267
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1026 place count 100 transition count 238
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1066 place count 60 transition count 158
Iterating global reduction 6 with 40 rules applied. Total rules applied 1106 place count 60 transition count 158
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1132 place count 60 transition count 132
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1142 place count 50 transition count 103
Iterating global reduction 7 with 10 rules applied. Total rules applied 1152 place count 50 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1157 place count 50 transition count 98
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 8 with 2 rules applied. Total rules applied 1159 place count 49 transition count 106
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1175 place count 49 transition count 90
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1181 place count 49 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1183 place count 47 transition count 88
Applied a total of 1183 rules in 45 ms. Remains 47 /603 variables (removed 556) and now considering 88/756 (removed 668) transitions.
[2024-06-02 22:56:37] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
// Phase 1: matrix 80 rows 47 cols
[2024-06-02 22:56:37] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:56:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:56:37] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:37] [INFO ] Invariant cache hit.
[2024-06-02 22:56:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:56:37] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:56:37] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:37] [INFO ] Invariant cache hit.
[2024-06-02 22:56:37] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/603 places, 88/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 47/603 places, 88/756 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-13 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 0)], 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 16 reset in 29 ms.
Product exploration explored 100000 steps with 2 reset in 28 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 729 steps, including 69 resets, run visited all 1 properties in 3 ms. (steps per millisecond=243 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 88/88 transitions.
Applied a total of 0 rules in 7 ms. Remains 47 /47 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-02 22:56:38] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:38] [INFO ] Invariant cache hit.
[2024-06-02 22:56:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:56:38] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:38] [INFO ] Invariant cache hit.
[2024-06-02 22:56:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:38] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 22:56:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:38] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 22:56:38] [INFO ] Invariant cache hit.
[2024-06-02 22:56:38] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 47/47 places, 88/88 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 1351 steps, including 129 resets, run visited all 1 properties in 6 ms. (steps per millisecond=225 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10 reset in 31 ms.
Product exploration explored 100000 steps with 6 reset in 28 ms.
Built C files in :
/tmp/ltsmin14053123159998706366
[2024-06-02 22:56:38] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-06-02 22:56:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:56:38] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-06-02 22:56:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:56:38] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-06-02 22:56:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:56:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14053123159998706366
Running compilation step : cd /tmp/ltsmin14053123159998706366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin14053123159998706366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14053123159998706366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13109413707464364360.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA CO4-PT-21-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-21-LTLCardinality-13 finished in 1608 ms.
All properties solved by simple procedures.
Total runtime 23925 ms.

BK_STOP 1717369000245

--------------------
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-21"
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-21, 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-171734910200102"
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 [ "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 ;