About the Execution of 2023-gold for LeafsetExtension-PT-S32C2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
752.892 | 23784.00 | 37150.00 | 1955.90 | TTTFTFTFFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628400227.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-S32C2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400227
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K 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-S32C2-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716563418339
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-S32C2
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 15:10:20] [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:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:10:20] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-24 15:10:20] [INFO ] Transformed 5622 places.
[2024-05-24 15:10:20] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:10:20] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1086 places and 0 transitions.
Iterating post reduction 0 with 1086 rules applied. Total rules applied 1086 place count 4536 transition count 5449
Discarding 1038 places :
Symmetric choice reduction at 1 with 1038 rule applications. Total rules 2124 place count 3498 transition count 4411
Iterating global reduction 1 with 1038 rules applied. Total rules applied 3162 place count 3498 transition count 4411
Discarding 961 places :
Symmetric choice reduction at 1 with 961 rule applications. Total rules 4123 place count 2537 transition count 3450
Iterating global reduction 1 with 961 rules applied. Total rules applied 5084 place count 2537 transition count 3450
Discarding 949 places :
Symmetric choice reduction at 1 with 949 rule applications. Total rules 6033 place count 1588 transition count 2501
Iterating global reduction 1 with 949 rules applied. Total rules applied 6982 place count 1588 transition count 2501
Discarding 36 places :
Implicit places reduction removed 36 places
Iterating post reduction 1 with 36 rules applied. Total rules applied 7018 place count 1552 transition count 2501
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 7052 place count 1518 transition count 2467
Iterating global reduction 2 with 34 rules applied. Total rules applied 7086 place count 1518 transition count 2467
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 7120 place count 1484 transition count 2433
Iterating global reduction 2 with 34 rules applied. Total rules applied 7154 place count 1484 transition count 2433
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 7188 place count 1450 transition count 2399
Iterating global reduction 2 with 34 rules applied. Total rules applied 7222 place count 1450 transition count 2399
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 7256 place count 1416 transition count 2365
Iterating global reduction 2 with 34 rules applied. Total rules applied 7290 place count 1416 transition count 2365
Discarding 513 places :
Symmetric choice reduction at 2 with 513 rule applications. Total rules 7803 place count 903 transition count 1852
Iterating global reduction 2 with 513 rules applied. Total rules applied 8316 place count 903 transition count 1852
Applied a total of 8316 rules in 1553 ms. Remains 903 /5622 variables (removed 4719) and now considering 1852/5449 (removed 3597) transitions.
[2024-05-24 15:10:22] [INFO ] Flow matrix only has 1340 transitions (discarded 512 similar events)
// Phase 1: matrix 1340 rows 903 cols
[2024-05-24 15:10:22] [INFO ] Computed 66 invariants in 49 ms
[2024-05-24 15:10:22] [INFO ] Implicit Places using invariants in 783 ms returned [53, 57, 96, 144, 148, 191, 213, 241, 267, 299, 304, 324, 352, 402, 408, 435, 439, 488, 514, 521, 523, 526, 554, 581, 587, 592, 596, 617, 666, 694, 698, 702, 709, 713, 717, 745, 749, 793, 818, 822, 865]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 810 ms to find 41 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 862/5622 places, 1852/5449 transitions.
Discarding 465 places :
Symmetric choice reduction at 0 with 465 rule applications. Total rules 465 place count 397 transition count 1387
Iterating global reduction 0 with 465 rules applied. Total rules applied 930 place count 397 transition count 1387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 937 place count 390 transition count 1380
Iterating global reduction 0 with 7 rules applied. Total rules applied 944 place count 390 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 951 place count 383 transition count 1373
Iterating global reduction 0 with 7 rules applied. Total rules applied 958 place count 383 transition count 1373
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 965 place count 376 transition count 1366
Iterating global reduction 0 with 7 rules applied. Total rules applied 972 place count 376 transition count 1366
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 979 place count 369 transition count 1359
Iterating global reduction 0 with 7 rules applied. Total rules applied 986 place count 369 transition count 1359
Applied a total of 986 rules in 65 ms. Remains 369 /862 variables (removed 493) and now considering 1359/1852 (removed 493) transitions.
[2024-05-24 15:10:22] [INFO ] Flow matrix only has 719 transitions (discarded 640 similar events)
// Phase 1: matrix 719 rows 369 cols
[2024-05-24 15:10:22] [INFO ] Computed 25 invariants in 7 ms
[2024-05-24 15:10:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-24 15:10:23] [INFO ] Flow matrix only has 719 transitions (discarded 640 similar events)
[2024-05-24 15:10:23] [INFO ] Invariant cache hit.
[2024-05-24 15:10:23] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 369/5622 places, 1359/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3227 ms. Remains : 369/5622 places, 1359/5449 transitions.
Support contains 54 out of 369 places after structural reductions.
[2024-05-24 15:10:24] [INFO ] Flatten gal took : 108 ms
[2024-05-24 15:10:24] [INFO ] Flatten gal took : 61 ms
[2024-05-24 15:10:24] [INFO ] Input system was already deterministic with 1359 transitions.
Incomplete random walk after 10000 steps, including 546 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 15:10:24] [INFO ] Flow matrix only has 719 transitions (discarded 640 similar events)
[2024-05-24 15:10:24] [INFO ] Invariant cache hit.
[2024-05-24 15:10:25] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-24 15:10:25] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 15:10:25] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-24 15:10:25] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2024-05-24 15:10:25] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-05-24 15:10:25] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 1027 edges and 369 vertex of which 123 are kept as prefixes of interest. Removing 246 places using SCC suffix rule.3 ms
Discarding 246 places :
Also discarding 194 output transitions
Drop transitions removed 194 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 123 transition count 1123
Reduce places removed 15 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 20 rules applied. Total rules applied 63 place count 108 transition count 1118
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 103 transition count 1118
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 68 place count 103 transition count 1110
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 84 place count 95 transition count 1110
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 91 transition count 1106
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 91 transition count 1106
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 110 place count 82 transition count 1097
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 143 place count 82 transition count 1064
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 176 place count 49 transition count 1064
Applied a total of 176 rules in 107 ms. Remains 49 /369 variables (removed 320) and now considering 1064/1359 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 49/369 places, 1064/1359 transitions.
Finished random walk after 59 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 369 stabilizing places and 1359 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 369 transition count 1359
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 2143 edges and 369 vertex of which 361 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 361 transition count 1282
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 285 transition count 1282
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 153 place count 285 transition count 1250
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 217 place count 253 transition count 1250
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 254 place count 216 transition count 1213
Iterating global reduction 2 with 37 rules applied. Total rules applied 291 place count 216 transition count 1213
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 305 place count 202 transition count 1199
Iterating global reduction 2 with 14 rules applied. Total rules applied 319 place count 202 transition count 1199
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 327 place count 194 transition count 1199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 327 place count 194 transition count 1191
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 343 place count 186 transition count 1191
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 351 place count 178 transition count 1183
Iterating global reduction 3 with 8 rules applied. Total rules applied 359 place count 178 transition count 1183
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 367 place count 170 transition count 1175
Iterating global reduction 3 with 8 rules applied. Total rules applied 375 place count 170 transition count 1175
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 445 place count 135 transition count 1140
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 460 place count 120 transition count 1125
Iterating global reduction 3 with 15 rules applied. Total rules applied 475 place count 120 transition count 1125
Applied a total of 475 rules in 96 ms. Remains 120 /369 variables (removed 249) and now considering 1125/1359 (removed 234) transitions.
[2024-05-24 15:10:26] [INFO ] Flow matrix only has 344 transitions (discarded 781 similar events)
// Phase 1: matrix 344 rows 120 cols
[2024-05-24 15:10:26] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 15:10:26] [INFO ] Implicit Places using invariants in 130 ms returned [3, 10, 14, 20, 26, 32, 36, 42, 46, 50, 58, 62, 72, 88, 98]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 131 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/369 places, 1125/1359 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 92 transition count 1112
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 92 transition count 1112
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 79 transition count 1099
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 79 transition count 1099
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 77 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 75 transition count 1095
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 75 transition count 1095
Applied a total of 60 rules in 46 ms. Remains 75 /105 variables (removed 30) and now considering 1095/1125 (removed 30) transitions.
[2024-05-24 15:10:26] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
// Phase 1: matrix 74 rows 75 cols
[2024-05-24 15:10:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 15:10:26] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 15:10:26] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
[2024-05-24 15:10:26] [INFO ] Invariant cache hit.
[2024-05-24 15:10:26] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/369 places, 1095/1359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 489 ms. Remains : 75/369 places, 1095/1359 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 133 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-00 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 s69 s50)], 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 12083 reset in 371 ms.
Product exploration explored 100000 steps with 12092 reset in 289 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), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 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-S32C2-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-00 finished in 1471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||G(p0))))))'
Support contains 4 out of 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 2143 edges and 369 vertex of which 361 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 361 transition count 1282
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 285 transition count 1282
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 153 place count 285 transition count 1252
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 213 place count 255 transition count 1252
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 248 place count 220 transition count 1217
Iterating global reduction 2 with 35 rules applied. Total rules applied 283 place count 220 transition count 1217
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 297 place count 206 transition count 1203
Iterating global reduction 2 with 14 rules applied. Total rules applied 311 place count 206 transition count 1203
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 319 place count 198 transition count 1203
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 319 place count 198 transition count 1195
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 335 place count 190 transition count 1195
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 343 place count 182 transition count 1187
Iterating global reduction 3 with 8 rules applied. Total rules applied 351 place count 182 transition count 1187
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 359 place count 174 transition count 1179
Iterating global reduction 3 with 8 rules applied. Total rules applied 367 place count 174 transition count 1179
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 441 place count 137 transition count 1142
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 455 place count 123 transition count 1128
Iterating global reduction 3 with 14 rules applied. Total rules applied 469 place count 123 transition count 1128
Applied a total of 469 rules in 71 ms. Remains 123 /369 variables (removed 246) and now considering 1128/1359 (removed 231) transitions.
[2024-05-24 15:10:27] [INFO ] Flow matrix only has 348 transitions (discarded 780 similar events)
// Phase 1: matrix 348 rows 123 cols
[2024-05-24 15:10:27] [INFO ] Computed 17 invariants in 7 ms
[2024-05-24 15:10:27] [INFO ] Implicit Places using invariants in 116 ms returned [3, 10, 14, 21, 27, 33, 37, 43, 47, 51, 59, 63, 73, 90]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 118 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/369 places, 1128/1359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 1116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 1116
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 85 transition count 1104
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 85 transition count 1104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 83 transition count 1102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 81 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 81 transition count 1100
Applied a total of 56 rules in 27 ms. Remains 81 /109 variables (removed 28) and now considering 1100/1128 (removed 28) transitions.
[2024-05-24 15:10:27] [INFO ] Flow matrix only has 97 transitions (discarded 1003 similar events)
// Phase 1: matrix 97 rows 81 cols
[2024-05-24 15:10:27] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:10:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 15:10:27] [INFO ] Flow matrix only has 97 transitions (discarded 1003 similar events)
[2024-05-24 15:10:27] [INFO ] Invariant cache hit.
[2024-05-24 15:10:27] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/369 places, 1100/1359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 81/369 places, 1100/1359 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s73 s64), p1:(LEQ s10 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11479 reset in 277 ms.
Product exploration explored 100000 steps with 11453 reset in 277 ms.
Computed a total of 81 stabilizing places and 1100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 1100
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 p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(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 8 factoid took 13 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-01 finished in 1274 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(p0))) U X(p2)))'
Support contains 7 out of 369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 363 transition count 1359
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 52 place count 317 transition count 1313
Iterating global reduction 1 with 46 rules applied. Total rules applied 98 place count 317 transition count 1313
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 134 place count 281 transition count 1277
Iterating global reduction 1 with 36 rules applied. Total rules applied 170 place count 281 transition count 1277
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 176 place count 275 transition count 1277
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 207 place count 244 transition count 1246
Iterating global reduction 2 with 31 rules applied. Total rules applied 238 place count 244 transition count 1246
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 250 place count 232 transition count 1246
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 284 place count 198 transition count 1212
Iterating global reduction 3 with 34 rules applied. Total rules applied 318 place count 198 transition count 1212
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 336 place count 180 transition count 1194
Iterating global reduction 3 with 18 rules applied. Total rules applied 354 place count 180 transition count 1194
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 372 place count 162 transition count 1176
Iterating global reduction 3 with 18 rules applied. Total rules applied 390 place count 162 transition count 1176
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 408 place count 144 transition count 1158
Iterating global reduction 3 with 18 rules applied. Total rules applied 426 place count 144 transition count 1158
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 438 place count 132 transition count 1146
Iterating global reduction 3 with 12 rules applied. Total rules applied 450 place count 132 transition count 1146
Applied a total of 450 rules in 34 ms. Remains 132 /369 variables (removed 237) and now considering 1146/1359 (removed 213) transitions.
[2024-05-24 15:10:28] [INFO ] Flow matrix only has 206 transitions (discarded 940 similar events)
// Phase 1: matrix 206 rows 132 cols
[2024-05-24 15:10:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 15:10:28] [INFO ] Implicit Places using invariants in 99 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/369 places, 1146/1359 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 1145
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 1144
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 1143
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 1142
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 1142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 1141
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 1141
Applied a total of 10 rules in 15 ms. Remains 126 /131 variables (removed 5) and now considering 1141/1146 (removed 5) transitions.
[2024-05-24 15:10:28] [INFO ] Flow matrix only has 186 transitions (discarded 955 similar events)
// Phase 1: matrix 186 rows 126 cols
[2024-05-24 15:10:28] [INFO ] Computed 6 invariants in 2 ms
[2024-05-24 15:10:29] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-24 15:10:29] [INFO ] Flow matrix only has 186 transitions (discarded 955 similar events)
[2024-05-24 15:10:29] [INFO ] Invariant cache hit.
[2024-05-24 15:10:29] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/369 places, 1141/1359 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 449 ms. Remains : 126/369 places, 1141/1359 transitions.
Stuttering acceptance computed with spot in 1621 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NOT (AND (LEQ 2 s79) (LEQ s21 s80))) (GT s33 s47)), p0:(GT s33 s47), p2:(LEQ s61 s113)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Computed a total of 126 stabilizing places and 1141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 126 transition count 1141
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 (NOT p1) (NOT p0) p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 25 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-02 finished in 2913 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 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 2143 edges and 369 vertex of which 361 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 361 transition count 1283
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 286 transition count 1283
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 151 place count 286 transition count 1249
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 219 place count 252 transition count 1249
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 256 place count 215 transition count 1212
Iterating global reduction 2 with 37 rules applied. Total rules applied 293 place count 215 transition count 1212
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 306 place count 202 transition count 1199
Iterating global reduction 2 with 13 rules applied. Total rules applied 319 place count 202 transition count 1199
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 326 place count 195 transition count 1199
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 326 place count 195 transition count 1192
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 340 place count 188 transition count 1192
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 347 place count 181 transition count 1185
Iterating global reduction 3 with 7 rules applied. Total rules applied 354 place count 181 transition count 1185
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 361 place count 174 transition count 1178
Iterating global reduction 3 with 7 rules applied. Total rules applied 368 place count 174 transition count 1178
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 438 place count 139 transition count 1143
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 452 place count 125 transition count 1129
Iterating global reduction 3 with 14 rules applied. Total rules applied 466 place count 125 transition count 1129
Applied a total of 466 rules in 59 ms. Remains 125 /369 variables (removed 244) and now considering 1129/1359 (removed 230) transitions.
[2024-05-24 15:10:31] [INFO ] Flow matrix only has 363 transitions (discarded 766 similar events)
// Phase 1: matrix 363 rows 125 cols
[2024-05-24 15:10:31] [INFO ] Computed 18 invariants in 6 ms
[2024-05-24 15:10:31] [INFO ] Implicit Places using invariants in 118 ms returned [3, 10, 22, 28, 34, 41, 48, 52, 56, 64, 68, 78, 94, 102]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 119 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/369 places, 1129/1359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 99 transition count 1117
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 99 transition count 1117
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 87 transition count 1105
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 87 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 85 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 83 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 83 transition count 1101
Applied a total of 56 rules in 23 ms. Remains 83 /111 variables (removed 28) and now considering 1101/1129 (removed 28) transitions.
[2024-05-24 15:10:31] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
// Phase 1: matrix 111 rows 83 cols
[2024-05-24 15:10:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:10:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-24 15:10:31] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
[2024-05-24 15:10:31] [INFO ] Invariant cache hit.
[2024-05-24 15:10:32] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/369 places, 1101/1359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 452 ms. Remains : 83/369 places, 1101/1359 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-03 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:(GT s12 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-03 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(p1||X(X(p2))))))))'
Support contains 6 out of 369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 362 transition count 1359
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 54 place count 315 transition count 1312
Iterating global reduction 1 with 47 rules applied. Total rules applied 101 place count 315 transition count 1312
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 137 place count 279 transition count 1276
Iterating global reduction 1 with 36 rules applied. Total rules applied 173 place count 279 transition count 1276
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 179 place count 273 transition count 1276
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 211 place count 241 transition count 1244
Iterating global reduction 2 with 32 rules applied. Total rules applied 243 place count 241 transition count 1244
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 257 place count 227 transition count 1244
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 293 place count 191 transition count 1208
Iterating global reduction 3 with 36 rules applied. Total rules applied 329 place count 191 transition count 1208
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 349 place count 171 transition count 1188
Iterating global reduction 3 with 20 rules applied. Total rules applied 369 place count 171 transition count 1188
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 389 place count 151 transition count 1168
Iterating global reduction 3 with 20 rules applied. Total rules applied 409 place count 151 transition count 1168
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 429 place count 131 transition count 1148
Iterating global reduction 3 with 20 rules applied. Total rules applied 449 place count 131 transition count 1148
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 463 place count 117 transition count 1134
Iterating global reduction 3 with 14 rules applied. Total rules applied 477 place count 117 transition count 1134
Applied a total of 477 rules in 36 ms. Remains 117 /369 variables (removed 252) and now considering 1134/1359 (removed 225) transitions.
[2024-05-24 15:10:32] [INFO ] Flow matrix only has 165 transitions (discarded 969 similar events)
// Phase 1: matrix 165 rows 117 cols
[2024-05-24 15:10:32] [INFO ] Computed 5 invariants in 2 ms
[2024-05-24 15:10:32] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 15:10:32] [INFO ] Flow matrix only has 165 transitions (discarded 969 similar events)
[2024-05-24 15:10:32] [INFO ] Invariant cache hit.
[2024-05-24 15:10:32] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-24 15:10:32] [INFO ] Flow matrix only has 165 transitions (discarded 969 similar events)
[2024-05-24 15:10:32] [INFO ] Invariant cache hit.
[2024-05-24 15:10:32] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/369 places, 1134/1359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 117/369 places, 1134/1359 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(OR (GT s63 s99) (GT s67 s77)), p1:(LEQ s39 s48), p2:(LEQ s63 s99)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-07 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 7 out of 369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 365 transition count 1359
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 50 place count 319 transition count 1313
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 319 transition count 1313
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 130 place count 285 transition count 1279
Iterating global reduction 1 with 34 rules applied. Total rules applied 164 place count 285 transition count 1279
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 170 place count 279 transition count 1279
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 198 place count 251 transition count 1251
Iterating global reduction 2 with 28 rules applied. Total rules applied 226 place count 251 transition count 1251
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 236 place count 241 transition count 1251
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 264 place count 213 transition count 1223
Iterating global reduction 3 with 28 rules applied. Total rules applied 292 place count 213 transition count 1223
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 308 place count 197 transition count 1207
Iterating global reduction 3 with 16 rules applied. Total rules applied 324 place count 197 transition count 1207
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 340 place count 181 transition count 1191
Iterating global reduction 3 with 16 rules applied. Total rules applied 356 place count 181 transition count 1191
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 372 place count 165 transition count 1175
Iterating global reduction 3 with 16 rules applied. Total rules applied 388 place count 165 transition count 1175
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 398 place count 155 transition count 1165
Iterating global reduction 3 with 10 rules applied. Total rules applied 408 place count 155 transition count 1165
Applied a total of 408 rules in 35 ms. Remains 155 /369 variables (removed 214) and now considering 1165/1359 (removed 194) transitions.
[2024-05-24 15:10:33] [INFO ] Flow matrix only has 257 transitions (discarded 908 similar events)
// Phase 1: matrix 257 rows 155 cols
[2024-05-24 15:10:33] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 15:10:33] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-24 15:10:33] [INFO ] Flow matrix only has 257 transitions (discarded 908 similar events)
[2024-05-24 15:10:33] [INFO ] Invariant cache hit.
[2024-05-24 15:10:33] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-24 15:10:33] [INFO ] Flow matrix only has 257 transitions (discarded 908 similar events)
[2024-05-24 15:10:33] [INFO ] Invariant cache hit.
[2024-05-24 15:10:33] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/369 places, 1165/1359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 155/369 places, 1165/1359 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s8 s89) (OR (LEQ 2 s114) (AND (LEQ s46 s54) (GT s77 s16))))], 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][false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-08 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 4 out of 369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 362 transition count 1359
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 56 place count 313 transition count 1310
Iterating global reduction 1 with 49 rules applied. Total rules applied 105 place count 313 transition count 1310
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 142 place count 276 transition count 1273
Iterating global reduction 1 with 37 rules applied. Total rules applied 179 place count 276 transition count 1273
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 186 place count 269 transition count 1273
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 220 place count 235 transition count 1239
Iterating global reduction 2 with 34 rules applied. Total rules applied 254 place count 235 transition count 1239
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 267 place count 222 transition count 1239
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 303 place count 186 transition count 1203
Iterating global reduction 3 with 36 rules applied. Total rules applied 339 place count 186 transition count 1203
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 359 place count 166 transition count 1183
Iterating global reduction 3 with 20 rules applied. Total rules applied 379 place count 166 transition count 1183
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 399 place count 146 transition count 1163
Iterating global reduction 3 with 20 rules applied. Total rules applied 419 place count 146 transition count 1163
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 439 place count 126 transition count 1143
Iterating global reduction 3 with 20 rules applied. Total rules applied 459 place count 126 transition count 1143
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 472 place count 113 transition count 1130
Iterating global reduction 3 with 13 rules applied. Total rules applied 485 place count 113 transition count 1130
Applied a total of 485 rules in 36 ms. Remains 113 /369 variables (removed 256) and now considering 1130/1359 (removed 229) transitions.
[2024-05-24 15:10:33] [INFO ] Flow matrix only has 159 transitions (discarded 971 similar events)
// Phase 1: matrix 159 rows 113 cols
[2024-05-24 15:10:33] [INFO ] Computed 5 invariants in 2 ms
[2024-05-24 15:10:34] [INFO ] Implicit Places using invariants in 108 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/369 places, 1130/1359 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 1129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 1129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 110 transition count 1128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 1127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 1126
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 1125
Applied a total of 10 rules in 16 ms. Remains 107 /112 variables (removed 5) and now considering 1125/1130 (removed 5) transitions.
[2024-05-24 15:10:34] [INFO ] Flow matrix only has 139 transitions (discarded 986 similar events)
// Phase 1: matrix 139 rows 107 cols
[2024-05-24 15:10:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:10:34] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-24 15:10:34] [INFO ] Flow matrix only has 139 transitions (discarded 986 similar events)
[2024-05-24 15:10:34] [INFO ] Invariant cache hit.
[2024-05-24 15:10:34] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/369 places, 1125/1359 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 416 ms. Remains : 107/369 places, 1125/1359 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (LEQ s48 s9) (LEQ s92 s31)), p1:(LEQ s92 s31)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 295 ms.
Product exploration explored 100000 steps with 33333 reset in 315 ms.
Computed a total of 107 stabilizing places and 1125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 107 transition count 1125
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 p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-09 finished in 1363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 4 out of 369 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 362 transition count 1359
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 56 place count 313 transition count 1310
Iterating global reduction 1 with 49 rules applied. Total rules applied 105 place count 313 transition count 1310
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 144 place count 274 transition count 1271
Iterating global reduction 1 with 39 rules applied. Total rules applied 183 place count 274 transition count 1271
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 190 place count 267 transition count 1271
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 225 place count 232 transition count 1236
Iterating global reduction 2 with 35 rules applied. Total rules applied 260 place count 232 transition count 1236
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 274 place count 218 transition count 1236
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 311 place count 181 transition count 1199
Iterating global reduction 3 with 37 rules applied. Total rules applied 348 place count 181 transition count 1199
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 369 place count 160 transition count 1178
Iterating global reduction 3 with 21 rules applied. Total rules applied 390 place count 160 transition count 1178
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 411 place count 139 transition count 1157
Iterating global reduction 3 with 21 rules applied. Total rules applied 432 place count 139 transition count 1157
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 453 place count 118 transition count 1136
Iterating global reduction 3 with 21 rules applied. Total rules applied 474 place count 118 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 488 place count 104 transition count 1122
Iterating global reduction 3 with 14 rules applied. Total rules applied 502 place count 104 transition count 1122
Applied a total of 502 rules in 34 ms. Remains 104 /369 variables (removed 265) and now considering 1122/1359 (removed 237) transitions.
[2024-05-24 15:10:35] [INFO ] Flow matrix only has 136 transitions (discarded 986 similar events)
// Phase 1: matrix 136 rows 104 cols
[2024-05-24 15:10:35] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:10:35] [INFO ] Implicit Places using invariants in 103 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/369 places, 1122/1359 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 99 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 99 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 98 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 98 transition count 1117
Applied a total of 10 rules in 14 ms. Remains 98 /103 variables (removed 5) and now considering 1117/1122 (removed 5) transitions.
[2024-05-24 15:10:35] [INFO ] Flow matrix only has 116 transitions (discarded 1001 similar events)
// Phase 1: matrix 116 rows 98 cols
[2024-05-24 15:10:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:10:35] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 15:10:35] [INFO ] Flow matrix only has 116 transitions (discarded 1001 similar events)
[2024-05-24 15:10:35] [INFO ] Invariant cache hit.
[2024-05-24 15:10:35] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/369 places, 1117/1359 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 411 ms. Remains : 98/369 places, 1117/1359 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s80 s59), p1:(GT s67 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-11 finished in 549 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 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 2143 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 362 transition count 1282
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 286 transition count 1282
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 153 place count 286 transition count 1250
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 217 place count 254 transition count 1250
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 254 place count 217 transition count 1213
Iterating global reduction 2 with 37 rules applied. Total rules applied 291 place count 217 transition count 1213
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 305 place count 203 transition count 1199
Iterating global reduction 2 with 14 rules applied. Total rules applied 319 place count 203 transition count 1199
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 327 place count 195 transition count 1199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 327 place count 195 transition count 1191
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 343 place count 187 transition count 1191
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 351 place count 179 transition count 1183
Iterating global reduction 3 with 8 rules applied. Total rules applied 359 place count 179 transition count 1183
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 367 place count 171 transition count 1175
Iterating global reduction 3 with 8 rules applied. Total rules applied 375 place count 171 transition count 1175
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 445 place count 136 transition count 1140
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 459 place count 122 transition count 1126
Iterating global reduction 3 with 14 rules applied. Total rules applied 473 place count 122 transition count 1126
Applied a total of 473 rules in 57 ms. Remains 122 /369 variables (removed 247) and now considering 1126/1359 (removed 233) transitions.
[2024-05-24 15:10:35] [INFO ] Flow matrix only has 345 transitions (discarded 781 similar events)
// Phase 1: matrix 345 rows 122 cols
[2024-05-24 15:10:35] [INFO ] Computed 17 invariants in 6 ms
[2024-05-24 15:10:35] [INFO ] Implicit Places using invariants in 115 ms returned [3, 10, 14, 20, 26, 39, 45, 49, 53, 62, 66, 76, 92, 100]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 117 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/369 places, 1126/1359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 96 transition count 1114
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 96 transition count 1114
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 84 transition count 1102
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 84 transition count 1102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 82 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 80 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 80 transition count 1098
Applied a total of 56 rules in 22 ms. Remains 80 /108 variables (removed 28) and now considering 1098/1126 (removed 28) transitions.
[2024-05-24 15:10:35] [INFO ] Flow matrix only has 93 transitions (discarded 1005 similar events)
// Phase 1: matrix 93 rows 80 cols
[2024-05-24 15:10:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:10:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 15:10:36] [INFO ] Flow matrix only has 93 transitions (discarded 1005 similar events)
[2024-05-24 15:10:36] [INFO ] Invariant cache hit.
[2024-05-24 15:10:36] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/369 places, 1098/1359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 423 ms. Remains : 80/369 places, 1098/1359 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-12 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 s25 s43)], 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 1696 steps with 195 reset in 8 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-12 finished in 497 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 U G(p2)))&&G(F(p1))))'
Support contains 6 out of 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 2143 edges and 369 vertex of which 361 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 361 transition count 1284
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 149 place count 287 transition count 1284
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 149 place count 287 transition count 1255
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 207 place count 258 transition count 1255
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 240 place count 225 transition count 1222
Iterating global reduction 2 with 33 rules applied. Total rules applied 273 place count 225 transition count 1222
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 287 place count 211 transition count 1208
Iterating global reduction 2 with 14 rules applied. Total rules applied 301 place count 211 transition count 1208
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 309 place count 203 transition count 1208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 309 place count 203 transition count 1200
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 325 place count 195 transition count 1200
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 333 place count 187 transition count 1192
Iterating global reduction 3 with 8 rules applied. Total rules applied 341 place count 187 transition count 1192
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 349 place count 179 transition count 1184
Iterating global reduction 3 with 8 rules applied. Total rules applied 357 place count 179 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 358 place count 178 transition count 1183
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 178 transition count 1183
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 433 place count 141 transition count 1146
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 447 place count 127 transition count 1132
Iterating global reduction 3 with 14 rules applied. Total rules applied 461 place count 127 transition count 1132
Applied a total of 461 rules in 59 ms. Remains 127 /369 variables (removed 242) and now considering 1132/1359 (removed 227) transitions.
[2024-05-24 15:10:36] [INFO ] Flow matrix only has 352 transitions (discarded 780 similar events)
// Phase 1: matrix 352 rows 127 cols
[2024-05-24 15:10:36] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 15:10:36] [INFO ] Implicit Places using invariants in 113 ms returned [3, 12, 16, 22, 31, 37, 50, 54, 58, 66, 70, 80, 96, 105]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 115 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/369 places, 1132/1359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 101 transition count 1120
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 101 transition count 1120
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 89 transition count 1108
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 89 transition count 1108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 87 transition count 1106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 85 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 85 transition count 1104
Applied a total of 56 rules in 22 ms. Remains 85 /113 variables (removed 28) and now considering 1104/1132 (removed 28) transitions.
[2024-05-24 15:10:36] [INFO ] Flow matrix only has 103 transitions (discarded 1001 similar events)
// Phase 1: matrix 103 rows 85 cols
[2024-05-24 15:10:36] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:10:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 15:10:36] [INFO ] Flow matrix only has 103 transitions (discarded 1001 similar events)
[2024-05-24 15:10:36] [INFO ] Invariant cache hit.
[2024-05-24 15:10:36] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/369 places, 1104/1359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 442 ms. Remains : 85/369 places, 1104/1359 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={} source=0 dest: 5}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ s17 s29), p1:(GT s72 s18), p0:(LEQ s32 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-13 finished in 722 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 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 1359/1359 transitions.
Graph (complete) has 2143 edges and 369 vertex of which 361 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 361 transition count 1283
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 286 transition count 1283
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 151 place count 286 transition count 1249
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 219 place count 252 transition count 1249
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 256 place count 215 transition count 1212
Iterating global reduction 2 with 37 rules applied. Total rules applied 293 place count 215 transition count 1212
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 306 place count 202 transition count 1199
Iterating global reduction 2 with 13 rules applied. Total rules applied 319 place count 202 transition count 1199
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 327 place count 194 transition count 1199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 327 place count 194 transition count 1191
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 343 place count 186 transition count 1191
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 351 place count 178 transition count 1183
Iterating global reduction 3 with 8 rules applied. Total rules applied 359 place count 178 transition count 1183
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 367 place count 170 transition count 1175
Iterating global reduction 3 with 8 rules applied. Total rules applied 375 place count 170 transition count 1175
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 443 place count 136 transition count 1141
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 457 place count 122 transition count 1127
Iterating global reduction 3 with 14 rules applied. Total rules applied 471 place count 122 transition count 1127
Applied a total of 471 rules in 51 ms. Remains 122 /369 variables (removed 247) and now considering 1127/1359 (removed 232) transitions.
[2024-05-24 15:10:37] [INFO ] Flow matrix only has 345 transitions (discarded 782 similar events)
// Phase 1: matrix 345 rows 122 cols
[2024-05-24 15:10:37] [INFO ] Computed 17 invariants in 5 ms
[2024-05-24 15:10:37] [INFO ] Implicit Places using invariants in 115 ms returned [12, 16, 30, 36, 40, 46, 50, 54, 62, 66, 76, 92, 100]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 117 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/369 places, 1127/1359 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 1116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 1116
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 87 transition count 1105
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 87 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 85 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 83 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 83 transition count 1101
Applied a total of 52 rules in 21 ms. Remains 83 /109 variables (removed 26) and now considering 1101/1127 (removed 26) transitions.
[2024-05-24 15:10:37] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
// Phase 1: matrix 111 rows 83 cols
[2024-05-24 15:10:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 15:10:37] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 15:10:37] [INFO ] Flow matrix only has 111 transitions (discarded 990 similar events)
[2024-05-24 15:10:37] [INFO ] Invariant cache hit.
[2024-05-24 15:10:37] [INFO ] Implicit Places using invariants and state equation in 144 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 : 83/369 places, 1101/1359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 83/369 places, 1101/1359 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s20 s5)], 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 11272 reset in 233 ms.
Product exploration explored 100000 steps with 11267 reset in 251 ms.
Computed a total of 83 stabilizing places and 1101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 transition count 1101
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), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 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-S32C2-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLCardinality-14 finished in 1152 ms.
All properties solved by simple procedures.
Total runtime 18132 ms.
BK_STOP 1716563442123
--------------------
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-S32C2"
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-S32C2, 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-171649628400227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C2.tgz
mv LeafsetExtension-PT-S32C2 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 '
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 ;