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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
374.199 29476.00 50608.00 1478.90 FFFFFFFFFFTTFFFF 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-165472282000260.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-d2m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282000260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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 1.6M 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-d2m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654783223735

Running Version 202205111006
[2022-06-09 14:00:24] [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 14:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 14:00:25] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2022-06-09 14:00:25] [INFO ] Transformed 4763 places.
[2022-06-09 14:00:25] [INFO ] Transformed 2478 transitions.
[2022-06-09 14:00:25] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 338 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 4 formulas.
Deduced a syphon composed of 3580 places in 18 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 373 places :
Symmetric choice reduction at 1 with 373 rule applications. Total rules 618 place count 764 transition count 1353
Iterating global reduction 1 with 373 rules applied. Total rules applied 991 place count 764 transition count 1353
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 1023 place count 764 transition count 1321
Discarding 301 places :
Symmetric choice reduction at 2 with 301 rule applications. Total rules 1324 place count 463 transition count 1020
Iterating global reduction 2 with 301 rules applied. Total rules applied 1625 place count 463 transition count 1020
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1632 place count 463 transition count 1013
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 1854 place count 241 transition count 702
Iterating global reduction 3 with 222 rules applied. Total rules applied 2076 place count 241 transition count 702
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Iterating post reduction 3 with 225 rules applied. Total rules applied 2301 place count 241 transition count 477
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2318 place count 224 transition count 449
Iterating global reduction 4 with 17 rules applied. Total rules applied 2335 place count 224 transition count 449
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2347 place count 224 transition count 437
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2358 place count 213 transition count 426
Iterating global reduction 5 with 11 rules applied. Total rules applied 2369 place count 213 transition count 426
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2373 place count 213 transition count 422
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2381 place count 205 transition count 414
Iterating global reduction 6 with 8 rules applied. Total rules applied 2389 place count 205 transition count 414
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2399 place count 205 transition count 404
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2401 place count 203 transition count 397
Iterating global reduction 7 with 2 rules applied. Total rules applied 2403 place count 203 transition count 397
Applied a total of 2403 rules in 204 ms. Remains 203 /1183 variables (removed 980) and now considering 397/2478 (removed 2081) transitions.
// Phase 1: matrix 397 rows 203 cols
[2022-06-09 14:00:25] [INFO ] Computed 2 place invariants in 25 ms
[2022-06-09 14:00:25] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 397 rows 203 cols
[2022-06-09 14:00:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:00:26] [INFO ] State equation strengthened by 206 read => feed constraints.
[2022-06-09 14:00:26] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 203 cols
[2022-06-09 14:00:26] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 14:00:26] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/1183 places, 397/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/1183 places, 397/2478 transitions.
Support contains 29 out of 203 places after structural reductions.
[2022-06-09 14:00:27] [INFO ] Flatten gal took : 554 ms
[2022-06-09 14:00:27] [INFO ] Flatten gal took : 28 ms
[2022-06-09 14:00:27] [INFO ] Input system was already deterministic with 397 transitions.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 687 ms. (steps per millisecond=14 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 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 44 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 86 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 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 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 1000 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 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 102 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 35 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 40 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 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 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 49 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 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 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 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 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 533308 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1}
Probabilistic random walk after 533308 steps, saw 216222 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :23
Running SMT prover for 2 properties.
// Phase 1: matrix 397 rows 203 cols
[2022-06-09 14:00:31] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 14:00:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 14:00:31] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 14:00:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 14:00:32] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 14:00:32] [INFO ] State equation strengthened by 206 read => feed constraints.
[2022-06-09 14:00:32] [INFO ] After 186ms SMT Verify possible using 206 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 14:00:32] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 389 ms.
[2022-06-09 14:00:33] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 397/397 transitions.
Graph (complete) has 741 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 202 transition count 390
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 30 place count 180 transition count 315
Iterating global reduction 1 with 22 rules applied. Total rules applied 52 place count 180 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 180 transition count 307
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 75 place count 165 transition count 285
Iterating global reduction 2 with 15 rules applied. Total rules applied 90 place count 165 transition count 285
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 165 transition count 277
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 109 place count 154 transition count 245
Iterating global reduction 3 with 11 rules applied. Total rules applied 120 place count 154 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 154 transition count 241
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 130 place count 148 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 148 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 140 place count 148 transition count 229
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 143 place count 145 transition count 226
Iterating global reduction 5 with 3 rules applied. Total rules applied 146 place count 145 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 145 transition count 225
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 149 place count 143 transition count 223
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 143 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 143 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 154 place count 142 transition count 219
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 142 transition count 219
Applied a total of 155 rules in 67 ms. Remains 142 /203 variables (removed 61) and now considering 219/397 (removed 178) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/203 places, 219/397 transitions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 427 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 703064 steps, run visited all 2 properties in 1386 ms. (steps per millisecond=507 )
Probabilistic random walk after 703064 steps, saw 258726 distinct states, run finished after 1386 ms. (steps per millisecond=507 ) properties seen :2
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(X(G(F(X(p0))))))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 178 transition count 309
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 178 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 178 transition count 302
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 159 transition count 276
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 159 transition count 276
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 104 place count 159 transition count 267
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 119 place count 144 transition count 230
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 144 transition count 230
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 144 transition count 222
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 152 place count 134 transition count 196
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 134 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 165 place count 134 transition count 193
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 170 place count 129 transition count 188
Iterating global reduction 4 with 5 rules applied. Total rules applied 175 place count 129 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 177 place count 129 transition count 186
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 180 place count 126 transition count 183
Iterating global reduction 5 with 3 rules applied. Total rules applied 183 place count 126 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 185 place count 126 transition count 181
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 125 transition count 179
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 125 transition count 179
Applied a total of 187 rules in 41 ms. Remains 125 /203 variables (removed 78) and now considering 179/397 (removed 218) transitions.
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 14:00:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:35] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 14:00:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-09 14:00:35] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2022-06-09 14:00:35] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 14:00:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:35] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/203 places, 179/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/203 places, 179/397 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-00 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 s94 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 2 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-00 finished in 793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(!((X(p0) U p1) U !p0))))))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 301
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 301
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 179 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 161 transition count 269
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 161 transition count 269
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 100 place count 161 transition count 260
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 114 place count 147 transition count 224
Iterating global reduction 2 with 14 rules applied. Total rules applied 128 place count 147 transition count 224
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 133 place count 147 transition count 219
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 142 place count 138 transition count 195
Iterating global reduction 3 with 9 rules applied. Total rules applied 151 place count 138 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 138 transition count 192
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 159 place count 133 transition count 187
Iterating global reduction 4 with 5 rules applied. Total rules applied 164 place count 133 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 166 place count 133 transition count 185
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 130 transition count 182
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 130 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 173 place count 130 transition count 181
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 129 transition count 179
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 129 transition count 179
Applied a total of 175 rules in 41 ms. Remains 129 /203 variables (removed 74) and now considering 179/397 (removed 218) transitions.
// Phase 1: matrix 179 rows 129 cols
[2022-06-09 14:00:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:35] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 179 rows 129 cols
[2022-06-09 14:00:35] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 14:00:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-09 14:00:36] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2022-06-09 14:00:36] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 179 rows 129 cols
[2022-06-09 14:00:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:36] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/203 places, 179/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/203 places, 179/397 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), false]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s79 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-d2m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((X(p1)&&(p2 U p3))))))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 314
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 180 transition count 306
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 164 transition count 284
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 164 transition count 284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 164 transition count 277
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 152 transition count 250
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 152 transition count 250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 152 transition count 245
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 144 transition count 222
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 144 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 144 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 140 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 140 transition count 214
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 140 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 137 transition count 210
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 137 transition count 210
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 137 transition count 208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 136 transition count 206
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 136 transition count 206
Applied a total of 161 rules in 32 ms. Remains 136 /203 variables (removed 67) and now considering 206/397 (removed 191) transitions.
// Phase 1: matrix 206 rows 136 cols
[2022-06-09 14:00:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:00:36] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 206 rows 136 cols
[2022-06-09 14:00:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:36] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-06-09 14:00:36] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 136 cols
[2022-06-09 14:00:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:00:36] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/203 places, 206/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/203 places, 206/397 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s129 1) (GEQ s1 1) (GEQ s126 1)), p3:(AND (GEQ s8 1) (GEQ s56 1)), p2:(AND (GEQ s1 1) (GEQ s129 1)), p1:(AND (GEQ s1 1) (GEQ s126 ...], 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-02 finished in 735 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 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 178 transition count 300
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 178 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 178 transition count 294
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 159 transition count 268
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 159 transition count 268
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 103 place count 159 transition count 259
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 145 transition count 229
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 145 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 137 place count 145 transition count 223
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 147 place count 135 transition count 197
Iterating global reduction 3 with 10 rules applied. Total rules applied 157 place count 135 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 160 place count 135 transition count 194
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 165 place count 130 transition count 189
Iterating global reduction 4 with 5 rules applied. Total rules applied 170 place count 130 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 130 transition count 187
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 175 place count 127 transition count 184
Iterating global reduction 5 with 3 rules applied. Total rules applied 178 place count 127 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 181 place count 126 transition count 180
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 126 transition count 180
Applied a total of 182 rules in 33 ms. Remains 126 /203 variables (removed 77) and now considering 180/397 (removed 217) transitions.
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 14:00:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:37] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 14:00:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-09 14:00:37] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2022-06-09 14:00:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 14:00:37] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 14:00:37] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/203 places, 180/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/203 places, 180/397 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22992 reset in 312 ms.
Product exploration explored 100000 steps with 22897 reset in 187 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8039 steps, run visited all 1 properties in 17 ms. (steps per millisecond=472 )
Probabilistic random walk after 8039 steps, saw 3777 distinct states, run finished after 18 ms. (steps per millisecond=446 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 14:00:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:38] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 14:00:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 14:00:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-09 14:00:39] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2022-06-09 14:00:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 14:00:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:39] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 180/180 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8039 steps, run visited all 1 properties in 17 ms. (steps per millisecond=472 )
Probabilistic random walk after 8039 steps, saw 3777 distinct states, run finished after 19 ms. (steps per millisecond=423 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23109 reset in 148 ms.
Product exploration explored 100000 steps with 22938 reset in 212 ms.
Built C files in :
/tmp/ltsmin17195908199727442741
[2022-06-09 14:00:40] [INFO ] Computing symmetric may disable matrix : 180 transitions.
[2022-06-09 14:00:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:40] [INFO ] Computing symmetric may enable matrix : 180 transitions.
[2022-06-09 14:00:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:40] [INFO ] Computing Do-Not-Accords matrix : 180 transitions.
[2022-06-09 14:00:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:40] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17195908199727442741
Running compilation step : cd /tmp/ltsmin17195908199727442741;'/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 442 ms.
Running link step : cd /tmp/ltsmin17195908199727442741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17195908199727442741;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9964210813298336790.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-04 finished in 3729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((p0 U p1))&&X(G(!p0))&&p2))))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 314
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 314
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 180 transition count 307
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 163 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 163 transition count 284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 163 transition count 277
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 150 transition count 249
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 150 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 150 transition count 243
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 135 place count 141 transition count 219
Iterating global reduction 3 with 9 rules applied. Total rules applied 144 place count 141 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 141 transition count 217
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 136 transition count 212
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 136 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 158 place count 136 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 133 transition count 207
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 133 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 166 place count 133 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 132 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 132 transition count 203
Applied a total of 168 rules in 17 ms. Remains 132 /203 variables (removed 71) and now considering 203/397 (removed 194) transitions.
// Phase 1: matrix 203 rows 132 cols
[2022-06-09 14:00:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:40] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 203 rows 132 cols
[2022-06-09 14:00:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-09 14:00:41] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 132 cols
[2022-06-09 14:00:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:41] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/203 places, 203/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/203 places, 203/397 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p1), p0]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={1} source=1 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={1} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s120 1)), p1:(AND (GEQ s1 1) (GEQ s95 1)), p0:(AND (GEQ s8 1) (GEQ s54 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-05 finished in 667 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 308
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 179 transition count 302
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 161 transition count 277
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 161 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 97 place count 161 transition count 270
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 148 transition count 243
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 148 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 129 place count 148 transition count 237
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 138 place count 139 transition count 213
Iterating global reduction 3 with 9 rules applied. Total rules applied 147 place count 139 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 139 transition count 211
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 134 transition count 206
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 134 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 161 place count 134 transition count 204
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 164 place count 131 transition count 201
Iterating global reduction 5 with 3 rules applied. Total rules applied 167 place count 131 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 169 place count 131 transition count 199
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 130 transition count 197
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 130 transition count 197
Applied a total of 171 rules in 24 ms. Remains 130 /203 variables (removed 73) and now considering 197/397 (removed 200) transitions.
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 14:00:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:41] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 14:00:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-09 14:00:41] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2022-06-09 14:00:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 14:00:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:42] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/203 places, 197/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/203 places, 197/397 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s70 1)), p1:(OR (LT s1 1) (LT s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23013 reset in 248 ms.
Product exploration explored 100000 steps with 22945 reset in 225 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 22246 steps, run visited all 2 properties in 121 ms. (steps per millisecond=183 )
Probabilistic random walk after 22246 steps, saw 10947 distinct states, run finished after 121 ms. (steps per millisecond=183 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 447 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 197/197 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 14:00:44] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:00:44] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 14:00:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:44] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-09 14:00:44] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2022-06-09 14:00:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 14:00:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:44] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 197/197 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 : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2346 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 431 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 22246 steps, run visited all 2 properties in 85 ms. (steps per millisecond=261 )
Probabilistic random walk after 22246 steps, saw 10947 distinct states, run finished after 86 ms. (steps per millisecond=258 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22946 reset in 193 ms.
Product exploration explored 100000 steps with 23071 reset in 187 ms.
Built C files in :
/tmp/ltsmin10991858422099759875
[2022-06-09 14:00:45] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2022-06-09 14:00:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:45] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2022-06-09 14:00:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:45] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2022-06-09 14:00:45] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10991858422099759875
Running compilation step : cd /tmp/ltsmin10991858422099759875;'/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 384 ms.
Running link step : cd /tmp/ltsmin10991858422099759875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10991858422099759875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2158561895753291530.hoa' '--buchi-type=spotba'
LTSmin run took 156 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 4946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((X(p0)||p1)) U p2))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 309
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 180 transition count 303
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 163 transition count 279
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 163 transition count 279
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 163 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 150 transition count 238
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 150 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 150 transition count 233
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 134 place count 141 transition count 208
Iterating global reduction 3 with 9 rules applied. Total rules applied 143 place count 141 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 149 place count 141 transition count 202
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 153 place count 137 transition count 198
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 137 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 137 transition count 197
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 134 transition count 194
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 134 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 166 place count 134 transition count 192
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 133 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 133 transition count 190
Applied a total of 168 rules in 15 ms. Remains 133 /203 variables (removed 70) and now considering 190/397 (removed 207) transitions.
// Phase 1: matrix 190 rows 133 cols
[2022-06-09 14:00:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:46] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 190 rows 133 cols
[2022-06-09 14:00:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 14:00:47] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
// Phase 1: matrix 190 rows 133 cols
[2022-06-09 14:00:47] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 14:00:47] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/203 places, 190/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/203 places, 190/397 transitions.
Stuttering acceptance computed with spot in 230 ms :[p0, p2, (AND p0 p2), (OR (AND p0 p2) (AND p1 p2)), true, (OR p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s8 1) (GEQ s55 1)), p2:(AND (GEQ s1 1) (GEQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 375 ms.
Product exploration explored 100000 steps with 50000 reset in 301 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 (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) (NOT p2))
Knowledge based reduction with 21 factoid took 1964 ms. Reduced automaton from 6 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 3571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 301
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 301
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 179 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 162 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 162 transition count 270
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 98 place count 162 transition count 261
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 148 transition count 226
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 148 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 148 transition count 221
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 140 place count 139 transition count 203
Iterating global reduction 3 with 9 rules applied. Total rules applied 149 place count 139 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 152 place count 139 transition count 200
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 157 place count 134 transition count 195
Iterating global reduction 4 with 5 rules applied. Total rules applied 162 place count 134 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 134 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 166 place count 131 transition count 191
Iterating global reduction 5 with 3 rules applied. Total rules applied 169 place count 131 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 171 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 130 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 130 transition count 187
Applied a total of 173 rules in 14 ms. Remains 130 /203 variables (removed 73) and now considering 187/397 (removed 210) transitions.
// Phase 1: matrix 187 rows 130 cols
[2022-06-09 14:00:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:50] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 187 rows 130 cols
[2022-06-09 14:00:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 14:00:50] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 187 rows 130 cols
[2022-06-09 14:00:50] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 14:00:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/203 places, 187/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/203 places, 187/397 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s92 1)), p0:(OR (AND (GEQ s1 1) (GEQ s92 1)) (LT s1 1) (LT s114 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 207 ms.
Product exploration explored 100000 steps with 33333 reset in 219 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 (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-11 finished in 1240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 301
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 179 transition count 297
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 162 transition count 277
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 162 transition count 277
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 162 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 107 place count 150 transition count 250
Iterating global reduction 2 with 12 rules applied. Total rules applied 119 place count 150 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 150 transition count 244
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 134 place count 141 transition count 219
Iterating global reduction 3 with 9 rules applied. Total rules applied 143 place count 141 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 141 transition count 216
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 150 place count 137 transition count 212
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 137 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 137 transition count 210
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 135 transition count 208
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 135 transition count 208
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 135 transition count 206
Applied a total of 162 rules in 15 ms. Remains 135 /203 variables (removed 68) and now considering 206/397 (removed 191) transitions.
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:00:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:51] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:00:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:51] [INFO ] State equation strengthened by 79 read => feed constraints.
[2022-06-09 14:00:51] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:00:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:51] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/203 places, 206/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/203 places, 206/397 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-12 finished in 668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X((p0 U p1)))||G(X(X(p1))))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 313
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 313
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 179 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 162 transition count 282
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 162 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 97 place count 162 transition count 274
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 149 transition count 239
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 149 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 129 place count 149 transition count 233
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 141 transition count 211
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 141 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 141 transition count 209
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 151 place count 137 transition count 205
Iterating global reduction 4 with 4 rules applied. Total rules applied 155 place count 137 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 137 transition count 203
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 159 place count 135 transition count 201
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 135 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 134 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 134 transition count 199
Applied a total of 163 rules in 18 ms. Remains 134 /203 variables (removed 69) and now considering 199/397 (removed 198) transitions.
// Phase 1: matrix 199 rows 134 cols
[2022-06-09 14:00:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:52] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 199 rows 134 cols
[2022-06-09 14:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:52] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-09 14:00:52] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 134 cols
[2022-06-09 14:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:52] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/203 places, 199/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/203 places, 199/397 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s123 1)), p1:(AND (GEQ s1 1) (GEQ s132 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-14 finished in 611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (p1 U X(X(G(p2))))))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 397/397 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 309
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 180 transition count 302
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 163 transition count 279
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 163 transition count 279
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 95 place count 163 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 108 place count 150 transition count 243
Iterating global reduction 2 with 13 rules applied. Total rules applied 121 place count 150 transition count 243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 126 place count 150 transition count 238
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 142 transition count 214
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 142 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 148 place count 142 transition count 208
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 139 transition count 205
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 139 transition count 205
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 157 place count 136 transition count 202
Iterating global reduction 4 with 3 rules applied. Total rules applied 160 place count 136 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 136 transition count 200
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 135 transition count 198
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 135 transition count 198
Applied a total of 164 rules in 8 ms. Remains 135 /203 variables (removed 68) and now considering 198/397 (removed 199) transitions.
// Phase 1: matrix 198 rows 135 cols
[2022-06-09 14:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:52] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 198 rows 135 cols
[2022-06-09 14:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-09 14:00:52] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 198 rows 135 cols
[2022-06-09 14:00:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:52] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/203 places, 198/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/203 places, 198/397 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (NOT (AND (GEQ s1 1) (GEQ s129 1))) (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s44 1) (GEQ s77 1)), p2:(AND (GEQ s1 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-15 finished in 559 ms.
All properties solved by simple procedures.
Total runtime 28227 ms.

BK_STOP 1654783253211

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

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