fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281900228
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DBSingleClientW-PT-d1m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1744.096 25159.00 56736.00 100.10 FFFFFFFFFTFFFTFF normal

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.r312-tall-165472281900228.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 DBSingleClientW-PT-d1m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281900228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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 DBSingleClientW-PT-d1m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654779466736

Running Version 202205111006
[2022-06-09 12:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-06-09 12:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:57:48] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2022-06-09 12:57:48] [INFO ] Transformed 1440 places.
[2022-06-09 12:57:48] [INFO ] Transformed 672 transitions.
[2022-06-09 12:57:48] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 185 place count 242 transition count 399
Iterating global reduction 1 with 84 rules applied. Total rules applied 269 place count 242 transition count 399
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 277 place count 242 transition count 391
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 342 place count 177 transition count 326
Iterating global reduction 2 with 65 rules applied. Total rules applied 407 place count 177 transition count 326
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 411 place count 177 transition count 322
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 439 place count 149 transition count 280
Iterating global reduction 3 with 28 rules applied. Total rules applied 467 place count 149 transition count 280
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 489 place count 149 transition count 258
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 495 place count 143 transition count 248
Iterating global reduction 4 with 6 rules applied. Total rules applied 501 place count 143 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 505 place count 143 transition count 244
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 507 place count 141 transition count 242
Iterating global reduction 5 with 2 rules applied. Total rules applied 509 place count 141 transition count 242
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 511 place count 139 transition count 240
Iterating global reduction 5 with 2 rules applied. Total rules applied 513 place count 139 transition count 240
Applied a total of 513 rules in 79 ms. Remains 139 /347 variables (removed 208) and now considering 240/672 (removed 432) transitions.
// Phase 1: matrix 240 rows 139 cols
[2022-06-09 12:57:48] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 12:57:48] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 240 rows 139 cols
[2022-06-09 12:57:48] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:57:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-06-09 12:57:49] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 139 cols
[2022-06-09 12:57:49] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:57:49] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/347 places, 240/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/347 places, 240/672 transitions.
Support contains 30 out of 139 places after structural reductions.
[2022-06-09 12:57:49] [INFO ] Flatten gal took : 46 ms
[2022-06-09 12:57:49] [INFO ] Flatten gal took : 20 ms
[2022-06-09 12:57:49] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 154 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1000 steps, including 150 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 120 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 240 rows 139 cols
[2022-06-09 12:57:50] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:57:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:57:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 12:57:50] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2022-06-09 12:57:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:57:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:57:51] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2022-06-09 12:57:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-06-09 12:57:52] [INFO ] After 770ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :1 sat :16
[2022-06-09 12:57:52] [INFO ] After 1565ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 559 ms.
[2022-06-09 12:57:53] [INFO ] After 2698ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 1 properties in 181 ms.
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 134 transition count 229
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 134 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 134 transition count 228
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 129 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 129 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 129 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 128 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 128 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 127 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 127 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 126 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 126 transition count 217
Applied a total of 28 rules in 36 ms. Remains 126 /139 variables (removed 13) and now considering 217/240 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/139 places, 217/240 transitions.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 152 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Finished probabilistic random walk after 5581 steps, run visited all 15 properties in 82 ms. (steps per millisecond=68 )
Probabilistic random walk after 5581 steps, saw 2584 distinct states, run finished after 82 ms. (steps per millisecond=68 ) properties seen :15
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 120 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 120 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 120 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 106 transition count 157
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 106 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 106 transition count 152
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 95 transition count 132
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 95 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 95 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 109 place count 89 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 115 place count 89 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 89 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 122 place count 85 transition count 111
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 85 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 84 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 84 transition count 107
Applied a total of 131 rules in 14 ms. Remains 84 /139 variables (removed 55) and now considering 107/240 (removed 133) transitions.
// Phase 1: matrix 107 rows 84 cols
[2022-06-09 12:57:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:57:54] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 107 rows 84 cols
[2022-06-09 12:57:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:57:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 12:57:54] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 84 cols
[2022-06-09 12:57:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:54] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/139 places, 107/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/139 places, 107/240 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-00 finished in 493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(p0)))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 120 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 120 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 120 transition count 174
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 107 transition count 156
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 107 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 107 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 97 transition count 136
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 97 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 97 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 92 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 92 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 88 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 88 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 87 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 87 transition count 114
Applied a total of 120 rules in 48 ms. Remains 87 /139 variables (removed 52) and now considering 114/240 (removed 126) transitions.
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:55] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:57:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:57:55] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-06-09 12:57:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:57:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/139 places, 114/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/139 places, 114/240 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(G(X(p0)))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 119 transition count 175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 119 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 119 transition count 169
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 105 transition count 150
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 105 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 105 transition count 146
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 95 transition count 128
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 95 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 95 transition count 126
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 90 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 90 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 113 place count 90 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 87 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 87 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 86 transition count 108
Applied a total of 122 rules in 26 ms. Remains 86 /139 variables (removed 53) and now considering 108/240 (removed 132) transitions.
// Phase 1: matrix 108 rows 86 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:55] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 108 rows 86 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 12:57:55] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2022-06-09 12:57:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 86 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:55] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/139 places, 108/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/139 places, 108/240 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s74 1))], 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(p1 U p2))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 183
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 122 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 110 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 110 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 110 transition count 160
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 102 transition count 143
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 102 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 102 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 98 transition count 135
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 98 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 98 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 95 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 95 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 95 transition count 127
Applied a total of 104 rules in 22 ms. Remains 95 /139 variables (removed 44) and now considering 127/240 (removed 113) transitions.
// Phase 1: matrix 127 rows 95 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:55] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 127 rows 95 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:57:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 12:57:55] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-06-09 12:57:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 127 rows 95 cols
[2022-06-09 12:57:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:56] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/139 places, 127/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/139 places, 127/240 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s88 1)), p1:(AND (GEQ s2 1) (GEQ s90 1)), p0:(AND (GEQ s35 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-03 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F((p1 U p2))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 189
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 122 transition count 183
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 110 transition count 167
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 110 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 69 place count 110 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 100 transition count 143
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 100 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 100 transition count 140
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 95 transition count 134
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 95 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 95 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 92 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 92 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 114 place count 92 transition count 124
Applied a total of 114 rules in 14 ms. Remains 92 /139 variables (removed 47) and now considering 124/240 (removed 116) transitions.
// Phase 1: matrix 124 rows 92 cols
[2022-06-09 12:57:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:56] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 124 rows 92 cols
[2022-06-09 12:57:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:56] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-09 12:57:56] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 92 cols
[2022-06-09 12:57:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/139 places, 124/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/139 places, 124/240 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s64 1)), p2:(OR (NOT (AND (GEQ s1 1) (GEQ s42 1))) (AND (GEQ s1 1) (GEQ s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 190
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 122 transition count 183
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 109 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 109 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 109 transition count 160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 99 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 99 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 99 transition count 140
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 94 transition count 131
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 94 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 108 place count 94 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 91 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 91 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 91 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 90 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 90 transition count 121
Applied a total of 117 rules in 15 ms. Remains 90 /139 variables (removed 49) and now considering 121/240 (removed 119) transitions.
// Phase 1: matrix 121 rows 90 cols
[2022-06-09 12:57:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:56] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 121 rows 90 cols
[2022-06-09 12:57:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:57:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:57:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 121 rows 90 cols
[2022-06-09 12:57:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:57:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/139 places, 121/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/139 places, 121/240 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s62 1)) (AND (GEQ s2 1) (GEQ s88 1))), p1:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 DBSingleClientW-PT-d1m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||F((X(F(G(F(G(X(p2))))))&&p1)))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 182
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 42 place count 122 transition count 174
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 111 transition count 159
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 111 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 111 transition count 156
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 102 transition count 144
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 102 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 102 transition count 142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 97 transition count 133
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 97 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 101 place count 97 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 95 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 95 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 95 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 94 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 94 transition count 125
Applied a total of 108 rules in 29 ms. Remains 94 /139 variables (removed 45) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 94 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 125 rows 94 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 12:57:57] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-06-09 12:57:57] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 94 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/139 places, 125/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/139 places, 125/240 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s36 1)), p2:(AND (GEQ s1 1) (GEQ s89 1)), p1:(AND (GEQ s18 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 119 transition count 175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 119 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 119 transition count 169
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 105 transition count 150
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 105 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 105 transition count 146
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 94 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 94 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 94 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 89 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 89 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 119 place count 86 transition count 107
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 86 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 85 transition count 105
Applied a total of 125 rules in 11 ms. Remains 85 /139 variables (removed 54) and now considering 105/240 (removed 135) transitions.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:57:57] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:57:57] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/139 places, 105/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/139 places, 105/240 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s73 1))], 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 2155 steps with 512 reset in 23 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(((p0 U F(p1))&&X(p0))))))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 120 transition count 178
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 120 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 120 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 107 transition count 154
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 107 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 107 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 97 transition count 131
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 97 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 97 transition count 128
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 92 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 92 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 92 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 89 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 119 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 120 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 88 transition count 109
Applied a total of 121 rules in 25 ms. Remains 88 /139 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 88 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 109 rows 88 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:57] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:57:57] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-06-09 12:57:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 109 rows 88 cols
[2022-06-09 12:57:57] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:57:57] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/139 places, 109/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/139 places, 109/240 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1)), p1:(AND (GEQ s8 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||((F(p2)||X(p3)) U X(X(p1)))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 122 transition count 186
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 122 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 122 transition count 180
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 111 transition count 164
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 111 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 111 transition count 161
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 102 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 102 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 102 transition count 140
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 91 place count 97 transition count 134
Iterating global reduction 3 with 5 rules applied. Total rules applied 96 place count 97 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 97 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 94 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 94 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 94 transition count 124
Applied a total of 108 rules in 7 ms. Remains 94 /139 variables (removed 45) and now considering 124/240 (removed 116) transitions.
// Phase 1: matrix 124 rows 94 cols
[2022-06-09 12:57:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:58] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 124 rows 94 cols
[2022-06-09 12:57:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:57:58] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 94 cols
[2022-06-09 12:57:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:58] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/139 places, 124/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/139 places, 124/240 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p1), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}, { cond=true, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s75 1)), p0:(AND (GEQ s1 1) (GEQ s87 1)), p2:(AND (GEQ s1 1) (GEQ s77 1)), p3:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-11 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 120 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 120 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 120 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 107 transition count 154
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 107 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 76 place count 107 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 97 transition count 132
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 97 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 97 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 103 place count 92 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 108 place count 92 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 112 place count 92 transition count 117
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 89 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 89 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 88 transition count 110
Applied a total of 122 rules in 11 ms. Remains 88 /139 variables (removed 51) and now considering 110/240 (removed 130) transitions.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:57:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:57:58] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:57:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:57:58] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:57:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:57:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/139 places, 110/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/139 places, 110/240 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s83 1))], 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]]
Product exploration explored 100000 steps with 22956 reset in 180 ms.
Product exploration explored 100000 steps with 23045 reset in 182 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17476 steps, run visited all 1 properties in 60 ms. (steps per millisecond=291 )
Probabilistic random walk after 17476 steps, saw 8350 distinct states, run finished after 60 ms. (steps per millisecond=291 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:58:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:58:00] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:58:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:58:00] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:58:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:58:00] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17476 steps, run visited all 1 properties in 67 ms. (steps per millisecond=260 )
Probabilistic random walk after 17476 steps, saw 8350 distinct states, run finished after 67 ms. (steps per millisecond=260 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22986 reset in 160 ms.
Product exploration explored 100000 steps with 22808 reset in 179 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2022-06-09 12:58:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 88 cols
[2022-06-09 12:58:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:01] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 110/110 transitions.
Product exploration explored 100000 steps with 22929 reset in 287 ms.
Product exploration explored 100000 steps with 23058 reset in 240 ms.
Built C files in :
/tmp/ltsmin3233523385843888710
[2022-06-09 12:58:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3233523385843888710
Running compilation step : cd /tmp/ltsmin3233523385843888710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin3233523385843888710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3233523385843888710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15816693530563676746.hoa' '--buchi-type=spotba'
LTSmin run took 447 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-12 finished in 4263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 121 transition count 178
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 121 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 121 transition count 174
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 107 transition count 155
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 107 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 107 transition count 151
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 97 transition count 137
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 97 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 97 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 91 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 91 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 91 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 87 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 87 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 121 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 86 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 86 transition count 112
Applied a total of 123 rules in 12 ms. Remains 86 /139 variables (removed 53) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 86 cols
[2022-06-09 12:58:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:58:03] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 112 rows 86 cols
[2022-06-09 12:58:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 12:58:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 86 cols
[2022-06-09 12:58:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:03] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/139 places, 112/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/139 places, 112/240 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s43 1)), p1:(OR (LT s1 1) (LT s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Product exploration explored 100000 steps with 33333 reset in 179 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-13 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(X(p0)))||X(!p0)))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 120 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 120 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 120 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 106 transition count 153
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 106 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 106 transition count 149
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 85 place count 96 transition count 135
Iterating global reduction 2 with 10 rules applied. Total rules applied 95 place count 96 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 96 transition count 132
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 90 transition count 122
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 90 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 113 place count 90 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 117 place count 86 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 124 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 85 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 85 transition count 110
Applied a total of 126 rules in 28 ms. Remains 85 /139 variables (removed 54) and now considering 110/240 (removed 130) transitions.
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:58:03] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:58:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:58:04] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:58:04] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/139 places, 110/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/139 places, 110/240 transitions.
Stuttering acceptance computed with spot in 177 ms :[false, false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22940 reset in 191 ms.
Product exploration explored 100000 steps with 22955 reset in 168 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 158 ms :[false, false, false, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5126 steps, run visited all 1 properties in 13 ms. (steps per millisecond=394 )
Probabilistic random walk after 5126 steps, saw 2434 distinct states, run finished after 13 ms. (steps per millisecond=394 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 187 ms :[false, false, false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[false, false, false, (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:58:05] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:58:05] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:05] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 178 ms :[false, false, false, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5126 steps, run visited all 1 properties in 12 ms. (steps per millisecond=427 )
Probabilistic random walk after 5126 steps, saw 2434 distinct states, run finished after 12 ms. (steps per millisecond=427 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 164 ms :[false, false, false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[false, false, false, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[false, false, false, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23037 reset in 114 ms.
Product exploration explored 100000 steps with 22908 reset in 113 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[false, false, false, (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2022-06-09 12:58:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:58:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:58:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 110/110 transitions.
Product exploration explored 100000 steps with 22959 reset in 225 ms.
Product exploration explored 100000 steps with 23002 reset in 236 ms.
Built C files in :
/tmp/ltsmin11332494454182953177
[2022-06-09 12:58:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11332494454182953177
Running compilation step : cd /tmp/ltsmin11332494454182953177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin11332494454182953177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11332494454182953177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3714381907290187885.hoa' '--buchi-type=spotba'
LTSmin run took 3563 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 7690 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 119 transition count 175
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 119 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 119 transition count 169
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 106 transition count 152
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 106 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 76 place count 106 transition count 148
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 87 place count 95 transition count 128
Iterating global reduction 2 with 11 rules applied. Total rules applied 98 place count 95 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 95 transition count 125
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 89 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 89 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 89 transition count 112
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 120 place count 85 transition count 107
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 85 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 127 place count 85 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 84 transition count 103
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 84 transition count 103
Applied a total of 129 rules in 16 ms. Remains 84 /139 variables (removed 55) and now considering 103/240 (removed 137) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:58:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:58:11] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:58:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 12:58:11] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-06-09 12:58:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:58:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:58:11] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/139 places, 103/240 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/139 places, 103/240 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1))], 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 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 257 ms.
All properties solved by simple procedures.
Total runtime 23869 ms.

BK_STOP 1654779491895

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="DBSingleClientW-PT-d1m09"
export BK_EXAMINATION="LTLFireability"
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 DBSingleClientW-PT-d1m09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472281900228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m09.tgz
mv DBSingleClientW-PT-d1m09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;