About the Execution of LoLa+red for LeafsetExtension-PT-S08C3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 411.567 | 11601.00 | 23040.00 | 439.80 | FTFFTFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416100459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is LeafsetExtension-PT-S08C3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416100459
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 254K Mar 5 18:22 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-S08C3-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679458154037
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:09:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:09:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:09:15] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-22 04:09:15] [INFO ] Transformed 462 places.
[2023-03-22 04:09:15] [INFO ] Transformed 409 transitions.
[2023-03-22 04:09:15] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 62 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 389 transition count 409
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 122 place count 340 transition count 360
Iterating global reduction 1 with 49 rules applied. Total rules applied 171 place count 340 transition count 360
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 200 place count 311 transition count 331
Iterating global reduction 1 with 29 rules applied. Total rules applied 229 place count 311 transition count 331
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 250 place count 290 transition count 310
Iterating global reduction 1 with 21 rules applied. Total rules applied 271 place count 290 transition count 310
Applied a total of 271 rules in 73 ms. Remains 290 /462 variables (removed 172) and now considering 310/409 (removed 99) transitions.
// Phase 1: matrix 310 rows 290 cols
[2023-03-22 04:09:15] [INFO ] Computed 30 place invariants in 23 ms
[2023-03-22 04:09:16] [INFO ] Implicit Places using invariants in 743 ms returned [35, 39, 66, 93, 120, 122, 125, 176, 230, 265]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 767 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 280/462 places, 310/409 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 268 transition count 298
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 268 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 267 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 267 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 266 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 266 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 265 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 265 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 264 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 264 transition count 294
Applied a total of 32 rules in 29 ms. Remains 264 /280 variables (removed 16) and now considering 294/310 (removed 16) transitions.
[2023-03-22 04:09:16] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
// Phase 1: matrix 293 rows 264 cols
[2023-03-22 04:09:16] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-22 04:09:16] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-22 04:09:16] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2023-03-22 04:09:16] [INFO ] Invariant cache hit.
[2023-03-22 04:09:16] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/462 places, 294/409 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1206 ms. Remains : 264/462 places, 294/409 transitions.
Support contains 62 out of 264 places after structural reductions.
[2023-03-22 04:09:17] [INFO ] Flatten gal took : 44 ms
[2023-03-22 04:09:17] [INFO ] Flatten gal took : 17 ms
[2023-03-22 04:09:17] [INFO ] Input system was already deterministic with 294 transitions.
Incomplete random walk after 10000 steps, including 375 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 38) seen :30
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 04:09:17] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2023-03-22 04:09:17] [INFO ] Invariant cache hit.
[2023-03-22 04:09:17] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-22 04:09:17] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 04:09:18] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-22 04:09:18] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 264 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 264 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0)))) U (p1&&X(X(X(G(p0))))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 253 transition count 294
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 46 place count 218 transition count 259
Iterating global reduction 1 with 35 rules applied. Total rules applied 81 place count 218 transition count 259
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 110 place count 189 transition count 230
Iterating global reduction 1 with 29 rules applied. Total rules applied 139 place count 189 transition count 230
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 141 place count 187 transition count 230
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 163 place count 165 transition count 208
Iterating global reduction 2 with 22 rules applied. Total rules applied 185 place count 165 transition count 208
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 197 place count 153 transition count 208
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 225 place count 125 transition count 180
Iterating global reduction 3 with 28 rules applied. Total rules applied 253 place count 125 transition count 180
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 265 place count 113 transition count 168
Iterating global reduction 3 with 12 rules applied. Total rules applied 277 place count 113 transition count 168
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 289 place count 101 transition count 156
Iterating global reduction 3 with 12 rules applied. Total rules applied 301 place count 101 transition count 156
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 314 place count 88 transition count 143
Iterating global reduction 3 with 13 rules applied. Total rules applied 327 place count 88 transition count 143
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 344 place count 71 transition count 126
Iterating global reduction 3 with 17 rules applied. Total rules applied 361 place count 71 transition count 126
Applied a total of 361 rules in 19 ms. Remains 71 /264 variables (removed 193) and now considering 126/294 (removed 168) transitions.
[2023-03-22 04:09:18] [INFO ] Flow matrix only has 78 transitions (discarded 48 similar events)
// Phase 1: matrix 78 rows 71 cols
[2023-03-22 04:09:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:09:18] [INFO ] Implicit Places using invariants in 44 ms returned [34, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/264 places, 126/294 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 118
Applied a total of 16 rules in 1 ms. Remains 61 /69 variables (removed 8) and now considering 118/126 (removed 8) transitions.
[2023-03-22 04:09:18] [INFO ] Flow matrix only has 69 transitions (discarded 49 similar events)
// Phase 1: matrix 69 rows 61 cols
[2023-03-22 04:09:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:09:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 04:09:18] [INFO ] Flow matrix only has 69 transitions (discarded 49 similar events)
[2023-03-22 04:09:18] [INFO ] Invariant cache hit.
[2023-03-22 04:09:18] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/264 places, 118/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 61/264 places, 118/294 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s57), p0:(GT s43 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, 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 4 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-00 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(!p0&&X(G(p1))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 253 transition count 294
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 45 place count 219 transition count 260
Iterating global reduction 1 with 34 rules applied. Total rules applied 79 place count 219 transition count 260
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 108 place count 190 transition count 231
Iterating global reduction 1 with 29 rules applied. Total rules applied 137 place count 190 transition count 231
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 188 transition count 231
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 162 place count 165 transition count 208
Iterating global reduction 2 with 23 rules applied. Total rules applied 185 place count 165 transition count 208
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 198 place count 152 transition count 208
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 228 place count 122 transition count 178
Iterating global reduction 3 with 30 rules applied. Total rules applied 258 place count 122 transition count 178
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 272 place count 108 transition count 164
Iterating global reduction 3 with 14 rules applied. Total rules applied 286 place count 108 transition count 164
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 300 place count 94 transition count 150
Iterating global reduction 3 with 14 rules applied. Total rules applied 314 place count 94 transition count 150
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 329 place count 79 transition count 135
Iterating global reduction 3 with 15 rules applied. Total rules applied 344 place count 79 transition count 135
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 366 place count 57 transition count 113
Iterating global reduction 3 with 22 rules applied. Total rules applied 388 place count 57 transition count 113
Applied a total of 388 rules in 43 ms. Remains 57 /264 variables (removed 207) and now considering 113/294 (removed 181) transitions.
[2023-03-22 04:09:19] [INFO ] Flow matrix only has 60 transitions (discarded 53 similar events)
// Phase 1: matrix 60 rows 57 cols
[2023-03-22 04:09:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:19] [INFO ] Implicit Places using invariants in 38 ms returned [37, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/264 places, 113/294 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 50 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 50 transition count 108
Applied a total of 10 rules in 2 ms. Remains 50 /55 variables (removed 5) and now considering 108/113 (removed 5) transitions.
[2023-03-22 04:09:19] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2023-03-22 04:09:19] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 04:09:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 04:09:19] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
[2023-03-22 04:09:19] [INFO ] Invariant cache hit.
[2023-03-22 04:09:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/264 places, 108/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 50/264 places, 108/294 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s14 s24), p1:(LEQ 1 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Computed a total of 50 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 108
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 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-01 finished in 914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Graph (complete) has 600 edges and 264 vertex of which 250 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 250 transition count 230
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 188 transition count 230
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 125 place count 188 transition count 213
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 171 transition count 213
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 177 place count 153 transition count 195
Iterating global reduction 2 with 18 rules applied. Total rules applied 195 place count 153 transition count 195
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 148 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 148 transition count 190
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 147 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 206 place count 147 transition count 189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 146 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 209 place count 145 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 145 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 211 place count 144 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 144 transition count 187
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 290 place count 105 transition count 148
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 304 place count 91 transition count 134
Iterating global reduction 3 with 14 rules applied. Total rules applied 318 place count 91 transition count 134
Applied a total of 318 rules in 51 ms. Remains 91 /264 variables (removed 173) and now considering 134/294 (removed 160) transitions.
[2023-03-22 04:09:19] [INFO ] Flow matrix only has 127 transitions (discarded 7 similar events)
// Phase 1: matrix 127 rows 91 cols
[2023-03-22 04:09:19] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-22 04:09:20] [INFO ] Implicit Places using invariants in 59 ms returned [2, 4, 11, 17, 19, 25, 27, 33, 37, 39, 41, 48, 51, 57, 63]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 60 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/264 places, 134/294 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 76 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 133
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 62 transition count 120
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 62 transition count 120
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 51 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 51 transition count 109
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 42 transition count 100
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 42 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 36 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 35 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 35 transition count 93
Applied a total of 82 rules in 10 ms. Remains 35 /76 variables (removed 41) and now considering 93/134 (removed 41) transitions.
[2023-03-22 04:09:20] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
// Phase 1: matrix 39 rows 35 cols
[2023-03-22 04:09:20] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 04:09:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 04:09:20] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
[2023-03-22 04:09:20] [INFO ] Invariant cache hit.
[2023-03-22 04:09:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/264 places, 93/294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 35/264 places, 93/294 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s25 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-03 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p0)&&G(p1)))||X((G(p2)||(p2&&F(p3)))))))'
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 253 transition count 294
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 221 transition count 262
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 221 transition count 262
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 103 place count 193 transition count 234
Iterating global reduction 1 with 28 rules applied. Total rules applied 131 place count 193 transition count 234
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 133 place count 191 transition count 234
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 155 place count 169 transition count 212
Iterating global reduction 2 with 22 rules applied. Total rules applied 177 place count 169 transition count 212
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 187 place count 159 transition count 212
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 212 place count 134 transition count 187
Iterating global reduction 3 with 25 rules applied. Total rules applied 237 place count 134 transition count 187
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 248 place count 123 transition count 176
Iterating global reduction 3 with 11 rules applied. Total rules applied 259 place count 123 transition count 176
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 269 place count 113 transition count 166
Iterating global reduction 3 with 10 rules applied. Total rules applied 279 place count 113 transition count 166
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 290 place count 102 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 301 place count 102 transition count 155
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 315 place count 88 transition count 141
Iterating global reduction 3 with 14 rules applied. Total rules applied 329 place count 88 transition count 141
Applied a total of 329 rules in 25 ms. Remains 88 /264 variables (removed 176) and now considering 141/294 (removed 153) transitions.
[2023-03-22 04:09:20] [INFO ] Flow matrix only has 103 transitions (discarded 38 similar events)
// Phase 1: matrix 103 rows 88 cols
[2023-03-22 04:09:20] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 04:09:20] [INFO ] Implicit Places using invariants in 43 ms returned [42, 51, 66]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/264 places, 141/294 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 132
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 75 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 75 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 74 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 74 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 73 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 73 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 72 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 72 transition count 128
Applied a total of 26 rules in 5 ms. Remains 72 /85 variables (removed 13) and now considering 128/141 (removed 13) transitions.
[2023-03-22 04:09:20] [INFO ] Flow matrix only has 86 transitions (discarded 42 similar events)
// Phase 1: matrix 86 rows 72 cols
[2023-03-22 04:09:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 04:09:20] [INFO ] Flow matrix only has 86 transitions (discarded 42 similar events)
[2023-03-22 04:09:20] [INFO ] Invariant cache hit.
[2023-03-22 04:09:20] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 72/264 places, 128/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 72/264 places, 128/294 transitions.
Stuttering acceptance computed with spot in 502 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=9 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={0} source=9 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=10 dest: 9}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={0} source=10 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(LEQ s40 s8), p2:(GT 1 s46), p3:(GT 1 s24), p0:(LEQ s37 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33484 reset in 186 ms.
Product exploration explored 100000 steps with 33309 reset in 234 ms.
Computed a total of 72 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 128
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p2)), (F (OR (G p3) (G (NOT p3)))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p3 p0)
Knowledge based reduction with 16 factoid took 668 ms. Reduced automaton from 12 states, 37 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-04 finished in 1837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 253 transition count 294
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 44 place count 220 transition count 261
Iterating global reduction 1 with 33 rules applied. Total rules applied 77 place count 220 transition count 261
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 103 place count 194 transition count 235
Iterating global reduction 1 with 26 rules applied. Total rules applied 129 place count 194 transition count 235
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 193 transition count 235
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 149 place count 174 transition count 216
Iterating global reduction 2 with 19 rules applied. Total rules applied 168 place count 174 transition count 216
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 178 place count 164 transition count 216
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 204 place count 138 transition count 190
Iterating global reduction 3 with 26 rules applied. Total rules applied 230 place count 138 transition count 190
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 240 place count 128 transition count 180
Iterating global reduction 3 with 10 rules applied. Total rules applied 250 place count 128 transition count 180
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 259 place count 119 transition count 171
Iterating global reduction 3 with 9 rules applied. Total rules applied 268 place count 119 transition count 171
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 277 place count 110 transition count 162
Iterating global reduction 3 with 9 rules applied. Total rules applied 286 place count 110 transition count 162
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 299 place count 97 transition count 149
Iterating global reduction 3 with 13 rules applied. Total rules applied 312 place count 97 transition count 149
Applied a total of 312 rules in 22 ms. Remains 97 /264 variables (removed 167) and now considering 149/294 (removed 145) transitions.
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 112 transitions (discarded 37 similar events)
// Phase 1: matrix 112 rows 97 cols
[2023-03-22 04:09:22] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants in 49 ms returned [30, 43, 60]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/264 places, 149/294 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 85 transition count 140
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 85 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 84 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 83 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 83 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 82 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 82 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 81 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 81 transition count 136
Applied a total of 26 rules in 6 ms. Remains 81 /94 variables (removed 13) and now considering 136/149 (removed 13) transitions.
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 96 transitions (discarded 40 similar events)
// Phase 1: matrix 96 rows 81 cols
[2023-03-22 04:09:22] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 96 transitions (discarded 40 similar events)
[2023-03-22 04:09:22] [INFO ] Invariant cache hit.
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 81/264 places, 136/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 81/264 places, 136/294 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ s66 s19) (LEQ s52 s27)), p0:(LEQ s32 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-05 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 252 transition count 294
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 46 place count 218 transition count 260
Iterating global reduction 1 with 34 rules applied. Total rules applied 80 place count 218 transition count 260
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 108 place count 190 transition count 232
Iterating global reduction 1 with 28 rules applied. Total rules applied 136 place count 190 transition count 232
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 138 place count 188 transition count 232
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 159 place count 167 transition count 211
Iterating global reduction 2 with 21 rules applied. Total rules applied 180 place count 167 transition count 211
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 191 place count 156 transition count 211
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 216 place count 131 transition count 186
Iterating global reduction 3 with 25 rules applied. Total rules applied 241 place count 131 transition count 186
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 251 place count 121 transition count 176
Iterating global reduction 3 with 10 rules applied. Total rules applied 261 place count 121 transition count 176
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 271 place count 111 transition count 166
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 111 transition count 166
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 292 place count 100 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 303 place count 100 transition count 155
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 317 place count 86 transition count 141
Iterating global reduction 3 with 14 rules applied. Total rules applied 331 place count 86 transition count 141
Applied a total of 331 rules in 13 ms. Remains 86 /264 variables (removed 178) and now considering 141/294 (removed 153) transitions.
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 102 transitions (discarded 39 similar events)
// Phase 1: matrix 102 rows 86 cols
[2023-03-22 04:09:22] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants in 45 ms returned [47, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/264 places, 141/294 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 132
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 132
Applied a total of 18 rules in 2 ms. Remains 75 /84 variables (removed 9) and now considering 132/141 (removed 9) transitions.
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 92 transitions (discarded 40 similar events)
// Phase 1: matrix 92 rows 75 cols
[2023-03-22 04:09:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 92 transitions (discarded 40 similar events)
[2023-03-22 04:09:22] [INFO ] Invariant cache hit.
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/264 places, 132/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 75/264 places, 132/294 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s51 s59) (OR (LEQ s71 s20) (GT s49 s30)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-06 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((p1&&X(p2)&&F(!p1)))))))'
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 254 transition count 294
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 43 place count 221 transition count 261
Iterating global reduction 1 with 33 rules applied. Total rules applied 76 place count 221 transition count 261
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 103 place count 194 transition count 234
Iterating global reduction 1 with 27 rules applied. Total rules applied 130 place count 194 transition count 234
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 192 transition count 234
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 152 place count 172 transition count 214
Iterating global reduction 2 with 20 rules applied. Total rules applied 172 place count 172 transition count 214
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 184 place count 160 transition count 214
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 211 place count 133 transition count 187
Iterating global reduction 3 with 27 rules applied. Total rules applied 238 place count 133 transition count 187
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 251 place count 120 transition count 174
Iterating global reduction 3 with 13 rules applied. Total rules applied 264 place count 120 transition count 174
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 277 place count 107 transition count 161
Iterating global reduction 3 with 13 rules applied. Total rules applied 290 place count 107 transition count 161
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 304 place count 93 transition count 147
Iterating global reduction 3 with 14 rules applied. Total rules applied 318 place count 93 transition count 147
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 338 place count 73 transition count 127
Iterating global reduction 3 with 20 rules applied. Total rules applied 358 place count 73 transition count 127
Applied a total of 358 rules in 14 ms. Remains 73 /264 variables (removed 191) and now considering 127/294 (removed 167) transitions.
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 76 transitions (discarded 51 similar events)
// Phase 1: matrix 76 rows 73 cols
[2023-03-22 04:09:22] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants in 37 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/264 places, 127/294 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 70 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 125
Applied a total of 4 rules in 1 ms. Remains 70 /72 variables (removed 2) and now considering 125/127 (removed 2) transitions.
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 73 transitions (discarded 52 similar events)
// Phase 1: matrix 73 rows 70 cols
[2023-03-22 04:09:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 04:09:22] [INFO ] Flow matrix only has 73 transitions (discarded 52 similar events)
[2023-03-22 04:09:22] [INFO ] Invariant cache hit.
[2023-03-22 04:09:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 70/264 places, 125/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 70/264 places, 125/294 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), true, (NOT p2), p1]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s39 s60), p1:(GT s22 s56), p2:(LEQ s31 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 2 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-07 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Graph (complete) has 600 edges and 264 vertex of which 250 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 250 transition count 237
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 195 transition count 237
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 111 place count 195 transition count 220
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 145 place count 178 transition count 220
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 170 place count 153 transition count 195
Iterating global reduction 2 with 25 rules applied. Total rules applied 195 place count 153 transition count 195
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 206 place count 142 transition count 184
Iterating global reduction 2 with 11 rules applied. Total rules applied 217 place count 142 transition count 184
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 141 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 218 place count 141 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 139 transition count 182
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 232 place count 129 transition count 172
Iterating global reduction 3 with 10 rules applied. Total rules applied 242 place count 129 transition count 172
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 246 place count 125 transition count 172
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 246 place count 125 transition count 168
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 254 place count 121 transition count 168
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 259 place count 116 transition count 163
Iterating global reduction 4 with 5 rules applied. Total rules applied 264 place count 116 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 268 place count 112 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 272 place count 112 transition count 159
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 274 place count 110 transition count 157
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 110 transition count 157
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 328 place count 84 transition count 131
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 337 place count 75 transition count 122
Iterating global reduction 4 with 9 rules applied. Total rules applied 346 place count 75 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 346 place count 75 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 348 place count 74 transition count 121
Applied a total of 348 rules in 37 ms. Remains 74 /264 variables (removed 190) and now considering 121/294 (removed 173) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 98 transitions (discarded 23 similar events)
// Phase 1: matrix 98 rows 74 cols
[2023-03-22 04:09:23] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants in 56 ms returned [2, 4, 11, 17, 22, 24, 30, 34, 37, 43, 46, 49, 55]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 58 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/264 places, 121/294 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 48 transition count 108
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 48 transition count 108
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 38 transition count 98
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 38 transition count 98
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 28 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 28 transition count 88
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 70 place count 26 transition count 86
Applied a total of 70 rules in 9 ms. Remains 26 /61 variables (removed 35) and now considering 86/121 (removed 35) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 24 transitions (discarded 62 similar events)
// Phase 1: matrix 24 rows 26 cols
[2023-03-22 04:09:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 24 transitions (discarded 62 similar events)
[2023-03-22 04:09:23] [INFO ] Invariant cache hit.
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/264 places, 86/294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 26/264 places, 86/294 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-08 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 s6 s25)], 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 11 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-08 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 253 transition count 294
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 47 place count 217 transition count 258
Iterating global reduction 1 with 36 rules applied. Total rules applied 83 place count 217 transition count 258
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 113 place count 187 transition count 228
Iterating global reduction 1 with 30 rules applied. Total rules applied 143 place count 187 transition count 228
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 145 place count 185 transition count 228
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 168 place count 162 transition count 205
Iterating global reduction 2 with 23 rules applied. Total rules applied 191 place count 162 transition count 205
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 204 place count 149 transition count 205
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 235 place count 118 transition count 174
Iterating global reduction 3 with 31 rules applied. Total rules applied 266 place count 118 transition count 174
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 280 place count 104 transition count 160
Iterating global reduction 3 with 14 rules applied. Total rules applied 294 place count 104 transition count 160
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 307 place count 91 transition count 147
Iterating global reduction 3 with 13 rules applied. Total rules applied 320 place count 91 transition count 147
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 334 place count 77 transition count 133
Iterating global reduction 3 with 14 rules applied. Total rules applied 348 place count 77 transition count 133
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 368 place count 57 transition count 113
Iterating global reduction 3 with 20 rules applied. Total rules applied 388 place count 57 transition count 113
Applied a total of 388 rules in 13 ms. Remains 57 /264 variables (removed 207) and now considering 113/294 (removed 181) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 62 transitions (discarded 51 similar events)
// Phase 1: matrix 62 rows 57 cols
[2023-03-22 04:09:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants in 43 ms returned [37, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/264 places, 113/294 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 50 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 50 transition count 108
Applied a total of 10 rules in 1 ms. Remains 50 /55 variables (removed 5) and now considering 108/113 (removed 5) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 50 cols
[2023-03-22 04:09:23] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
[2023-03-22 04:09:23] [INFO ] Invariant cache hit.
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/264 places, 108/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 50/264 places, 108/294 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s32 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 1 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-09 finished in 228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p1)&&X(X(G(p2))))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 253 transition count 294
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 45 place count 219 transition count 260
Iterating global reduction 1 with 34 rules applied. Total rules applied 79 place count 219 transition count 260
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 108 place count 190 transition count 231
Iterating global reduction 1 with 29 rules applied. Total rules applied 137 place count 190 transition count 231
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 188 transition count 231
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 161 place count 166 transition count 209
Iterating global reduction 2 with 22 rules applied. Total rules applied 183 place count 166 transition count 209
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 194 place count 155 transition count 209
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 222 place count 127 transition count 181
Iterating global reduction 3 with 28 rules applied. Total rules applied 250 place count 127 transition count 181
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 262 place count 115 transition count 169
Iterating global reduction 3 with 12 rules applied. Total rules applied 274 place count 115 transition count 169
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 286 place count 103 transition count 157
Iterating global reduction 3 with 12 rules applied. Total rules applied 298 place count 103 transition count 157
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 311 place count 90 transition count 144
Iterating global reduction 3 with 13 rules applied. Total rules applied 324 place count 90 transition count 144
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 341 place count 73 transition count 127
Iterating global reduction 3 with 17 rules applied. Total rules applied 358 place count 73 transition count 127
Applied a total of 358 rules in 16 ms. Remains 73 /264 variables (removed 191) and now considering 127/294 (removed 167) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 81 transitions (discarded 46 similar events)
// Phase 1: matrix 81 rows 73 cols
[2023-03-22 04:09:23] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants in 39 ms returned [34, 42, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/264 places, 127/294 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 116
Applied a total of 22 rules in 2 ms. Remains 59 /70 variables (removed 11) and now considering 116/127 (removed 11) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 66 transitions (discarded 50 similar events)
// Phase 1: matrix 66 rows 59 cols
[2023-03-22 04:09:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 66 transitions (discarded 50 similar events)
[2023-03-22 04:09:23] [INFO ] Invariant cache hit.
[2023-03-22 04:09:23] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/264 places, 116/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 59/264 places, 116/294 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 4}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 1 s26), p0:(LEQ 1 s41), p2:(GT s10 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-12 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(p1)||G(p2)))))'
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 294/294 transitions.
Graph (complete) has 600 edges and 264 vertex of which 252 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 252 transition count 237
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 115 place count 197 transition count 233
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 193 transition count 233
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 119 place count 193 transition count 215
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 155 place count 175 transition count 215
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 171 place count 159 transition count 199
Iterating global reduction 3 with 16 rules applied. Total rules applied 187 place count 159 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 191 place count 155 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 195 place count 155 transition count 195
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 275 place count 115 transition count 155
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 288 place count 102 transition count 142
Iterating global reduction 3 with 13 rules applied. Total rules applied 301 place count 102 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 301 place count 102 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 101 transition count 141
Applied a total of 303 rules in 26 ms. Remains 101 /264 variables (removed 163) and now considering 141/294 (removed 153) transitions.
[2023-03-22 04:09:23] [INFO ] Flow matrix only has 138 transitions (discarded 3 similar events)
// Phase 1: matrix 138 rows 101 cols
[2023-03-22 04:09:23] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 04:09:24] [INFO ] Implicit Places using invariants in 61 ms returned [2, 6, 13, 24, 30, 32, 38, 42, 49, 59, 65, 69, 75, 77]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 62 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/264 places, 141/294 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 76 transition count 130
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 76 transition count 130
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 65 transition count 119
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 65 transition count 119
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 55 transition count 109
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 55 transition count 109
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 50 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 49 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 49 transition count 103
Applied a total of 76 rules in 6 ms. Remains 49 /87 variables (removed 38) and now considering 103/141 (removed 38) transitions.
[2023-03-22 04:09:24] [INFO ] Flow matrix only has 56 transitions (discarded 47 similar events)
// Phase 1: matrix 56 rows 49 cols
[2023-03-22 04:09:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:09:24] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 04:09:24] [INFO ] Flow matrix only has 56 transitions (discarded 47 similar events)
[2023-03-22 04:09:24] [INFO ] Invariant cache hit.
[2023-03-22 04:09:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/264 places, 103/294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 49/264 places, 103/294 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=0 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p0, acceptance={1, 2} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={2} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={2} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s14 s34), p1:(LEQ s3 s25), p2:(LEQ s30 s37)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 47 steps with 3 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-15 finished in 496 ms.
All properties solved by simple procedures.
Total runtime 9066 ms.
ITS solved all properties within timeout
BK_STOP 1679458165638
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-S08C3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is LeafsetExtension-PT-S08C3, 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 r231-tall-167856416100459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S08C3.tgz
mv LeafsetExtension-PT-S08C3 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 ;