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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
297.884 18987.00 33275.00 926.50 FFFFFFTFFFFTFFTT 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-165472281900188.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-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281900188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 16K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:11 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-d1m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654776290622

Running Version 202205111006
[2022-06-09 12:04:51] [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:04:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:04:51] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-09 12:04:51] [INFO ] Transformed 1440 places.
[2022-06-09 12:04:52] [INFO ] Transformed 672 transitions.
[2022-06-09 12:04:52] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 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 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 417
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 417
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 267 place count 246 transition count 411
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 326 place count 187 transition count 352
Iterating global reduction 2 with 59 rules applied. Total rules applied 385 place count 187 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 388 place count 187 transition count 349
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 415 place count 160 transition count 313
Iterating global reduction 3 with 27 rules applied. Total rules applied 442 place count 160 transition count 313
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 475 place count 160 transition count 280
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 477 place count 158 transition count 276
Iterating global reduction 4 with 2 rules applied. Total rules applied 479 place count 158 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 480 place count 157 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 481 place count 157 transition count 275
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 482 place count 156 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 483 place count 156 transition count 274
Applied a total of 483 rules in 90 ms. Remains 156 /347 variables (removed 191) and now considering 274/672 (removed 398) transitions.
// Phase 1: matrix 274 rows 156 cols
[2022-06-09 12:04:52] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 12:04:52] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 274 rows 156 cols
[2022-06-09 12:04:52] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 12:04:53] [INFO ] State equation strengthened by 133 read => feed constraints.
[2022-06-09 12:04:53] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
// Phase 1: matrix 274 rows 156 cols
[2022-06-09 12:04:53] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 12:04:54] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/347 places, 274/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/347 places, 274/672 transitions.
Support contains 36 out of 156 places after structural reductions.
[2022-06-09 12:04:54] [INFO ] Flatten gal took : 48 ms
[2022-06-09 12:04:54] [INFO ] Flatten gal took : 23 ms
[2022-06-09 12:04:54] [INFO ] Input system was already deterministic with 274 transitions.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 30) seen :5
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :1
Running SMT prover for 24 properties.
// Phase 1: matrix 274 rows 156 cols
[2022-06-09 12:04:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:04:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:04:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 12:04:56] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:23
[2022-06-09 12:04:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:04:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:04:56] [INFO ] After 654ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2022-06-09 12:04:56] [INFO ] State equation strengthened by 133 read => feed constraints.
[2022-06-09 12:04:58] [INFO ] After 1179ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :1 sat :23
[2022-06-09 12:04:59] [INFO ] After 2380ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :23
Attempting to minimize the solution found.
Minimization took 1224 ms.
[2022-06-09 12:05:00] [INFO ] After 4448ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :23
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 413 ms.
Support contains 30 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 152 transition count 261
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 152 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 150 transition count 259
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 150 transition count 259
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 256
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 148 transition count 254
Applied a total of 18 rules in 51 ms. Remains 148 /156 variables (removed 8) and now considering 254/274 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/156 places, 254/274 transitions.
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 113 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Probably explored full state space saw : 35637 states, properties seen :21
Probabilistic random walk after 91930 steps, saw 35637 distinct states, run finished after 573 ms. (steps per millisecond=160 ) properties seen :21
Explored full state space saw : 35684 states, properties seen :0
Exhaustive walk after 91979 steps, saw 35684 distinct states, run finished after 404 ms. (steps per millisecond=227 ) properties seen :0
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 5 stable transitions
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(((!p0 U false)||G(p0)))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 132 transition count 193
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 132 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 132 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 117 transition count 168
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 117 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 117 transition count 164
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 99 place count 103 transition count 144
Iterating global reduction 2 with 14 rules applied. Total rules applied 113 place count 103 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 103 transition count 140
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 126 place count 94 transition count 125
Iterating global reduction 3 with 9 rules applied. Total rules applied 135 place count 94 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 139 place count 94 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 88 transition count 115
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 88 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 88 transition count 114
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 156 place count 84 transition count 105
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 84 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 163 place count 83 transition count 101
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 83 transition count 101
Applied a total of 164 rules in 45 ms. Remains 83 /156 variables (removed 73) and now considering 101/274 (removed 173) transitions.
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 12:05:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:05:03] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 12:05:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 12:05:03] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-06-09 12:05:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 83 cols
[2022-06-09 12:05:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:05:03] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/156 places, 101/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/156 places, 101/274 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s64 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 2 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-00 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))||X(G(X(G(p1))))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 133 transition count 200
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 133 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 133 transition count 196
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 118 transition count 174
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 84 place count 118 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 98 place count 104 transition count 150
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 104 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 104 transition count 146
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 95 transition count 131
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 95 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 138 place count 95 transition count 127
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 144 place count 89 transition count 121
Iterating global reduction 4 with 6 rules applied. Total rules applied 150 place count 89 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 86 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 86 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 159 place count 86 transition count 115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 85 transition count 113
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 85 transition count 113
Applied a total of 161 rules in 16 ms. Remains 85 /156 variables (removed 71) and now considering 113/274 (removed 161) transitions.
// Phase 1: matrix 113 rows 85 cols
[2022-06-09 12:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:05:04] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 113 rows 85 cols
[2022-06-09 12:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 12:05:04] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 113 rows 85 cols
[2022-06-09 12:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/156 places, 113/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/156 places, 113/274 transitions.
Stuttering acceptance computed with spot in 182 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-d1m04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s58 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 5 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-01 finished in 460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&X(p1)))&&X(p1)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 133 transition count 198
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 133 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 133 transition count 195
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 119 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 119 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 119 transition count 173
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 106 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 106 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 106 transition count 150
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 98 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 98 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 98 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 135 place count 92 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 141 place count 92 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 92 transition count 127
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 146 place count 88 transition count 118
Iterating global reduction 5 with 4 rules applied. Total rules applied 150 place count 88 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 152 place count 88 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 153 place count 87 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 154 place count 87 transition count 114
Applied a total of 154 rules in 15 ms. Remains 87 /156 variables (removed 69) and now considering 114/274 (removed 160) transitions.
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 12:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:04] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 12:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 12:05:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 87 cols
[2022-06-09 12:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:05:04] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/156 places, 114/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/156 places, 114/274 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s38 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-03 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U p1)&&G(X((p2 U X(G(p2))))))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 136 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 136 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 136 transition count 210
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 122 transition count 189
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 122 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 122 transition count 184
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 109 transition count 165
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 109 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 109 transition count 161
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 113 place count 101 transition count 148
Iterating global reduction 3 with 8 rules applied. Total rules applied 121 place count 101 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 125 place count 101 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 130 place count 96 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 135 place count 96 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 96 transition count 138
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 139 place count 93 transition count 130
Iterating global reduction 5 with 3 rules applied. Total rules applied 142 place count 93 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 92 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 92 transition count 128
Applied a total of 144 rules in 43 ms. Remains 92 /156 variables (removed 64) and now considering 128/274 (removed 146) transitions.
// Phase 1: matrix 128 rows 92 cols
[2022-06-09 12:05:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:05:05] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 128 rows 92 cols
[2022-06-09 12:05:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-09 12:05:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 92 cols
[2022-06-09 12:05:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:05] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/156 places, 128/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/156 places, 128/274 transitions.
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s62 1)), p0:(AND (GEQ s1 1) (GEQ s39 1) (GEQ s1 1) (GEQ s90 1)), p2:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-04 finished in 972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(X(G(p0)))||G(p0)))||(F(p2)&&p1))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 133 transition count 195
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 133 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 133 transition count 193
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 118 transition count 171
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 118 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 118 transition count 167
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 104 transition count 147
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 104 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 104 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 95 transition count 128
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 95 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 95 transition count 124
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 89 transition count 118
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 89 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 152 place count 86 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 155 place count 86 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 157 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 85 transition count 110
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 85 transition count 110
Applied a total of 159 rules in 9 ms. Remains 85 /156 variables (removed 71) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:05:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:06] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:05:06] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 85 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:05:06] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/156 places, 110/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/156 places, 110/274 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s44 1)), p2:(AND (GEQ s1 1) (GEQ s44 1)), p0:(OR (LT s1 1) (LT s35 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 18 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-07 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||!((G(p0)&&X(p1)) U !p2))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 135 transition count 200
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 135 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 135 transition count 197
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 122 transition count 179
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 122 transition count 179
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 122 transition count 175
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 86 place count 111 transition count 158
Iterating global reduction 2 with 11 rules applied. Total rules applied 97 place count 111 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 111 transition count 154
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 108 place count 104 transition count 144
Iterating global reduction 3 with 7 rules applied. Total rules applied 115 place count 104 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 104 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 123 place count 100 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 127 place count 100 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 100 transition count 135
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 98 transition count 133
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 98 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 98 transition count 132
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 97 transition count 130
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 97 transition count 130
Applied a total of 135 rules in 8 ms. Remains 97 /156 variables (removed 59) and now considering 130/274 (removed 144) transitions.
// Phase 1: matrix 130 rows 97 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:06] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 130 rows 97 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:05:06] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 130 rows 97 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:06] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/156 places, 130/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/156 places, 130/274 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s92 1)), p0:(AND (GEQ s28 1) (GEQ s38 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-d1m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-08 finished in 399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 133 transition count 195
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 133 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 133 transition count 193
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 118 transition count 171
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 118 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 118 transition count 167
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 104 transition count 147
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 104 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 104 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 95 transition count 128
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 95 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 95 transition count 124
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 89 transition count 118
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 89 transition count 117
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 153 place count 85 transition count 108
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 85 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 159 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 84 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 84 transition count 104
Applied a total of 161 rules in 22 ms. Remains 84 /156 variables (removed 72) and now considering 104/274 (removed 170) transitions.
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:05:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:05:06] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 12:05:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:05:07] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:05:07] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:05:07] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/156 places, 104/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/156 places, 104/274 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1)), p1:(AND (GEQ s1 1) (GEQ s81 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-09 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&X(p1)&&X(p2)))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 135 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 135 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 135 transition count 202
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 122 transition count 182
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 122 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 75 place count 122 transition count 179
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 87 place count 110 transition count 161
Iterating global reduction 2 with 12 rules applied. Total rules applied 99 place count 110 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 110 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 111 place count 102 transition count 146
Iterating global reduction 3 with 8 rules applied. Total rules applied 119 place count 102 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 102 transition count 142
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 128 place count 97 transition count 137
Iterating global reduction 4 with 5 rules applied. Total rules applied 133 place count 97 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 97 transition count 136
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 95 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 95 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 140 place count 95 transition count 132
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 141 place count 94 transition count 130
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 94 transition count 130
Applied a total of 142 rules in 6 ms. Remains 94 /156 variables (removed 62) and now considering 130/274 (removed 144) transitions.
// Phase 1: matrix 130 rows 94 cols
[2022-06-09 12:05:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:07] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 130 rows 94 cols
[2022-06-09 12:05:07] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 12:05:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 12:05:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 130 rows 94 cols
[2022-06-09 12:05:07] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:05:07] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/156 places, 130/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/156 places, 130/274 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s66 1)), p1:(OR (LT s1 1) (LT s89 1)), p2:(OR (LT s13 1) (LT s36 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]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-10 finished in 683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))&&F(!(G(F(p1)) U p0))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 134 transition count 206
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 134 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 134 transition count 200
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 120 transition count 179
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 120 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 120 transition count 175
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 95 place count 107 transition count 157
Iterating global reduction 2 with 13 rules applied. Total rules applied 108 place count 107 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 107 transition count 154
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 99 transition count 140
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 99 transition count 140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 133 place count 99 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 138 place count 94 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 143 place count 94 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 147 place count 90 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 151 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 153 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 89 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 89 transition count 116
Applied a total of 155 rules in 23 ms. Remains 89 /156 variables (removed 67) and now considering 116/274 (removed 158) transitions.
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:05:08] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:05:08] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:05:08] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 12:05:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 12:05:08] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-06-09 12:05:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:05:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/156 places, 116/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/156 places, 116/274 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), p0, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1)), p1:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-13 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(p1 U p2)||F(X(p3))||p0))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 274/274 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 136 transition count 205
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 136 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 136 transition count 202
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 123 transition count 182
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 123 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 123 transition count 179
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 111 transition count 161
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 111 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 111 transition count 158
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 107 place count 103 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 115 place count 103 transition count 145
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 103 transition count 142
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 124 place count 97 transition count 136
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 97 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 97 transition count 135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 135 place count 93 transition count 126
Iterating global reduction 5 with 4 rules applied. Total rules applied 139 place count 93 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 141 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 92 transition count 122
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 92 transition count 122
Applied a total of 143 rules in 10 ms. Remains 92 /156 variables (removed 64) and now considering 122/274 (removed 152) transitions.
// Phase 1: matrix 122 rows 92 cols
[2022-06-09 12:05:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:08] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 122 rows 92 cols
[2022-06-09 12:05:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:05:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 12:05:08] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 92 cols
[2022-06-09 12:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:05:08] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/156 places, 122/274 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/156 places, 122/274 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s90 1)), p1:(AND (GEQ s29 1) (GEQ s35 1)), p2:(AND (GEQ s1 1) (GEQ s81 1)), p3:(OR (LT s1 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 239 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 (NOT p1) (NOT p2) p3), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-15 finished in 1032 ms.
All properties solved by simple procedures.
Total runtime 17750 ms.

BK_STOP 1654776309609

--------------------
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-d1m04"
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-d1m04, 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-165472281900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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