Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820900459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r132-tall-165271820900459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 11K Apr 29 12:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 12:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 12:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 12:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 254K May 10 09:34 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 1652792132758

Running Version 202205111006
[2022-05-17 12:55:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 12:55:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 12:55:34] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-05-17 12:55:34] [INFO ] Transformed 462 places.
[2022-05-17 12:55:34] [INFO ] Transformed 409 transitions.
[2022-05-17 12:55:34] [INFO ] Parsed PT model containing 462 places and 409 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 384 transition count 409
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 136 place count 326 transition count 351
Iterating global reduction 1 with 58 rules applied. Total rules applied 194 place count 326 transition count 351
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 229 place count 291 transition count 316
Iterating global reduction 1 with 35 rules applied. Total rules applied 264 place count 291 transition count 316
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 295 place count 260 transition count 285
Iterating global reduction 1 with 31 rules applied. Total rules applied 326 place count 260 transition count 285
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 330 place count 256 transition count 285
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 332 place count 254 transition count 283
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 254 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 335 place count 253 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 253 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 252 transition count 281
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 252 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 251 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 251 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 344 place count 247 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 348 place count 247 transition count 276
Applied a total of 348 rules in 118 ms. Remains 247 /462 variables (removed 215) and now considering 276/409 (removed 133) transitions.
[2022-05-17 12:55:34] [INFO ] Flow matrix only has 272 transitions (discarded 4 similar events)
// Phase 1: matrix 272 rows 247 cols
[2022-05-17 12:55:34] [INFO ] Computed 26 place invariants in 21 ms
[2022-05-17 12:55:34] [INFO ] Implicit Places using invariants in 290 ms returned [10, 22, 44, 48, 68, 102, 104, 151, 198]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 316 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/462 places, 276/409 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 223 transition count 261
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 223 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 221 transition count 259
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 221 transition count 259
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 219 transition count 257
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 219 transition count 257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 217 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 217 transition count 255
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 214 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 214 transition count 252
Applied a total of 48 rules in 19 ms. Remains 214 /238 variables (removed 24) and now considering 252/276 (removed 24) transitions.
[2022-05-17 12:55:34] [INFO ] Flow matrix only has 244 transitions (discarded 8 similar events)
// Phase 1: matrix 244 rows 214 cols
[2022-05-17 12:55:34] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 12:55:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-17 12:55:34] [INFO ] Flow matrix only has 244 transitions (discarded 8 similar events)
// Phase 1: matrix 244 rows 214 cols
[2022-05-17 12:55:34] [INFO ] Computed 17 place invariants in 8 ms
[2022-05-17 12:55:34] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 214/462 places, 252/409 transitions.
Finished structural reductions, in 2 iterations. Remains : 214/462 places, 252/409 transitions.
Support contains 41 out of 214 places after structural reductions.
[2022-05-17 12:55:35] [INFO ] Flatten gal took : 46 ms
[2022-05-17 12:55:35] [INFO ] Flatten gal took : 19 ms
[2022-05-17 12:55:35] [INFO ] Input system was already deterministic with 252 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-17 12:55:36] [INFO ] Flow matrix only has 244 transitions (discarded 8 similar events)
// Phase 1: matrix 244 rows 214 cols
[2022-05-17 12:55:36] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 12:55:36] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-17 12:55:36] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 214 stabilizing places and 252 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 214 transition count 252
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-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U G(p1)) U X((X(p0) U p2))))'
Support contains 6 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 208 transition count 252
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 185 transition count 229
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 185 transition count 229
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 165 transition count 209
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 165 transition count 209
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 163 transition count 209
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 109 place count 148 transition count 194
Iterating global reduction 2 with 15 rules applied. Total rules applied 124 place count 148 transition count 194
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 142 transition count 194
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 146 place count 126 transition count 178
Iterating global reduction 3 with 16 rules applied. Total rules applied 162 place count 126 transition count 178
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 170 place count 118 transition count 170
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 118 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 186 place count 110 transition count 162
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 110 transition count 162
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 205 place count 99 transition count 151
Iterating global reduction 3 with 11 rules applied. Total rules applied 216 place count 99 transition count 151
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 229 place count 86 transition count 138
Iterating global reduction 3 with 13 rules applied. Total rules applied 242 place count 86 transition count 138
Applied a total of 242 rules in 22 ms. Remains 86 /214 variables (removed 128) and now considering 138/252 (removed 114) transitions.
[2022-05-17 12:55:37] [INFO ] Flow matrix only has 96 transitions (discarded 42 similar events)
// Phase 1: matrix 96 rows 86 cols
[2022-05-17 12:55:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 12:55:37] [INFO ] Implicit Places using invariants in 53 ms returned [33, 47, 56, 74]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/214 places, 138/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 129
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 72 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 72 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 71 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 71 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 70 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 70 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 69 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 69 transition count 125
Applied a total of 26 rules in 5 ms. Remains 69 /82 variables (removed 13) and now considering 125/138 (removed 13) transitions.
[2022-05-17 12:55:37] [INFO ] Flow matrix only has 79 transitions (discarded 46 similar events)
// Phase 1: matrix 79 rows 69 cols
[2022-05-17 12:55:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 12:55:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-05-17 12:55:37] [INFO ] Flow matrix only has 79 transitions (discarded 46 similar events)
// Phase 1: matrix 79 rows 69 cols
[2022-05-17 12:55:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 12:55:37] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 69/214 places, 125/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 69/214 places, 125/252 transitions.
Stuttering acceptance computed with spot in 470 ms :[true, p2, (AND p0 p2), (AND p1 p2), p2, p2, p1, p2, (OR (AND p0 p2) (AND p1 p2)), (OR (AND p0 p2) (AND p1 p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 2}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}]], initial=1, aps=[p0:(LEQ s55 s18), p1:(LEQ s26 s63), p2:(AND (LEQ s26 s63) (LEQ s41 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-01 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!X(!X(p0)) U F(X(F(X(G(p1))))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Graph (complete) has 519 edges and 214 vertex of which 207 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 207 transition count 211
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 167 transition count 211
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 81 place count 167 transition count 194
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 115 place count 150 transition count 194
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 129 place count 136 transition count 180
Iterating global reduction 2 with 14 rules applied. Total rules applied 143 place count 136 transition count 180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 133 transition count 177
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 133 transition count 177
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 132 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 150 place count 132 transition count 176
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 152 place count 131 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 130 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 130 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 129 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 129 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 128 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 128 transition count 173
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 222 place count 96 transition count 141
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 234 place count 84 transition count 129
Iterating global reduction 3 with 12 rules applied. Total rules applied 246 place count 84 transition count 129
Applied a total of 246 rules in 59 ms. Remains 84 /214 variables (removed 130) and now considering 129/252 (removed 123) transitions.
[2022-05-17 12:55:37] [INFO ] Flow matrix only has 114 transitions (discarded 15 similar events)
// Phase 1: matrix 114 rows 84 cols
[2022-05-17 12:55:37] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 59 ms returned [9, 18, 30, 33, 35, 37, 44, 46, 51, 54, 60, 62, 67]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 61 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/214 places, 129/252 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 56 transition count 114
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 56 transition count 114
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 48 transition count 106
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 48 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 44 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 44 transition count 102
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 35 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 33 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 33 transition count 91
Applied a total of 76 rules in 10 ms. Remains 33 /71 variables (removed 38) and now considering 91/129 (removed 38) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 37 transitions (discarded 54 similar events)
// Phase 1: matrix 37 rows 33 cols
[2022-05-17 12:55:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 37 transitions (discarded 54 similar events)
// Phase 1: matrix 37 rows 33 cols
[2022-05-17 12:55:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants and state equation in 45 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 : 33/214 places, 91/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 33/214 places, 91/252 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s14 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 90 steps with 7 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-03 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (p0 U G((F(p1)||p2)))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Graph (complete) has 519 edges and 214 vertex of which 208 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 208 transition count 215
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 172 transition count 215
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 73 place count 172 transition count 196
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 111 place count 153 transition count 196
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 126 place count 138 transition count 181
Iterating global reduction 2 with 15 rules applied. Total rules applied 141 place count 138 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 134 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 134 transition count 177
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 133 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 150 place count 133 transition count 176
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 152 place count 132 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 129 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 129 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 128 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 128 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 127 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 127 transition count 171
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 218 place count 99 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 227 place count 90 transition count 134
Iterating global reduction 3 with 9 rules applied. Total rules applied 236 place count 90 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 237 place count 89 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 89 transition count 133
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 88 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 87 transition count 132
Applied a total of 241 rules in 45 ms. Remains 87 /214 variables (removed 127) and now considering 132/252 (removed 120) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 113 transitions (discarded 19 similar events)
// Phase 1: matrix 113 rows 87 cols
[2022-05-17 12:55:38] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 70 ms returned [19, 36, 38, 40, 47, 56, 59, 67, 72]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 73 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/214 places, 132/252 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 67 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 67 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 63 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 63 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 61 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 61 transition count 115
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 54 place count 51 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 49 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 49 transition count 103
Applied a total of 58 rules in 11 ms. Remains 49 /78 variables (removed 29) and now considering 103/132 (removed 29) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 61 transitions (discarded 42 similar events)
// Phase 1: matrix 61 rows 49 cols
[2022-05-17 12:55:38] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 61 transitions (discarded 42 similar events)
// Phase 1: matrix 61 rows 49 cols
[2022-05-17 12:55:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/214 places, 103/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/214 places, 103/252 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 1 s18) (LEQ s23 s8) (LEQ s32 s39)), p2:(LEQ 1 s18), p1:(GT s32 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-05 finished in 460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(F(p1))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 207 transition count 252
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 33 place count 181 transition count 226
Iterating global reduction 1 with 26 rules applied. Total rules applied 59 place count 181 transition count 226
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 158 transition count 203
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 158 transition count 203
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 156 transition count 203
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 125 place count 138 transition count 185
Iterating global reduction 2 with 18 rules applied. Total rules applied 143 place count 138 transition count 185
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 153 place count 128 transition count 185
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 175 place count 106 transition count 163
Iterating global reduction 3 with 22 rules applied. Total rules applied 197 place count 106 transition count 163
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 209 place count 94 transition count 151
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 94 transition count 151
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 233 place count 82 transition count 139
Iterating global reduction 3 with 12 rules applied. Total rules applied 245 place count 82 transition count 139
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 260 place count 67 transition count 124
Iterating global reduction 3 with 15 rules applied. Total rules applied 275 place count 67 transition count 124
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 295 place count 47 transition count 104
Iterating global reduction 3 with 20 rules applied. Total rules applied 315 place count 47 transition count 104
Applied a total of 315 rules in 22 ms. Remains 47 /214 variables (removed 167) and now considering 104/252 (removed 148) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 47 transitions (discarded 57 similar events)
// Phase 1: matrix 47 rows 47 cols
[2022-05-17 12:55:38] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 34 ms returned [27, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/214 places, 104/252 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 41 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 100
Applied a total of 8 rules in 1 ms. Remains 41 /45 variables (removed 4) and now considering 100/104 (removed 4) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 42 transitions (discarded 58 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-17 12:55:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 42 transitions (discarded 58 similar events)
// Phase 1: matrix 42 rows 41 cols
[2022-05-17 12:55:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/214 places, 100/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/214 places, 100/252 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GT s18 s28) (LEQ s21 s33))], 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-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-08 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((G(F(G(p0)))||G(F(p0))||F(p0))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 207 transition count 252
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 32 place count 182 transition count 227
Iterating global reduction 1 with 25 rules applied. Total rules applied 57 place count 182 transition count 227
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 160 transition count 205
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 160 transition count 205
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 159 transition count 205
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 118 place count 143 transition count 189
Iterating global reduction 2 with 16 rules applied. Total rules applied 134 place count 143 transition count 189
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 143 place count 134 transition count 189
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 163 place count 114 transition count 169
Iterating global reduction 3 with 20 rules applied. Total rules applied 183 place count 114 transition count 169
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 193 place count 104 transition count 159
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 104 transition count 159
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 213 place count 94 transition count 149
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 94 transition count 149
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 235 place count 82 transition count 137
Iterating global reduction 3 with 12 rules applied. Total rules applied 247 place count 82 transition count 137
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 263 place count 66 transition count 121
Iterating global reduction 3 with 16 rules applied. Total rules applied 279 place count 66 transition count 121
Applied a total of 279 rules in 19 ms. Remains 66 /214 variables (removed 148) and now considering 121/252 (removed 131) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 70 transitions (discarded 51 similar events)
// Phase 1: matrix 70 rows 66 cols
[2022-05-17 12:55:38] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 12:55:38] [INFO ] Implicit Places using invariants in 47 ms returned [34, 40, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/214 places, 121/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 55 transition count 113
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 55 transition count 113
Applied a total of 16 rules in 1 ms. Remains 55 /63 variables (removed 8) and now considering 113/121 (removed 8) transitions.
[2022-05-17 12:55:38] [INFO ] Flow matrix only has 61 transitions (discarded 52 similar events)
// Phase 1: matrix 61 rows 55 cols
[2022-05-17 12:55:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:55:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-05-17 12:55:39] [INFO ] Flow matrix only has 61 transitions (discarded 52 similar events)
// Phase 1: matrix 61 rows 55 cols
[2022-05-17 12:55:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:55:39] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/214 places, 113/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/214 places, 113/252 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s40 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 256 ms.
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Computed a total of 55 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 113
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-10 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))||p1)))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 208 transition count 252
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 185 transition count 229
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 185 transition count 229
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 165 transition count 209
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 165 transition count 209
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 163 transition count 209
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 110 place count 147 transition count 193
Iterating global reduction 2 with 16 rules applied. Total rules applied 126 place count 147 transition count 193
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 134 place count 139 transition count 193
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 153 place count 120 transition count 174
Iterating global reduction 3 with 19 rules applied. Total rules applied 172 place count 120 transition count 174
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 182 place count 110 transition count 164
Iterating global reduction 3 with 10 rules applied. Total rules applied 192 place count 110 transition count 164
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 202 place count 100 transition count 154
Iterating global reduction 3 with 10 rules applied. Total rules applied 212 place count 100 transition count 154
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 225 place count 87 transition count 141
Iterating global reduction 3 with 13 rules applied. Total rules applied 238 place count 87 transition count 141
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 254 place count 71 transition count 125
Iterating global reduction 3 with 16 rules applied. Total rules applied 270 place count 71 transition count 125
Applied a total of 270 rules in 15 ms. Remains 71 /214 variables (removed 143) and now considering 125/252 (removed 127) transitions.
[2022-05-17 12:55:39] [INFO ] Flow matrix only has 74 transitions (discarded 51 similar events)
// Phase 1: matrix 74 rows 71 cols
[2022-05-17 12:55:39] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:55:39] [INFO ] Implicit Places using invariants in 48 ms returned [26, 55, 61]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/214 places, 125/252 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 119
Applied a total of 12 rules in 6 ms. Remains 62 /68 variables (removed 6) and now considering 119/125 (removed 6) transitions.
[2022-05-17 12:55:39] [INFO ] Flow matrix only has 67 transitions (discarded 52 similar events)
// Phase 1: matrix 67 rows 62 cols
[2022-05-17 12:55:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:55:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-17 12:55:39] [INFO ] Flow matrix only has 67 transitions (discarded 52 similar events)
// Phase 1: matrix 67 rows 62 cols
[2022-05-17 12:55:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:55:39] [INFO ] Implicit Places using invariants and state equation in 56 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 : 62/214 places, 119/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/214 places, 119/252 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s28 s41), p0:(OR (LEQ 1 s9) (LEQ 3 s37))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 27 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 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(!(X(p0) U true))||(false U X(p0))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 207 transition count 252
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 33 place count 181 transition count 226
Iterating global reduction 1 with 26 rules applied. Total rules applied 59 place count 181 transition count 226
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 158 transition count 203
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 158 transition count 203
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 156 transition count 203
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 124 place count 139 transition count 186
Iterating global reduction 2 with 17 rules applied. Total rules applied 141 place count 139 transition count 186
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 150 place count 130 transition count 186
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 170 place count 110 transition count 166
Iterating global reduction 3 with 20 rules applied. Total rules applied 190 place count 110 transition count 166
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 201 place count 99 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 212 place count 99 transition count 155
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 222 place count 89 transition count 145
Iterating global reduction 3 with 10 rules applied. Total rules applied 232 place count 89 transition count 145
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 245 place count 76 transition count 132
Iterating global reduction 3 with 13 rules applied. Total rules applied 258 place count 76 transition count 132
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 274 place count 60 transition count 116
Iterating global reduction 3 with 16 rules applied. Total rules applied 290 place count 60 transition count 116
Applied a total of 290 rules in 16 ms. Remains 60 /214 variables (removed 154) and now considering 116/252 (removed 136) transitions.
[2022-05-17 12:55:40] [INFO ] Flow matrix only has 65 transitions (discarded 51 similar events)
// Phase 1: matrix 65 rows 60 cols
[2022-05-17 12:55:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 12:55:40] [INFO ] Implicit Places using invariants in 51 ms returned [39, 45, 51]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/214 places, 116/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 49 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 49 transition count 108
Applied a total of 16 rules in 0 ms. Remains 49 /57 variables (removed 8) and now considering 108/116 (removed 8) transitions.
[2022-05-17 12:55:40] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 49 cols
[2022-05-17 12:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:55:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 12:55:40] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 49 cols
[2022-05-17 12:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:55:40] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/214 places, 108/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/214 places, 108/252 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s17 s29)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 239 steps with 9 reset in 6 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-14 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 252/252 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 207 transition count 252
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 32 place count 182 transition count 227
Iterating global reduction 1 with 25 rules applied. Total rules applied 57 place count 182 transition count 227
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 160 transition count 205
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 160 transition count 205
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 159 transition count 205
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 118 place count 143 transition count 189
Iterating global reduction 2 with 16 rules applied. Total rules applied 134 place count 143 transition count 189
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 143 place count 134 transition count 189
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 163 place count 114 transition count 169
Iterating global reduction 3 with 20 rules applied. Total rules applied 183 place count 114 transition count 169
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 193 place count 104 transition count 159
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 104 transition count 159
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 213 place count 94 transition count 149
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 94 transition count 149
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 234 place count 83 transition count 138
Iterating global reduction 3 with 11 rules applied. Total rules applied 245 place count 83 transition count 138
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 263 place count 65 transition count 120
Iterating global reduction 3 with 18 rules applied. Total rules applied 281 place count 65 transition count 120
Applied a total of 281 rules in 30 ms. Remains 65 /214 variables (removed 149) and now considering 120/252 (removed 132) transitions.
[2022-05-17 12:55:40] [INFO ] Flow matrix only has 69 transitions (discarded 51 similar events)
// Phase 1: matrix 69 rows 65 cols
[2022-05-17 12:55:40] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 12:55:40] [INFO ] Implicit Places using invariants in 44 ms returned [34, 41, 55]
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 : 62/214 places, 120/252 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 55 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 55 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 54 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 54 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 53 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 53 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 52 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 52 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 51 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 51 transition count 109
Applied a total of 22 rules in 4 ms. Remains 51 /62 variables (removed 11) and now considering 109/120 (removed 11) transitions.
[2022-05-17 12:55:40] [INFO ] Flow matrix only has 55 transitions (discarded 54 similar events)
// Phase 1: matrix 55 rows 51 cols
[2022-05-17 12:55:40] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 12:55:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-17 12:55:40] [INFO ] Flow matrix only has 55 transitions (discarded 54 similar events)
// Phase 1: matrix 55 rows 51 cols
[2022-05-17 12:55:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 12:55:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/214 places, 109/252 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/214 places, 109/252 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s25 s37), p0:(GT s19 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-15 finished in 334 ms.
All properties solved by simple procedures.
Total runtime 6749 ms.

BK_STOP 1652792141016

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r132-tall-165271820900459"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;