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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 248K 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-17-LTLCardinality-00
FORMULA_NAME CO4-PT-17-LTLCardinality-01
FORMULA_NAME CO4-PT-17-LTLCardinality-02
FORMULA_NAME CO4-PT-17-LTLCardinality-03
FORMULA_NAME CO4-PT-17-LTLCardinality-04
FORMULA_NAME CO4-PT-17-LTLCardinality-05
FORMULA_NAME CO4-PT-17-LTLCardinality-06
FORMULA_NAME CO4-PT-17-LTLCardinality-07
FORMULA_NAME CO4-PT-17-LTLCardinality-08
FORMULA_NAME CO4-PT-17-LTLCardinality-09
FORMULA_NAME CO4-PT-17-LTLCardinality-10
FORMULA_NAME CO4-PT-17-LTLCardinality-11
FORMULA_NAME CO4-PT-17-LTLCardinality-12
FORMULA_NAME CO4-PT-17-LTLCardinality-13
FORMULA_NAME CO4-PT-17-LTLCardinality-14
FORMULA_NAME CO4-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368787936

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-17
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:53:09] [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:53:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:09] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 22:53:09] [INFO ] Transformed 967 places.
[2024-06-02 22:53:09] [INFO ] Transformed 1150 transitions.
[2024-06-02 22:53:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:09] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 752 transition count 912
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 178 place count 591 transition count 751
Iterating global reduction 1 with 161 rules applied. Total rules applied 339 place count 591 transition count 751
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 347 place count 591 transition count 743
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 429 place count 509 transition count 661
Iterating global reduction 2 with 82 rules applied. Total rules applied 511 place count 509 transition count 661
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 527 place count 493 transition count 643
Iterating global reduction 2 with 16 rules applied. Total rules applied 543 place count 493 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 546 place count 493 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 548 place count 491 transition count 638
Iterating global reduction 3 with 2 rules applied. Total rules applied 550 place count 491 transition count 638
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 551 place count 490 transition count 637
Iterating global reduction 3 with 1 rules applied. Total rules applied 552 place count 490 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 490 transition count 636
Applied a total of 553 rules in 374 ms. Remains 490 /769 variables (removed 279) and now considering 636/912 (removed 276) transitions.
// Phase 1: matrix 636 rows 490 cols
[2024-06-02 22:53:10] [INFO ] Computed 5 invariants in 25 ms
[2024-06-02 22:53:10] [INFO ] Implicit Places using invariants in 264 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/769 places, 636/912 transitions.
Applied a total of 0 rules in 17 ms. Remains 489 /489 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 683 ms. Remains : 489/769 places, 636/912 transitions.
Support contains 23 out of 489 places after structural reductions.
[2024-06-02 22:53:10] [INFO ] Flatten gal took : 64 ms
[2024-06-02 22:53:10] [INFO ] Flatten gal took : 35 ms
[2024-06-02 22:53:10] [INFO ] Input system was already deterministic with 636 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 636 rows 489 cols
[2024-06-02 22:53:12] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:53:12] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-06-02 22:53:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 22:53:13] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-06-02 22:53:13] [INFO ] After 677ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-06-02 22:53:13] [INFO ] After 1066ms 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 7 properties in 23 ms.
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 533 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 823 edges and 488 vertex of which 465 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 465 transition count 424
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 177 rules applied. Total rules applied 372 place count 291 transition count 421
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 374 place count 290 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 289 transition count 420
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 375 place count 289 transition count 360
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 495 place count 229 transition count 360
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 498 place count 226 transition count 357
Iterating global reduction 4 with 3 rules applied. Total rules applied 501 place count 226 transition count 357
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 501 place count 226 transition count 355
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 505 place count 224 transition count 355
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 506 place count 223 transition count 354
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 223 transition count 354
Performed 79 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 665 place count 144 transition count 259
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 674 place count 144 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 676 place count 143 transition count 249
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 683 place count 136 transition count 242
Iterating global reduction 6 with 7 rules applied. Total rules applied 690 place count 136 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 691 place count 136 transition count 241
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 7 with 8 rules applied. Total rules applied 699 place count 132 transition count 237
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 703 place count 132 transition count 233
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 707 place count 128 transition count 229
Iterating global reduction 8 with 4 rules applied. Total rules applied 711 place count 128 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 712 place count 128 transition count 228
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 9 with 6 rules applied. Total rules applied 718 place count 125 transition count 225
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 721 place count 125 transition count 222
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 724 place count 122 transition count 219
Iterating global reduction 10 with 3 rules applied. Total rules applied 727 place count 122 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 729 place count 122 transition count 217
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 730 place count 121 transition count 216
Iterating global reduction 11 with 1 rules applied. Total rules applied 731 place count 121 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 732 place count 121 transition count 215
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 12 with 80 rules applied. Total rules applied 812 place count 81 transition count 218
Drop transitions removed 16 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 12 with 44 rules applied. Total rules applied 856 place count 81 transition count 174
Discarding 36 places :
Symmetric choice reduction at 13 with 36 rule applications. Total rules 892 place count 45 transition count 116
Iterating global reduction 13 with 36 rules applied. Total rules applied 928 place count 45 transition count 116
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 13 with 28 rules applied. Total rules applied 956 place count 45 transition count 88
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 963 place count 38 transition count 68
Iterating global reduction 14 with 7 rules applied. Total rules applied 970 place count 38 transition count 68
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 975 place count 38 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 976 place count 38 transition count 62
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 977 place count 37 transition count 61
Iterating global reduction 15 with 1 rules applied. Total rules applied 978 place count 37 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 979 place count 37 transition count 60
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 984 place count 37 transition count 55
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 992 place count 32 transition count 52
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 994 place count 32 transition count 52
Graph (complete) has 101 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 995 place count 31 transition count 52
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 996 place count 31 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 997 place count 31 transition count 50
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 19 with 2 rules applied. Total rules applied 999 place count 30 transition count 49
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 85 edges and 30 vertex of which 23 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 19 with 6 rules applied. Total rules applied 1005 place count 23 transition count 44
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 20 with 12 rules applied. Total rules applied 1017 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 1018 place count 22 transition count 31
Iterating global reduction 21 with 1 rules applied. Total rules applied 1019 place count 22 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1020 place count 22 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1021 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 1022 place count 21 transition count 28
Iterating global reduction 22 with 1 rules applied. Total rules applied 1023 place count 21 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1024 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 1025 place count 21 transition count 27
Graph (complete) has 53 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 23 with 1 rules applied. Total rules applied 1026 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 1027 place count 20 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 1028 place count 20 transition count 26
Graph (complete) has 50 edges and 20 vertex of which 19 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 25 with 1 rules applied. Total rules applied 1029 place count 19 transition count 26
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1030 place count 19 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 27 with 1 rules applied. Total rules applied 1031 place count 18 transition count 24
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t49.t551 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 12 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 3 rules applied. Total rules applied 1034 place count 12 transition count 22
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t46.t538.t27.t28.t29.t31.t127.t124.t617.t128.t129 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 10 vertex of which 3 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 28 with 8 rules applied. Total rules applied 1042 place count 8 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 8 edges and 7 vertex of which 4 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 7 rules applied. Total rules applied 1049 place count 4 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 30 with 7 rules applied. Total rules applied 1056 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 1057 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 1058 place count 2 transition count 3
Iterating global reduction 31 with 1 rules applied. Total rules applied 1059 place count 2 transition count 3
Applied a total of 1059 rules in 111 ms. Remains 2 /489 variables (removed 487) and now considering 3/636 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 2/489 places, 3/636 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-17-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 825 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 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(X(X(X(F((G(p0)&&F(p1)))))))))'
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 635
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 480 transition count 628
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 480 transition count 628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 478 transition count 625
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 478 transition count 625
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 477 transition count 624
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 477 transition count 624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 476 transition count 623
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 476 transition count 623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 476 transition count 622
Applied a total of 26 rules in 62 ms. Remains 476 /489 variables (removed 13) and now considering 622/636 (removed 14) transitions.
// Phase 1: matrix 622 rows 476 cols
[2024-06-02 22:53:14] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:53:14] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 22:53:14] [INFO ] Invariant cache hit.
[2024-06-02 22:53:14] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-02 22:53:14] [INFO ] Invariant cache hit.
[2024-06-02 22:53:14] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 476/489 places, 622/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 476/489 places, 622/636 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 429 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s65 0) (EQ s69 1)), p1:(OR (EQ s279 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 196 ms.
Product exploration explored 100000 steps with 4 reset in 131 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 807 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 845659 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 845659 steps, saw 154406 distinct states, run finished after 3002 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:53:19] [INFO ] Invariant cache hit.
[2024-06-02 22:53:19] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:53:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:19] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:53:19] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-06-02 22:53:20] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 85 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 622/622 transitions.
Applied a total of 0 rules in 18 ms. Remains 476 /476 variables (removed 0) and now considering 622/622 (removed 0) transitions.
[2024-06-02 22:53:20] [INFO ] Invariant cache hit.
[2024-06-02 22:53:20] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:53:20] [INFO ] Invariant cache hit.
[2024-06-02 22:53:21] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 22:53:21] [INFO ] Invariant cache hit.
[2024-06-02 22:53:21] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 476/476 places, 622/622 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 807 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 926316 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 926316 steps, saw 165925 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:53:25] [INFO ] Invariant cache hit.
[2024-06-02 22:53:25] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:53:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:25] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:53:25] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-06-02 22:53:25] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 85 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 120 ms.
Product exploration explored 100000 steps with 32 reset in 118 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 622/622 transitions.
Graph (trivial) has 516 edges and 476 vertex of which 2 / 476 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 806 edges and 475 vertex of which 472 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 165 rules applied. Total rules applied 167 place count 472 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 472 transition count 616
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 168 place count 472 transition count 676
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 231 place count 472 transition count 676
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 265 place count 438 transition count 642
Deduced a syphon composed of 193 places in 1 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 299 place count 438 transition count 642
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 356 place count 438 transition count 719
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 364 place count 438 transition count 711
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 391 place count 411 transition count 678
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 418 place count 411 transition count 678
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 420 place count 409 transition count 675
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 422 place count 409 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 409 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 424 place count 408 transition count 673
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 408 transition count 673
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 408 transition count 673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 427 place count 408 transition count 672
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 429 place count 406 transition count 670
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 431 place count 406 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 406 transition count 670
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 433 place count 405 transition count 669
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 405 transition count 669
Performed 72 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 5 with 72 rules applied. Total rules applied 506 place count 405 transition count 964
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 5 with 79 rules applied. Total rules applied 585 place count 405 transition count 885
Discarding 149 places :
Symmetric choice reduction at 6 with 149 rule applications. Total rules 734 place count 256 transition count 547
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 6 with 149 rules applied. Total rules applied 883 place count 256 transition count 547
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 930 place count 256 transition count 500
Discarding 93 places :
Symmetric choice reduction at 7 with 93 rule applications. Total rules 1023 place count 163 transition count 333
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 7 with 93 rules applied. Total rules applied 1116 place count 163 transition count 333
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1123 place count 163 transition count 326
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1139 place count 147 transition count 294
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 1155 place count 147 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1156 place count 147 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1161 place count 147 transition count 313
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1164 place count 144 transition count 292
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1167 place count 144 transition count 292
Deduced a syphon composed of 84 places in 0 ms
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1185 place count 144 transition count 274
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1187 place count 142 transition count 272
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1189 place count 142 transition count 272
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1191 place count 142 transition count 317
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1193 place count 140 transition count 302
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1195 place count 140 transition count 302
Deduced a syphon composed of 82 places in 0 ms
Applied a total of 1195 rules in 170 ms. Remains 140 /476 variables (removed 336) and now considering 302/622 (removed 320) transitions.
[2024-06-02 22:53:27] [INFO ] Redundant transitions in 13 ms returned []
[2024-06-02 22:53:27] [INFO ] Flow matrix only has 292 transitions (discarded 10 similar events)
// Phase 1: matrix 292 rows 140 cols
[2024-06-02 22:53:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:53:27] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/476 places, 302/622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 140/476 places, 302/622 transitions.
Built C files in :
/tmp/ltsmin17997779846202706572
[2024-06-02 22:53:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17997779846202706572
Running compilation step : cd /tmp/ltsmin17997779846202706572;'/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 958 ms.
Running link step : cd /tmp/ltsmin17997779846202706572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17997779846202706572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4820395616891033039.hoa' '--buchi-type=spotba'
LTSmin run took 1653 ms.
FORMULA CO4-PT-17-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-00 finished in 16647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 635
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 478 transition count 626
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 478 transition count 626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 618
Applied a total of 34 rules in 31 ms. Remains 472 /489 variables (removed 17) and now considering 618/636 (removed 18) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 22:53:30] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:53:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:53:30] [INFO ] Invariant cache hit.
[2024-06-02 22:53:31] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 22:53:31] [INFO ] Invariant cache hit.
[2024-06-02 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/489 places, 618/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 472/489 places, 618/636 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s331 0) (EQ s323 1)), p1:(AND (EQ s323 0) (EQ s331 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]]
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-17-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-17-LTLCardinality-01 finished in 1442 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(G(!p1)))))'
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 532 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 484 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 483 transition count 456
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 176 rules applied. Total rules applied 353 place count 310 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 309 transition count 453
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 354 place count 309 transition count 391
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 478 place count 247 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 480 place count 245 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 245 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 482 place count 245 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 244 transition count 388
Performed 85 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 654 place count 159 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 660 place count 159 transition count 276
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 667 place count 152 transition count 269
Iterating global reduction 4 with 7 rules applied. Total rules applied 674 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 675 place count 152 transition count 268
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 683 place count 148 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 5 with 90 rules applied. Total rules applied 773 place count 103 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 802 place count 103 transition count 238
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 841 place count 64 transition count 160
Iterating global reduction 6 with 39 rules applied. Total rules applied 880 place count 64 transition count 160
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 906 place count 64 transition count 134
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 915 place count 55 transition count 108
Iterating global reduction 7 with 9 rules applied. Total rules applied 924 place count 55 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 928 place count 55 transition count 104
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 936 place count 55 transition count 96
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 942 place count 55 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 944 place count 53 transition count 94
Applied a total of 944 rules in 53 ms. Remains 53 /489 variables (removed 436) and now considering 94/636 (removed 542) transitions.
[2024-06-02 22:53:32] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
// Phase 1: matrix 85 rows 53 cols
[2024-06-02 22:53:32] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:53:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 22:53:32] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
[2024-06-02 22:53:32] [INFO ] Invariant cache hit.
[2024-06-02 22:53:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:53:32] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-02 22:53:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:53:32] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
[2024-06-02 22:53:32] [INFO ] Invariant cache hit.
[2024-06-02 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/489 places, 94/636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 53/489 places, 94/636 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : CO4-PT-17-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s41 1)), p1:(OR (EQ s11 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-03 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(!p1 U p2)))))'
Support contains 5 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 635
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 480 transition count 628
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 480 transition count 628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 478 transition count 626
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 478 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 477 transition count 625
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 477 transition count 625
Applied a total of 23 rules in 29 ms. Remains 477 /489 variables (removed 12) and now considering 625/636 (removed 11) transitions.
// Phase 1: matrix 625 rows 477 cols
[2024-06-02 22:53:32] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:53:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:53:32] [INFO ] Invariant cache hit.
[2024-06-02 22:53:32] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 22:53:32] [INFO ] Invariant cache hit.
[2024-06-02 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 477/489 places, 625/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 477/489 places, 625/636 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s220 0) (EQ s404 1)), p1:(OR (EQ s446 0) (EQ s188 1)), p0:(EQ s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-06 finished in 869 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)&&X(X(G(p1)))))'
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 488 transition count 636
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 478 transition count 626
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 478 transition count 626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 618
Applied a total of 34 rules in 43 ms. Remains 472 /489 variables (removed 17) and now considering 618/636 (removed 18) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 22:53:33] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:53:33] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:53:33] [INFO ] Invariant cache hit.
[2024-06-02 22:53:33] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 22:53:33] [INFO ] Invariant cache hit.
[2024-06-02 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/489 places, 618/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 472/489 places, 618/636 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-17-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s418 0), p1:(OR (EQ s456 0) (EQ s186 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 81 ms.
Entered a terminal (fully accepting) state of product in 524 steps with 13 reset in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-11 finished in 846 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)) U (!p1||G(!p0))))'
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 533 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 482 transition count 456
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 176 rules applied. Total rules applied 353 place count 309 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 308 transition count 453
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 354 place count 308 transition count 391
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 478 place count 246 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 480 place count 244 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 244 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 482 place count 244 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 243 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 485 place count 242 transition count 387
Iterating global reduction 3 with 1 rules applied. Total rules applied 486 place count 242 transition count 387
Performed 85 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 656 place count 157 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 665 place count 157 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 667 place count 156 transition count 272
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 674 place count 149 transition count 265
Iterating global reduction 5 with 7 rules applied. Total rules applied 681 place count 149 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 682 place count 149 transition count 264
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 6 with 8 rules applied. Total rules applied 690 place count 145 transition count 260
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 778 place count 101 transition count 263
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 807 place count 101 transition count 234
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 846 place count 62 transition count 156
Iterating global reduction 7 with 39 rules applied. Total rules applied 885 place count 62 transition count 156
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 911 place count 62 transition count 130
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 921 place count 52 transition count 101
Iterating global reduction 8 with 10 rules applied. Total rules applied 931 place count 52 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 938 place count 52 transition count 94
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 942 place count 52 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 944 place count 50 transition count 88
Applied a total of 944 rules in 44 ms. Remains 50 /489 variables (removed 439) and now considering 88/636 (removed 548) transitions.
[2024-06-02 22:53:34] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 50 cols
[2024-06-02 22:53:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:53:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:53:34] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 22:53:34] [INFO ] Invariant cache hit.
[2024-06-02 22:53:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:53:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 22:53:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:53:34] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 22:53:34] [INFO ] Invariant cache hit.
[2024-06-02 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/489 places, 88/636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 50/489 places, 88/636 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND p1 p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s34 0) (EQ s7 0)), p0:(EQ s34 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 93 reset in 89 ms.
Stack based approach found an accepted trace after 74 steps with 6 reset with depth 10 and stack size 10 in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-17-LTLCardinality-12 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 533 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 482 transition count 456
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 176 rules applied. Total rules applied 353 place count 309 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 355 place count 308 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 307 transition count 452
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 356 place count 307 transition count 391
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 478 place count 246 transition count 391
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 481 place count 243 transition count 388
Iterating global reduction 4 with 3 rules applied. Total rules applied 484 place count 243 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 484 place count 243 transition count 386
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 488 place count 241 transition count 386
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 489 place count 240 transition count 385
Iterating global reduction 4 with 1 rules applied. Total rules applied 490 place count 240 transition count 385
Performed 85 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 660 place count 155 transition count 280
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 669 place count 155 transition count 271
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 671 place count 154 transition count 270
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 678 place count 147 transition count 263
Iterating global reduction 6 with 7 rules applied. Total rules applied 685 place count 147 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 686 place count 147 transition count 262
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 7 with 8 rules applied. Total rules applied 694 place count 143 transition count 258
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 782 place count 99 transition count 261
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 811 place count 99 transition count 232
Discarding 39 places :
Symmetric choice reduction at 8 with 39 rule applications. Total rules 850 place count 60 transition count 154
Iterating global reduction 8 with 39 rules applied. Total rules applied 889 place count 60 transition count 154
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 916 place count 60 transition count 127
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 926 place count 50 transition count 98
Iterating global reduction 9 with 10 rules applied. Total rules applied 936 place count 50 transition count 98
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 943 place count 50 transition count 91
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 946 place count 50 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 948 place count 48 transition count 86
Applied a total of 948 rules in 45 ms. Remains 48 /489 variables (removed 441) and now considering 86/636 (removed 550) transitions.
[2024-06-02 22:53:34] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
// Phase 1: matrix 78 rows 48 cols
[2024-06-02 22:53:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:53:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:53:34] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 22:53:34] [INFO ] Invariant cache hit.
[2024-06-02 22:53:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:53:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-02 22:53:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:53:34] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 22:53:34] [INFO ] Invariant cache hit.
[2024-06-02 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/489 places, 86/636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 48/489 places, 86/636 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13 reset in 28 ms.
Product exploration explored 100000 steps with 28 reset in 43 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 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 187 steps, including 17 resets, run visited all 1 properties in 2 ms. (steps per millisecond=93 )
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 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-02 22:53:35] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 22:53:35] [INFO ] Invariant cache hit.
[2024-06-02 22:53:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:53:35] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 22:53:35] [INFO ] Invariant cache hit.
[2024-06-02 22:53:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:53:35] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:53:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:53:35] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 22:53:35] [INFO ] Invariant cache hit.
[2024-06-02 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 48/48 places, 86/86 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 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 583 steps, including 54 resets, run visited all 1 properties in 2 ms. (steps per millisecond=291 )
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 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25 reset in 36 ms.
Product exploration explored 100000 steps with 14 reset in 31 ms.
Built C files in :
/tmp/ltsmin13330106770811575930
[2024-06-02 22:53:36] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2024-06-02 22:53:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:53:36] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2024-06-02 22:53:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:53:36] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2024-06-02 22:53:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:53:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13330106770811575930
Running compilation step : cd /tmp/ltsmin13330106770811575930;'/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 162 ms.
Running link step : cd /tmp/ltsmin13330106770811575930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13330106770811575930;'/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/stateBased9628033580570855625.hoa' '--buchi-type=spotba'
LTSmin run took 112 ms.
FORMULA CO4-PT-17-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-14 finished in 1824 ms.
All properties solved by simple procedures.
Total runtime 27045 ms.

BK_STOP 1717368817596

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-17"
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-17, 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-171734910200082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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