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.r241-tall-171649628400237.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 LeafsetExtension-PT-S32C4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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 LeafsetExtension-PT-S32C4-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716563734009

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=LeafsetExtension-PT-S32C4
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 15:15:35] [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-05-24 15:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:15:35] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-24 15:15:35] [INFO ] Transformed 5622 places.
[2024-05-24 15:15:35] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:15:35] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1087 places and 0 transitions.
Iterating post reduction 0 with 1087 rules applied. Total rules applied 1087 place count 4535 transition count 5449
Discarding 1044 places :
Symmetric choice reduction at 1 with 1044 rule applications. Total rules 2131 place count 3491 transition count 4405
Iterating global reduction 1 with 1044 rules applied. Total rules applied 3175 place count 3491 transition count 4405
Discarding 975 places :
Symmetric choice reduction at 1 with 975 rule applications. Total rules 4150 place count 2516 transition count 3430
Iterating global reduction 1 with 975 rules applied. Total rules applied 5125 place count 2516 transition count 3430
Discarding 970 places :
Symmetric choice reduction at 1 with 970 rule applications. Total rules 6095 place count 1546 transition count 2460
Iterating global reduction 1 with 970 rules applied. Total rules applied 7065 place count 1546 transition count 2460
Discarding 48 places :
Implicit places reduction removed 48 places
Iterating post reduction 1 with 48 rules applied. Total rules applied 7113 place count 1498 transition count 2460
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 7159 place count 1452 transition count 2414
Iterating global reduction 2 with 46 rules applied. Total rules applied 7205 place count 1452 transition count 2414
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7249 place count 1408 transition count 2370
Iterating global reduction 2 with 44 rules applied. Total rules applied 7293 place count 1408 transition count 2370
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7337 place count 1364 transition count 2326
Iterating global reduction 2 with 44 rules applied. Total rules applied 7381 place count 1364 transition count 2326
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7425 place count 1320 transition count 2282
Iterating global reduction 2 with 44 rules applied. Total rules applied 7469 place count 1320 transition count 2282
Discarding 662 places :
Symmetric choice reduction at 2 with 662 rule applications. Total rules 8131 place count 658 transition count 1620
Iterating global reduction 2 with 662 rules applied. Total rules applied 8793 place count 658 transition count 1620
Applied a total of 8793 rules in 1771 ms. Remains 658 /5622 variables (removed 4964) and now considering 1620/5449 (removed 3829) transitions.
[2024-05-24 15:15:38] [INFO ] Flow matrix only has 959 transitions (discarded 661 similar events)
// Phase 1: matrix 959 rows 658 cols
[2024-05-24 15:15:38] [INFO ] Computed 54 invariants in 42 ms
[2024-05-24 15:15:39] [INFO ] Implicit Places using invariants in 744 ms returned [48, 74, 97, 118, 139, 145, 149, 191, 197, 202, 250, 279, 283, 311, 359, 366, 386, 392, 396, 398, 451, 456, 484, 512, 540, 544, 549, 554, 558, 562, 607, 612, 617, 621, 626, 630]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 771 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 622/5622 places, 1620/5449 transitions.
Discarding 335 places :
Symmetric choice reduction at 0 with 335 rule applications. Total rules 335 place count 287 transition count 1285
Iterating global reduction 0 with 335 rules applied. Total rules applied 670 place count 287 transition count 1285
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 673 place count 284 transition count 1282
Iterating global reduction 0 with 3 rules applied. Total rules applied 676 place count 284 transition count 1282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 679 place count 281 transition count 1279
Iterating global reduction 0 with 3 rules applied. Total rules applied 682 place count 281 transition count 1279
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 685 place count 278 transition count 1276
Iterating global reduction 0 with 3 rules applied. Total rules applied 688 place count 278 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 692 place count 274 transition count 1272
Iterating global reduction 0 with 4 rules applied. Total rules applied 696 place count 274 transition count 1272
Applied a total of 696 rules in 51 ms. Remains 274 /622 variables (removed 348) and now considering 1272/1620 (removed 348) transitions.
[2024-05-24 15:15:39] [INFO ] Flow matrix only has 536 transitions (discarded 736 similar events)
// Phase 1: matrix 536 rows 274 cols
[2024-05-24 15:15:39] [INFO ] Computed 18 invariants in 3 ms
[2024-05-24 15:15:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-24 15:15:39] [INFO ] Flow matrix only has 536 transitions (discarded 736 similar events)
[2024-05-24 15:15:39] [INFO ] Invariant cache hit.
[2024-05-24 15:15:39] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 274/5622 places, 1272/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3168 ms. Remains : 274/5622 places, 1272/5449 transitions.
Support contains 36 out of 274 places after structural reductions.
[2024-05-24 15:15:40] [INFO ] Flatten gal took : 128 ms
[2024-05-24 15:15:40] [INFO ] Flatten gal took : 58 ms
[2024-05-24 15:15:40] [INFO ] Input system was already deterministic with 1272 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 15:15:40] [INFO ] Flow matrix only has 536 transitions (discarded 736 similar events)
[2024-05-24 15:15:40] [INFO ] Invariant cache hit.
[2024-05-24 15:15:41] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 15:15:41] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 5 ms returned sat
[2024-05-24 15:15:41] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2024-05-24 15:15:41] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-24 15:15:41] [INFO ] After 749ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Graph (complete) has 818 edges and 274 vertex of which 125 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.3 ms
Discarding 149 places :
Also discarding 110 output transitions
Drop transitions removed 110 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 125 transition count 1130
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 14 rules applied. Total rules applied 47 place count 116 transition count 1125
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 111 transition count 1125
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 52 place count 111 transition count 1114
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 74 place count 100 transition count 1114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 98 transition count 1112
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 98 transition count 1112
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 98 place count 88 transition count 1102
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 130 place count 88 transition count 1070
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 162 place count 56 transition count 1070
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 56 transition count 1070
Applied a total of 164 rules in 135 ms. Remains 56 /274 variables (removed 218) and now considering 1070/1272 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 56/274 places, 1070/1272 transitions.
Incomplete random walk after 10000 steps, including 1542 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :1
Finished Best-First random walk after 4352 steps, including 8 resets, run visited all 1 properties in 5 ms. (steps per millisecond=870 )
Parikh walk visited 0 properties in 0 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 274 stabilizing places and 1272 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 274 transition count 1272
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(p1))))))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 268 transition count 1272
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 236 transition count 1240
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 236 transition count 1240
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 90 place count 216 transition count 1220
Iterating global reduction 1 with 20 rules applied. Total rules applied 110 place count 216 transition count 1220
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 212 transition count 1220
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 135 place count 191 transition count 1199
Iterating global reduction 2 with 21 rules applied. Total rules applied 156 place count 191 transition count 1199
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 166 place count 181 transition count 1199
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 195 place count 152 transition count 1170
Iterating global reduction 3 with 29 rules applied. Total rules applied 224 place count 152 transition count 1170
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 238 place count 138 transition count 1156
Iterating global reduction 3 with 14 rules applied. Total rules applied 252 place count 138 transition count 1156
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 266 place count 124 transition count 1142
Iterating global reduction 3 with 14 rules applied. Total rules applied 280 place count 124 transition count 1142
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 295 place count 109 transition count 1127
Iterating global reduction 3 with 15 rules applied. Total rules applied 310 place count 109 transition count 1127
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 322 place count 97 transition count 1115
Iterating global reduction 3 with 12 rules applied. Total rules applied 334 place count 97 transition count 1115
Applied a total of 334 rules in 77 ms. Remains 97 /274 variables (removed 177) and now considering 1115/1272 (removed 157) transitions.
[2024-05-24 15:15:42] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 97 cols
[2024-05-24 15:15:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:15:42] [INFO ] Implicit Places using invariants in 361 ms returned [48, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 363 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/274 places, 1115/1272 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 92 transition count 1112
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 92 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 91 transition count 1111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 91 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 90 transition count 1110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 90 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 89 transition count 1109
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 89 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 88 transition count 1108
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 88 transition count 1108
Applied a total of 14 rules in 16 ms. Remains 88 /95 variables (removed 7) and now considering 1108/1115 (removed 7) transitions.
[2024-05-24 15:15:42] [INFO ] Flow matrix only has 90 transitions (discarded 1018 similar events)
// Phase 1: matrix 90 rows 88 cols
[2024-05-24 15:15:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 15:15:43] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-24 15:15:43] [INFO ] Flow matrix only has 90 transitions (discarded 1018 similar events)
[2024-05-24 15:15:43] [INFO ] Invariant cache hit.
[2024-05-24 15:15:43] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/274 places, 1108/1272 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 856 ms. Remains : 88/274 places, 1108/1272 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 297 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(LEQ 1 s19), p0:(LEQ 1 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-04 finished in 1244 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' '!((((p0 U p1)&&G(p2)) U G((G(p3) U p4))))'
Support contains 8 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Graph (complete) has 1928 edges and 274 vertex of which 268 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 268 transition count 1234
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 231 transition count 1234
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 75 place count 231 transition count 1212
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 119 place count 209 transition count 1212
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 137 place count 191 transition count 1194
Iterating global reduction 2 with 18 rules applied. Total rules applied 155 place count 191 transition count 1194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 187 transition count 1190
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 187 transition count 1190
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 166 place count 184 transition count 1190
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 166 place count 184 transition count 1187
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 172 place count 181 transition count 1187
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 177 place count 176 transition count 1182
Iterating global reduction 3 with 5 rules applied. Total rules applied 182 place count 176 transition count 1182
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 174 transition count 1180
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 174 transition count 1180
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 172 transition count 1178
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 172 transition count 1178
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 258 place count 138 transition count 1144
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 267 place count 129 transition count 1135
Iterating global reduction 3 with 9 rules applied. Total rules applied 276 place count 129 transition count 1135
Applied a total of 276 rules in 124 ms. Remains 129 /274 variables (removed 145) and now considering 1135/1272 (removed 137) transitions.
[2024-05-24 15:15:43] [INFO ] Flow matrix only has 323 transitions (discarded 812 similar events)
// Phase 1: matrix 323 rows 129 cols
[2024-05-24 15:15:43] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 15:15:44] [INFO ] Implicit Places using invariants in 362 ms returned [4, 28, 33, 39, 57, 74, 78, 82, 96]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 366 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/274 places, 1135/1272 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 114 transition count 1129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 114 transition count 1129
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 108 transition count 1123
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 108 transition count 1123
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 38 place count 101 transition count 1116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 99 transition count 1114
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 1114
Applied a total of 42 rules in 69 ms. Remains 99 /120 variables (removed 21) and now considering 1114/1135 (removed 21) transitions.
[2024-05-24 15:15:44] [INFO ] Flow matrix only has 174 transitions (discarded 940 similar events)
// Phase 1: matrix 174 rows 99 cols
[2024-05-24 15:15:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:15:44] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-24 15:15:44] [INFO ] Flow matrix only has 174 transitions (discarded 940 similar events)
[2024-05-24 15:15:44] [INFO ] Invariant cache hit.
[2024-05-24 15:15:44] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/274 places, 1114/1272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 879 ms. Remains : 99/274 places, 1114/1272 transitions.
Stuttering acceptance computed with spot in 571 ms :[(NOT p4), true, (NOT p1), (NOT p2), (NOT p3), (NOT p4), (NOT p4), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p4 p1 p2) (AND p4 p0 p2) (AND p3 p1 p2) (AND p3 p0 p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p3) p1 p2) (AND (NOT p4) (NOT p3) p0 p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p3) p1 p2) (AND (NOT p4) (NOT p3) p0 p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=0 dest: 5}, { cond=(OR (AND p4 (NOT p1) (NOT p0)) (AND p4 (NOT p2)) (AND p3 (NOT p1) (NOT p0)) (AND p3 (NOT p2))), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p4) p3 (NOT p1) p0 p2), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={} source=0 dest: 8}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={1} source=0 dest: 9}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={0, 1} source=0 dest: 10}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 5}, { cond=(OR p4 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p3 p2), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND p4 (NOT p3) p1 p2) (AND p4 (NOT p3) p0 p2)), acceptance={0} source=9 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p3) p1 p2) (AND (NOT p4) (NOT p3) p0 p2)), acceptance={0, 1} source=9 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0 p2), acceptance={} source=9 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p3) p1 p2) (AND (NOT p4) (NOT p3) p0 p2)), acceptance={} source=9 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=9 dest: 4}, { cond=(OR (AND p4 (NOT p3) (NOT p1) (NOT p0)) (AND p4 (NOT p3) (NOT p2))), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p4) p3 (NOT p1) p0 p2), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={} source=9 dest: 8}, { cond=(OR (AND p4 p3 p1 p2) (AND p4 p3 p0 p2)), acceptance={} source=9 dest: 9}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={1} source=9 dest: 9}, { cond=(OR (AND p4 p3 (NOT p1) (NOT p0)) (AND p4 p3 (NOT p2))), acceptance={} source=9 dest: 11}], [{ cond=(OR (AND (NOT p4) (NOT p3) p1 p2) (AND (NOT p4) (NOT p3) p0 p2)), acceptance={0, 1} source=10 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p1) p0 p2), acceptance={} source=10 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p3) p1 p2) (AND (NOT p4) (NOT p3) p0 p2)), acceptance={} source=10 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=10 dest: 4}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p4) p3 (NOT p2))), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p4) p3 (NOT p1) p0 p2), acceptance={} source=10 dest: 7}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={} source=10 dest: 8}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={1} source=10 dest: 9}, { cond=(OR (AND (NOT p4) p3 p1 p2) (AND (NOT p4) p3 p0 p2)), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=11 dest: 4}, { cond=(AND p4 (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND p4 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p4:(LEQ s96 s82), p1:(LEQ 1 s41), p2:(AND (LEQ 1 s41) (GT s16 s54)), p0:(LEQ s17 s50), p3:(LEQ 1 s35)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 42 steps with 2 reset in 3 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-06 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Graph (complete) has 1928 edges and 274 vertex of which 267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 267 transition count 1231
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 227 transition count 1231
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 81 place count 227 transition count 1208
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 127 place count 204 transition count 1208
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 148 place count 183 transition count 1187
Iterating global reduction 2 with 21 rules applied. Total rules applied 169 place count 183 transition count 1187
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 175 place count 177 transition count 1181
Iterating global reduction 2 with 6 rules applied. Total rules applied 181 place count 177 transition count 1181
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 185 place count 173 transition count 1181
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 185 place count 173 transition count 1177
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 169 transition count 1177
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 201 place count 161 transition count 1169
Iterating global reduction 3 with 8 rules applied. Total rules applied 209 place count 161 transition count 1169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 157 transition count 1165
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 157 transition count 1165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 219 place count 155 transition count 1163
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 155 transition count 1163
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 281 place count 125 transition count 1133
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 292 place count 114 transition count 1122
Iterating global reduction 3 with 11 rules applied. Total rules applied 303 place count 114 transition count 1122
Applied a total of 303 rules in 69 ms. Remains 114 /274 variables (removed 160) and now considering 1122/1272 (removed 150) transitions.
[2024-05-24 15:15:45] [INFO ] Flow matrix only has 277 transitions (discarded 845 similar events)
// Phase 1: matrix 277 rows 114 cols
[2024-05-24 15:15:45] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 15:15:45] [INFO ] Implicit Places using invariants in 197 ms returned [4, 25, 30, 36, 40, 51, 53, 55, 63, 67, 71, 86]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 200 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/274 places, 1122/1272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 1113
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 1113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 84 transition count 1104
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 84 transition count 1104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 78 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 76 transition count 1096
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 76 transition count 1096
Applied a total of 52 rules in 26 ms. Remains 76 /102 variables (removed 26) and now considering 1096/1122 (removed 26) transitions.
[2024-05-24 15:15:45] [INFO ] Flow matrix only has 76 transitions (discarded 1020 similar events)
// Phase 1: matrix 76 rows 76 cols
[2024-05-24 15:15:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 15:15:45] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 15:15:45] [INFO ] Flow matrix only has 76 transitions (discarded 1020 similar events)
[2024-05-24 15:15:45] [INFO ] Invariant cache hit.
[2024-05-24 15:15:45] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/274 places, 1096/1272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 616 ms. Remains : 76/274 places, 1096/1272 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s54 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7329 reset in 348 ms.
Product exploration explored 100000 steps with 7332 reset in 362 ms.
Computed a total of 76 stabilizing places and 1096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 1096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-09 finished in 1757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Graph (complete) has 1928 edges and 274 vertex of which 267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 267 transition count 1231
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 227 transition count 1231
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 81 place count 227 transition count 1207
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 129 place count 203 transition count 1207
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 149 place count 183 transition count 1187
Iterating global reduction 2 with 20 rules applied. Total rules applied 169 place count 183 transition count 1187
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 178 transition count 1182
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 178 transition count 1182
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 175 transition count 1182
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 182 place count 175 transition count 1179
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 172 transition count 1179
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 195 place count 165 transition count 1172
Iterating global reduction 3 with 7 rules applied. Total rules applied 202 place count 165 transition count 1172
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 205 place count 162 transition count 1169
Iterating global reduction 3 with 3 rules applied. Total rules applied 208 place count 162 transition count 1169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 210 place count 160 transition count 1167
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 160 transition count 1167
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 274 place count 129 transition count 1136
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 285 place count 118 transition count 1125
Iterating global reduction 3 with 11 rules applied. Total rules applied 296 place count 118 transition count 1125
Applied a total of 296 rules in 59 ms. Remains 118 /274 variables (removed 156) and now considering 1125/1272 (removed 147) transitions.
[2024-05-24 15:15:46] [INFO ] Flow matrix only has 297 transitions (discarded 828 similar events)
// Phase 1: matrix 297 rows 118 cols
[2024-05-24 15:15:46] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 15:15:47] [INFO ] Implicit Places using invariants in 217 ms returned [4, 24, 33, 39, 43, 55, 57, 59, 67, 71, 75, 89]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 219 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/274 places, 1125/1272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 1116
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 88 transition count 1107
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 88 transition count 1107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 82 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 80 transition count 1099
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 80 transition count 1099
Applied a total of 52 rules in 23 ms. Remains 80 /106 variables (removed 26) and now considering 1099/1125 (removed 26) transitions.
[2024-05-24 15:15:47] [INFO ] Flow matrix only has 95 transitions (discarded 1004 similar events)
// Phase 1: matrix 95 rows 80 cols
[2024-05-24 15:15:47] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 15:15:47] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 15:15:47] [INFO ] Flow matrix only has 95 transitions (discarded 1004 similar events)
[2024-05-24 15:15:47] [INFO ] Invariant cache hit.
[2024-05-24 15:15:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/274 places, 1099/1272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 615 ms. Remains : 80/274 places, 1099/1272 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-10 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:(AND (LEQ s35 s23) (GT 2 s18))], 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 7024 reset in 335 ms.
Product exploration explored 100000 steps with 7004 reset in 345 ms.
Computed a total of 80 stabilizing places and 1099 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 1099
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-10 finished in 1535 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 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Graph (complete) has 1928 edges and 274 vertex of which 267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 267 transition count 1230
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 226 transition count 1230
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 83 place count 226 transition count 1207
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 129 place count 203 transition count 1207
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 150 place count 182 transition count 1186
Iterating global reduction 2 with 21 rules applied. Total rules applied 171 place count 182 transition count 1186
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 177 place count 176 transition count 1180
Iterating global reduction 2 with 6 rules applied. Total rules applied 183 place count 176 transition count 1180
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 187 place count 172 transition count 1180
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 187 place count 172 transition count 1176
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 168 transition count 1176
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 203 place count 160 transition count 1168
Iterating global reduction 3 with 8 rules applied. Total rules applied 211 place count 160 transition count 1168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 156 transition count 1164
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 156 transition count 1164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 154 transition count 1162
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 154 transition count 1162
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 283 place count 124 transition count 1132
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 294 place count 113 transition count 1121
Iterating global reduction 3 with 11 rules applied. Total rules applied 305 place count 113 transition count 1121
Applied a total of 305 rules in 117 ms. Remains 113 /274 variables (removed 161) and now considering 1121/1272 (removed 151) transitions.
[2024-05-24 15:15:48] [INFO ] Flow matrix only has 277 transitions (discarded 844 similar events)
// Phase 1: matrix 277 rows 113 cols
[2024-05-24 15:15:48] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 15:15:48] [INFO ] Implicit Places using invariants in 170 ms returned [4, 24, 29, 35, 39, 50, 52, 54, 62, 66, 70, 85]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 173 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/274 places, 1121/1272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 1112
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 1112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 83 transition count 1103
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 83 transition count 1103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 77 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 75 transition count 1095
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 75 transition count 1095
Applied a total of 52 rules in 25 ms. Remains 75 /101 variables (removed 26) and now considering 1095/1121 (removed 26) transitions.
[2024-05-24 15:15:48] [INFO ] Flow matrix only has 75 transitions (discarded 1020 similar events)
// Phase 1: matrix 75 rows 75 cols
[2024-05-24 15:15:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 15:15:48] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 15:15:48] [INFO ] Flow matrix only has 75 transitions (discarded 1020 similar events)
[2024-05-24 15:15:48] [INFO ] Invariant cache hit.
[2024-05-24 15:15:48] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/274 places, 1095/1272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 566 ms. Remains : 75/274 places, 1095/1272 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-12 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:(LEQ s51 s16)], 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 7436 reset in 269 ms.
Product exploration explored 100000 steps with 7439 reset in 279 ms.
Computed a total of 75 stabilizing places and 1095 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 1095
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-12 finished in 1333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 6 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 269 transition count 1272
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 34 place count 240 transition count 1243
Iterating global reduction 1 with 29 rules applied. Total rules applied 63 place count 240 transition count 1243
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 80 place count 223 transition count 1226
Iterating global reduction 1 with 17 rules applied. Total rules applied 97 place count 223 transition count 1226
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 101 place count 219 transition count 1226
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 118 place count 202 transition count 1209
Iterating global reduction 2 with 17 rules applied. Total rules applied 135 place count 202 transition count 1209
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 143 place count 194 transition count 1209
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 165 place count 172 transition count 1187
Iterating global reduction 3 with 22 rules applied. Total rules applied 187 place count 172 transition count 1187
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 199 place count 160 transition count 1175
Iterating global reduction 3 with 12 rules applied. Total rules applied 211 place count 160 transition count 1175
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 223 place count 148 transition count 1163
Iterating global reduction 3 with 12 rules applied. Total rules applied 235 place count 148 transition count 1163
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 248 place count 135 transition count 1150
Iterating global reduction 3 with 13 rules applied. Total rules applied 261 place count 135 transition count 1150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 271 place count 125 transition count 1140
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 125 transition count 1140
Applied a total of 281 rules in 28 ms. Remains 125 /274 variables (removed 149) and now considering 1140/1272 (removed 132) transitions.
[2024-05-24 15:15:49] [INFO ] Flow matrix only has 186 transitions (discarded 954 similar events)
// Phase 1: matrix 186 rows 125 cols
[2024-05-24 15:15:49] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:15:49] [INFO ] Implicit Places using invariants in 132 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/274 places, 1140/1272 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 1137
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 1137
Applied a total of 6 rules in 5 ms. Remains 121 /124 variables (removed 3) and now considering 1137/1140 (removed 3) transitions.
[2024-05-24 15:15:49] [INFO ] Flow matrix only has 183 transitions (discarded 954 similar events)
// Phase 1: matrix 183 rows 121 cols
[2024-05-24 15:15:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 15:15:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-24 15:15:49] [INFO ] Flow matrix only has 183 transitions (discarded 954 similar events)
[2024-05-24 15:15:49] [INFO ] Invariant cache hit.
[2024-05-24 15:15:50] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/274 places, 1137/1272 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 121/274 places, 1137/1272 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s106 s51), p0:(OR (LEQ s113 s12) (LEQ s69 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33263 reset in 330 ms.
Product exploration explored 100000 steps with 33248 reset in 363 ms.
Computed a total of 121 stabilizing places and 1137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 1137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-13 finished in 1554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 1272/1272 transitions.
Graph (complete) has 1928 edges and 274 vertex of which 268 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 268 transition count 1232
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 229 transition count 1232
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 79 place count 229 transition count 1210
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 123 place count 207 transition count 1210
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 145 place count 185 transition count 1188
Iterating global reduction 2 with 22 rules applied. Total rules applied 167 place count 185 transition count 1188
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 179 transition count 1182
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 179 transition count 1182
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 183 place count 175 transition count 1182
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 183 place count 175 transition count 1178
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 171 transition count 1178
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 198 place count 164 transition count 1171
Iterating global reduction 3 with 7 rules applied. Total rules applied 205 place count 164 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 160 transition count 1167
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 160 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 215 place count 158 transition count 1165
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 158 transition count 1165
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 279 place count 127 transition count 1134
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 290 place count 116 transition count 1123
Iterating global reduction 3 with 11 rules applied. Total rules applied 301 place count 116 transition count 1123
Applied a total of 301 rules in 64 ms. Remains 116 /274 variables (removed 158) and now considering 1123/1272 (removed 149) transitions.
[2024-05-24 15:15:51] [INFO ] Flow matrix only has 278 transitions (discarded 845 similar events)
// Phase 1: matrix 278 rows 116 cols
[2024-05-24 15:15:51] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 15:15:51] [INFO ] Implicit Places using invariants in 119 ms returned [3, 25, 30, 36, 40, 51, 53, 55, 70, 74, 88]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 130 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/274 places, 1123/1272 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 1115
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 1115
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 89 transition count 1107
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 89 transition count 1107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 44 place count 83 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 81 transition count 1099
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 81 transition count 1099
Applied a total of 48 rules in 43 ms. Remains 81 /105 variables (removed 24) and now considering 1099/1123 (removed 24) transitions.
[2024-05-24 15:15:51] [INFO ] Flow matrix only has 94 transitions (discarded 1005 similar events)
// Phase 1: matrix 94 rows 81 cols
[2024-05-24 15:15:51] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 15:15:51] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 15:15:51] [INFO ] Flow matrix only has 94 transitions (discarded 1005 similar events)
[2024-05-24 15:15:51] [INFO ] Invariant cache hit.
[2024-05-24 15:15:51] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/274 places, 1099/1272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 517 ms. Remains : 81/274 places, 1099/1272 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s15 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-15 finished in 576 ms.
All properties solved by simple procedures.
Total runtime 16373 ms.

BK_STOP 1716563753251

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S32C4"
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 LeafsetExtension-PT-S32C4, 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 r241-tall-171649628400237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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