Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478200316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DBSingleClientW-PT-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478200316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678245826958

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 03:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:23:48] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-08 03:23:48] [INFO ] Transformed 4763 places.
[2023-03-08 03:23:48] [INFO ] Transformed 2478 transitions.
[2023-03-08 03:23:48] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 TRUE 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 374 places :
Symmetric choice reduction at 1 with 374 rule applications. Total rules 619 place count 763 transition count 1424
Iterating global reduction 1 with 374 rules applied. Total rules applied 993 place count 763 transition count 1424
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 1041 place count 763 transition count 1376
Discarding 301 places :
Symmetric choice reduction at 2 with 301 rule applications. Total rules 1342 place count 462 transition count 1075
Iterating global reduction 2 with 301 rules applied. Total rules applied 1643 place count 462 transition count 1075
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1653 place count 462 transition count 1065
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 1875 place count 240 transition count 758
Iterating global reduction 3 with 222 rules applied. Total rules applied 2097 place count 240 transition count 758
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 3 with 257 rules applied. Total rules applied 2354 place count 240 transition count 501
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2370 place count 224 transition count 472
Iterating global reduction 4 with 16 rules applied. Total rules applied 2386 place count 224 transition count 472
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2410 place count 224 transition count 448
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2419 place count 215 transition count 439
Iterating global reduction 5 with 9 rules applied. Total rules applied 2428 place count 215 transition count 439
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2430 place count 215 transition count 437
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2437 place count 208 transition count 430
Iterating global reduction 6 with 7 rules applied. Total rules applied 2444 place count 208 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2448 place count 208 transition count 426
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2450 place count 206 transition count 422
Iterating global reduction 7 with 2 rules applied. Total rules applied 2452 place count 206 transition count 422
Applied a total of 2452 rules in 202 ms. Remains 206 /1183 variables (removed 977) and now considering 422/2478 (removed 2056) transitions.
// Phase 1: matrix 422 rows 206 cols
[2023-03-08 03:23:49] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-08 03:23:49] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-08 03:23:49] [INFO ] Invariant cache hit.
[2023-03-08 03:23:49] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-08 03:23:50] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-08 03:23:50] [INFO ] Invariant cache hit.
[2023-03-08 03:23:50] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/1183 places, 422/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1530 ms. Remains : 206/1183 places, 422/2478 transitions.
Support contains 29 out of 206 places after structural reductions.
[2023-03-08 03:23:50] [INFO ] Flatten gal took : 52 ms
[2023-03-08 03:23:50] [INFO ] Flatten gal took : 27 ms
[2023-03-08 03:23:50] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 28 out of 206 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 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 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 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 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 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 49 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 45 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 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 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 38 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 94 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 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 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 51 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 85 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 40 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 50 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 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 620414 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 23=1, 24=1}
Probabilistic random walk after 620414 steps, saw 249010 distinct states, run finished after 3003 ms. (steps per millisecond=206 ) properties seen :23
Running SMT prover for 2 properties.
[2023-03-08 03:23:54] [INFO ] Invariant cache hit.
[2023-03-08 03:23:54] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-08 03:23:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 03:23:54] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 03:23:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-08 03:23:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-08 03:23:55] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 03:23:55] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-08 03:23:55] [INFO ] After 102ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 03:23:55] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-08 03:23:55] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 422/422 transitions.
Graph (complete) has 774 edges and 206 vertex of which 205 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 205 transition count 416
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 30 place count 182 transition count 316
Iterating global reduction 1 with 23 rules applied. Total rules applied 53 place count 182 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 182 transition count 312
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 75 place count 164 transition count 289
Iterating global reduction 2 with 18 rules applied. Total rules applied 93 place count 164 transition count 289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 103 place count 164 transition count 279
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 115 place count 152 transition count 263
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 152 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 132 place count 152 transition count 258
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 140 place count 144 transition count 244
Iterating global reduction 4 with 8 rules applied. Total rules applied 148 place count 144 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 144 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 156 place count 140 transition count 236
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 140 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 165 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 170 place count 135 transition count 209
Iterating global reduction 6 with 5 rules applied. Total rules applied 175 place count 135 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 176 place count 135 transition count 208
Applied a total of 176 rules in 52 ms. Remains 135 /206 variables (removed 71) and now considering 208/422 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 135/206 places, 208/422 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1186750 steps, run visited all 1 properties in 1633 ms. (steps per millisecond=726 )
Probabilistic random walk after 1186750 steps, saw 472265 distinct states, run finished after 1634 ms. (steps per millisecond=726 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 32 stable transitions
Graph (complete) has 838 edges and 206 vertex of which 205 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(X(X(G(!p1)))) U p2)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 322
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 184 transition count 318
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 167 transition count 296
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 167 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 90 place count 167 transition count 288
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 155 transition count 272
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 155 transition count 272
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 155 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 147 transition count 251
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 147 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 139 place count 147 transition count 247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 143 transition count 243
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 143 transition count 243
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 152 place count 143 transition count 238
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 157 place count 138 transition count 216
Iterating global reduction 5 with 5 rules applied. Total rules applied 162 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 138 transition count 215
Applied a total of 163 rules in 22 ms. Remains 138 /206 variables (removed 68) and now considering 215/422 (removed 207) transitions.
// Phase 1: matrix 215 rows 138 cols
[2023-03-08 03:23:57] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 03:23:57] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 03:23:57] [INFO ] Invariant cache hit.
[2023-03-08 03:23:57] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 03:23:58] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-08 03:23:58] [INFO ] Invariant cache hit.
[2023-03-08 03:23:58] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/206 places, 215/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 138/206 places, 215/422 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s1 1) (GEQ s85 1) (GEQ s1 1) (GEQ s132 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 318
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 182 transition count 315
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 163 transition count 291
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 163 transition count 291
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 99 place count 163 transition count 281
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 112 place count 150 transition count 263
Iterating global reduction 2 with 13 rules applied. Total rules applied 125 place count 150 transition count 263
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 150 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 142 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 142 transition count 245
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 152 place count 142 transition count 240
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 159 place count 135 transition count 216
Iterating global reduction 4 with 7 rules applied. Total rules applied 166 place count 135 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 171 place count 135 transition count 211
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 176 place count 130 transition count 189
Iterating global reduction 5 with 5 rules applied. Total rules applied 181 place count 130 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 183 place count 130 transition count 187
Applied a total of 183 rules in 21 ms. Remains 130 /206 variables (removed 76) and now considering 187/422 (removed 235) transitions.
// Phase 1: matrix 187 rows 130 cols
[2023-03-08 03:23:58] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:23:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 03:23:58] [INFO ] Invariant cache hit.
[2023-03-08 03:23:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 03:23:58] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 03:23:58] [INFO ] Invariant cache hit.
[2023-03-08 03:23:58] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/206 places, 187/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 130/206 places, 187/422 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G(!p1)||(!p1&&F(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 326
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 184 transition count 324
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 64 place count 166 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 82 place count 166 transition count 301
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 92 place count 166 transition count 291
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 154 transition count 274
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 154 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 154 transition count 268
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 147 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 147 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 141 place count 147 transition count 250
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 142 transition count 234
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 142 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 156 place count 142 transition count 229
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 160 place count 138 transition count 208
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 138 transition count 208
Applied a total of 164 rules in 18 ms. Remains 138 /206 variables (removed 68) and now considering 208/422 (removed 214) transitions.
// Phase 1: matrix 208 rows 138 cols
[2023-03-08 03:23:59] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 03:23:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:23:59] [INFO ] Invariant cache hit.
[2023-03-08 03:23:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:23:59] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 03:23:59] [INFO ] Invariant cache hit.
[2023-03-08 03:23:59] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/206 places, 208/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 138/206 places, 208/422 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s136 1)), p2:(AND (GEQ s1 1) (GEQ s67 1)), p1:(AND (GEQ s1 1) (GEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22901 reset in 309 ms.
Product exploration explored 100000 steps with 22972 reset in 242 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 506 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 421 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Finished probabilistic random walk after 73401 steps, run visited all 5 properties in 349 ms. (steps per millisecond=210 )
Probabilistic random walk after 73401 steps, saw 32289 distinct states, run finished after 350 ms. (steps per millisecond=209 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 476 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 222 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 208/208 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-08 03:24:02] [INFO ] Invariant cache hit.
[2023-03-08 03:24:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 03:24:02] [INFO ] Invariant cache hit.
[2023-03-08 03:24:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:03] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-08 03:24:03] [INFO ] Invariant cache hit.
[2023-03-08 03:24:03] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 138/138 places, 208/208 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 506 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 447 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Finished probabilistic random walk after 73401 steps, run visited all 5 properties in 190 ms. (steps per millisecond=386 )
Probabilistic random walk after 73401 steps, saw 32289 distinct states, run finished after 190 ms. (steps per millisecond=386 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1) p0))), (F (AND (NOT p2) p1 p0)), (F (NOT p0)), (F (AND p2 p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 22911 reset in 192 ms.
Product exploration explored 100000 steps with 23075 reset in 195 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 208/208 transitions.
Applied a total of 0 rules in 24 ms. Remains 138 /138 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-08 03:24:05] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 03:24:05] [INFO ] Invariant cache hit.
[2023-03-08 03:24:06] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 138/138 places, 208/208 transitions.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-08 03:24:06] [INFO ] Invariant cache hit.
[2023-03-08 03:24:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:24:06] [INFO ] Invariant cache hit.
[2023-03-08 03:24:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:06] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-08 03:24:06] [INFO ] Invariant cache hit.
[2023-03-08 03:24:06] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 138/138 places, 208/208 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 7569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 312
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 182 transition count 309
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 163 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 163 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 96 place count 163 transition count 278
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 149 transition count 259
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 149 transition count 259
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 149 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 139 place count 140 transition count 236
Iterating global reduction 3 with 9 rules applied. Total rules applied 148 place count 140 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 153 place count 140 transition count 231
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 135 transition count 226
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 135 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 135 transition count 221
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 174 place count 129 transition count 198
Iterating global reduction 5 with 6 rules applied. Total rules applied 180 place count 129 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 182 place count 129 transition count 196
Applied a total of 182 rules in 40 ms. Remains 129 /206 variables (removed 77) and now considering 196/422 (removed 226) transitions.
// Phase 1: matrix 196 rows 129 cols
[2023-03-08 03:24:06] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:24:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 03:24:06] [INFO ] Invariant cache hit.
[2023-03-08 03:24:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-08 03:24:07] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2023-03-08 03:24:07] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 03:24:07] [INFO ] Invariant cache hit.
[2023-03-08 03:24:07] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/206 places, 196/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 129/206 places, 196/422 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((G(p1)&&X(F(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 333
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 184 transition count 329
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 166 transition count 306
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 166 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 166 transition count 296
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 154 transition count 280
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 154 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 154 transition count 275
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 130 place count 147 transition count 261
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 147 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 142 place count 147 transition count 256
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 149 place count 140 transition count 232
Iterating global reduction 4 with 7 rules applied. Total rules applied 156 place count 140 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 159 place count 140 transition count 229
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 165 place count 134 transition count 206
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 134 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 134 transition count 204
Applied a total of 173 rules in 24 ms. Remains 134 /206 variables (removed 72) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 134 cols
[2023-03-08 03:24:07] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:24:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:24:07] [INFO ] Invariant cache hit.
[2023-03-08 03:24:07] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 03:24:07] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-08 03:24:07] [INFO ] Invariant cache hit.
[2023-03-08 03:24:07] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/206 places, 204/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 134/206 places, 204/422 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s97 1)), p0:(OR (LT s1 1) (LT s124 1)), p2:(OR (LT s1 1) (LT s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28251 reset in 229 ms.
Product exploration explored 100000 steps with 27904 reset in 248 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 404 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 427 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21991 steps, run visited all 3 properties in 183 ms. (steps per millisecond=120 )
Probabilistic random walk after 21991 steps, saw 10814 distinct states, run finished after 183 ms. (steps per millisecond=120 ) properties seen :3
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:10] [INFO ] Invariant cache hit.
[2023-03-08 03:24:10] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 03:24:10] [INFO ] Invariant cache hit.
[2023-03-08 03:24:10] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 03:24:10] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-08 03:24:10] [INFO ] Invariant cache hit.
[2023-03-08 03:24:10] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 134/134 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 432 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21991 steps, run visited all 3 properties in 82 ms. (steps per millisecond=268 )
Probabilistic random walk after 21991 steps, saw 10814 distinct states, run finished after 82 ms. (steps per millisecond=268 ) properties seen :3
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 318 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 23034 reset in 172 ms.
Product exploration explored 100000 steps with 23013 reset in 172 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:24:13] [INFO ] Invariant cache hit.
[2023-03-08 03:24:13] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 134/134 places, 204/204 transitions.
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:13] [INFO ] Invariant cache hit.
[2023-03-08 03:24:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 03:24:13] [INFO ] Invariant cache hit.
[2023-03-08 03:24:13] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 03:24:13] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-08 03:24:13] [INFO ] Invariant cache hit.
[2023-03-08 03:24:13] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 134/134 places, 204/204 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 6721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 319
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 183 transition count 316
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 165 transition count 294
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 165 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 165 transition count 286
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 106 place count 152 transition count 268
Iterating global reduction 2 with 13 rules applied. Total rules applied 119 place count 152 transition count 268
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 152 transition count 262
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 133 place count 144 transition count 247
Iterating global reduction 3 with 8 rules applied. Total rules applied 141 place count 144 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 145 place count 144 transition count 243
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 152 place count 137 transition count 225
Iterating global reduction 4 with 7 rules applied. Total rules applied 159 place count 137 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 164 place count 137 transition count 220
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 170 place count 131 transition count 197
Iterating global reduction 5 with 6 rules applied. Total rules applied 176 place count 131 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 131 transition count 195
Applied a total of 178 rules in 12 ms. Remains 131 /206 variables (removed 75) and now considering 195/422 (removed 227) transitions.
// Phase 1: matrix 195 rows 131 cols
[2023-03-08 03:24:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:24:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 03:24:14] [INFO ] Invariant cache hit.
[2023-03-08 03:24:14] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 03:24:14] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-08 03:24:14] [INFO ] Invariant cache hit.
[2023-03-08 03:24:14] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/206 places, 195/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 131/206 places, 195/422 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s7 1) (LT s54 1)) (OR (LT s1 1) (LT s119 1))), p0:(AND (GEQ s1 1) (GEQ s119 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(p1) U p2))&&X(p3))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 185 transition count 330
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 185 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 185 transition count 328
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 168 transition count 306
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 168 transition count 306
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 168 transition count 297
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 157 transition count 282
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 157 transition count 282
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 157 transition count 277
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 121 place count 150 transition count 263
Iterating global reduction 3 with 7 rules applied. Total rules applied 128 place count 150 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 150 transition count 261
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 146 transition count 257
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 146 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 143 place count 146 transition count 252
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 148 place count 141 transition count 230
Iterating global reduction 5 with 5 rules applied. Total rules applied 153 place count 141 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 154 place count 141 transition count 229
Applied a total of 154 rules in 14 ms. Remains 141 /206 variables (removed 65) and now considering 229/422 (removed 193) transitions.
// Phase 1: matrix 229 rows 141 cols
[2023-03-08 03:24:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:24:14] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 03:24:14] [INFO ] Invariant cache hit.
[2023-03-08 03:24:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-08 03:24:15] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-08 03:24:15] [INFO ] Invariant cache hit.
[2023-03-08 03:24:15] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/206 places, 229/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 141/206 places, 229/422 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1} source=6 dest: 1}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s136 1)), p2:(AND (GEQ s1 1) (GEQ s127 1)), p1:(AND (GEQ s1 1) (GEQ s133 1)), p3:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 1029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(F(p1))&&F(p2)))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 183 transition count 314
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 165 transition count 292
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 165 transition count 292
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 165 transition count 283
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 108 place count 152 transition count 266
Iterating global reduction 2 with 13 rules applied. Total rules applied 121 place count 152 transition count 266
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 152 transition count 261
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 144 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 144 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 149 place count 144 transition count 238
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 155 place count 138 transition count 222
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 138 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 138 transition count 219
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 170 place count 132 transition count 196
Iterating global reduction 5 with 6 rules applied. Total rules applied 176 place count 132 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 132 transition count 194
Applied a total of 178 rules in 19 ms. Remains 132 /206 variables (removed 74) and now considering 194/422 (removed 228) transitions.
// Phase 1: matrix 194 rows 132 cols
[2023-03-08 03:24:15] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 03:24:15] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 03:24:15] [INFO ] Invariant cache hit.
[2023-03-08 03:24:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:16] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 03:24:16] [INFO ] Invariant cache hit.
[2023-03-08 03:24:16] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/206 places, 194/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 132/206 places, 194/422 transitions.
Stuttering acceptance computed with spot in 599 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s126 1)) (AND (GEQ s8 1) (GEQ s55 1))), p1:(AND (GEQ s1 1) (GEQ s126 1)), p2:(AND (GEQ s8 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 1088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(!p1))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 183 transition count 319
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 68 place count 164 transition count 298
Iterating global reduction 1 with 19 rules applied. Total rules applied 87 place count 164 transition count 298
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 164 transition count 288
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 151 transition count 270
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 151 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 151 transition count 263
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 143 transition count 247
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 143 transition count 247
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 151 place count 143 transition count 242
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 158 place count 136 transition count 218
Iterating global reduction 4 with 7 rules applied. Total rules applied 165 place count 136 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 136 transition count 216
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 170 place count 133 transition count 213
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 133 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 175 place count 133 transition count 211
Applied a total of 175 rules in 40 ms. Remains 133 /206 variables (removed 73) and now considering 211/422 (removed 211) transitions.
// Phase 1: matrix 211 rows 133 cols
[2023-03-08 03:24:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:24:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 03:24:16] [INFO ] Invariant cache hit.
[2023-03-08 03:24:17] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-08 03:24:17] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-08 03:24:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 03:24:17] [INFO ] Invariant cache hit.
[2023-03-08 03:24:17] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/206 places, 211/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 657 ms. Remains : 133/206 places, 211/422 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s98 1)), p1:(AND (GEQ s26 1) (GEQ s114 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((!p1||G(F(p2)))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 330
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 184 transition count 328
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 165 transition count 304
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 165 transition count 304
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 152 transition count 276
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 152 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 144 transition count 254
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 144 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 148 place count 144 transition count 249
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 154 place count 138 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 160 place count 138 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 166 place count 138 transition count 227
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 171 place count 133 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 176 place count 133 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 133 transition count 204
Applied a total of 177 rules in 10 ms. Remains 133 /206 variables (removed 73) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 133 cols
[2023-03-08 03:24:17] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:24:17] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 03:24:17] [INFO ] Invariant cache hit.
[2023-03-08 03:24:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:18] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-08 03:24:18] [INFO ] Invariant cache hit.
[2023-03-08 03:24:18] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/206 places, 204/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 133/206 places, 204/422 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(OR (LT s1 1) (LT s131 1)), p2:(OR (LT s1 1) (LT s98 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][false, false, false, false]]
Product exploration explored 100000 steps with 29805 reset in 190 ms.
Product exploration explored 100000 steps with 29787 reset in 186 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 235 ms. (steps per millisecond=313 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 236 ms. (steps per millisecond=312 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 443 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:20] [INFO ] Invariant cache hit.
[2023-03-08 03:24:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:24:20] [INFO ] Invariant cache hit.
[2023-03-08 03:24:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:20] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 03:24:20] [INFO ] Invariant cache hit.
[2023-03-08 03:24:20] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 377 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 436 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 278 ms. (steps per millisecond=265 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 279 ms. (steps per millisecond=264 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 367 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29748 reset in 206 ms.
Product exploration explored 100000 steps with 29747 reset in 187 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:23] [INFO ] Invariant cache hit.
[2023-03-08 03:24:23] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 133/133 places, 204/204 transitions.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:23] [INFO ] Invariant cache hit.
[2023-03-08 03:24:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 03:24:23] [INFO ] Invariant cache hit.
[2023-03-08 03:24:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:24] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-08 03:24:24] [INFO ] Invariant cache hit.
[2023-03-08 03:24:24] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 133/133 places, 204/204 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 6721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 317
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 317
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 182 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 163 transition count 289
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 163 transition count 289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 163 transition count 279
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 113 place count 150 transition count 262
Iterating global reduction 2 with 13 rules applied. Total rules applied 126 place count 150 transition count 262
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 150 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 142 transition count 241
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 142 transition count 241
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 154 place count 142 transition count 234
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 161 place count 135 transition count 210
Iterating global reduction 4 with 7 rules applied. Total rules applied 168 place count 135 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 171 place count 135 transition count 207
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 177 place count 129 transition count 184
Iterating global reduction 5 with 6 rules applied. Total rules applied 183 place count 129 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 185 place count 129 transition count 182
Applied a total of 185 rules in 27 ms. Remains 129 /206 variables (removed 77) and now considering 182/422 (removed 240) transitions.
// Phase 1: matrix 182 rows 129 cols
[2023-03-08 03:24:24] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:24:24] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:24:24] [INFO ] Invariant cache hit.
[2023-03-08 03:24:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 03:24:24] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-08 03:24:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:24] [INFO ] Invariant cache hit.
[2023-03-08 03:24:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/206 places, 182/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 129/206 places, 182/422 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-14 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 s123 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 22991 reset in 154 ms.
Product exploration explored 100000 steps with 22936 reset in 160 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21157 steps, run visited all 1 properties in 34 ms. (steps per millisecond=622 )
Probabilistic random walk after 21157 steps, saw 10415 distinct states, run finished after 34 ms. (steps per millisecond=622 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 03:24:25] [INFO ] Invariant cache hit.
[2023-03-08 03:24:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:24:25] [INFO ] Invariant cache hit.
[2023-03-08 03:24:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 03:24:25] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-08 03:24:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:25] [INFO ] Invariant cache hit.
[2023-03-08 03:24:25] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 129/129 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21157 steps, run visited all 1 properties in 37 ms. (steps per millisecond=571 )
Probabilistic random walk after 21157 steps, saw 10415 distinct states, run finished after 38 ms. (steps per millisecond=556 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22998 reset in 148 ms.
Product exploration explored 100000 steps with 23033 reset in 155 ms.
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 03:24:26] [INFO ] Invariant cache hit.
[2023-03-08 03:24:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:24:26] [INFO ] Invariant cache hit.
[2023-03-08 03:24:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 03:24:27] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 03:24:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:27] [INFO ] Invariant cache hit.
[2023-03-08 03:24:27] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 129/129 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-14 finished in 2911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(F(p1))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 324
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 183 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 165 transition count 297
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 165 transition count 297
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 165 transition count 287
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 153 transition count 271
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 153 transition count 271
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 153 transition count 266
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 146 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 146 transition count 255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 146 place count 146 transition count 248
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 152 place count 140 transition count 225
Iterating global reduction 4 with 6 rules applied. Total rules applied 158 place count 140 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 161 place count 140 transition count 222
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 166 place count 135 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 171 place count 135 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 135 transition count 198
Applied a total of 173 rules in 11 ms. Remains 135 /206 variables (removed 71) and now considering 198/422 (removed 224) transitions.
// Phase 1: matrix 198 rows 135 cols
[2023-03-08 03:24:27] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:24:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:24:27] [INFO ] Invariant cache hit.
[2023-03-08 03:24:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:27] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-08 03:24:27] [INFO ] Invariant cache hit.
[2023-03-08 03:24:27] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/206 places, 198/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 135/206 places, 198/422 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s1 1) (GEQ s129 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 22989 reset in 167 ms.
Product exploration explored 100000 steps with 23044 reset in 175 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Finished probabilistic random walk after 18370 steps, run visited all 3 properties in 59 ms. (steps per millisecond=311 )
Probabilistic random walk after 18370 steps, saw 8586 distinct states, run finished after 59 ms. (steps per millisecond=311 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 03:24:29] [INFO ] Invariant cache hit.
[2023-03-08 03:24:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:24:29] [INFO ] Invariant cache hit.
[2023-03-08 03:24:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:29] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 03:24:29] [INFO ] Invariant cache hit.
[2023-03-08 03:24:29] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 135/135 places, 198/198 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Finished probabilistic random walk after 18370 steps, run visited all 3 properties in 82 ms. (steps per millisecond=224 )
Probabilistic random walk after 18370 steps, saw 8586 distinct states, run finished after 82 ms. (steps per millisecond=224 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22972 reset in 165 ms.
Product exploration explored 100000 steps with 22947 reset in 162 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 03:24:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:31] [INFO ] Invariant cache hit.
[2023-03-08 03:24:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 135/135 places, 198/198 transitions.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 03:24:31] [INFO ] Invariant cache hit.
[2023-03-08 03:24:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:24:31] [INFO ] Invariant cache hit.
[2023-03-08 03:24:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:31] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-08 03:24:31] [INFO ] Invariant cache hit.
[2023-03-08 03:24:31] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 135/135 places, 198/198 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 4848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G(!p1)||(!p1&&F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((G(p1)&&X(F(p2))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-07
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 333
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 184 transition count 329
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 166 transition count 306
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 166 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 166 transition count 296
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 154 transition count 280
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 154 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 154 transition count 275
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 130 place count 147 transition count 261
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 147 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 142 place count 147 transition count 256
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 149 place count 140 transition count 232
Iterating global reduction 4 with 7 rules applied. Total rules applied 156 place count 140 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 159 place count 140 transition count 229
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 165 place count 134 transition count 206
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 134 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 134 transition count 204
Applied a total of 173 rules in 23 ms. Remains 134 /206 variables (removed 72) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 134 cols
[2023-03-08 03:24:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:24:32] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 03:24:32] [INFO ] Invariant cache hit.
[2023-03-08 03:24:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 03:24:32] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 03:24:32] [INFO ] Invariant cache hit.
[2023-03-08 03:24:32] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/206 places, 204/422 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 530 ms. Remains : 134/206 places, 204/422 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s97 1)), p0:(OR (LT s1 1) (LT s124 1)), p2:(OR (LT s1 1) (LT s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 27966 reset in 177 ms.
Product exploration explored 100000 steps with 28105 reset in 180 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21991 steps, run visited all 3 properties in 207 ms. (steps per millisecond=106 )
Probabilistic random walk after 21991 steps, saw 10814 distinct states, run finished after 207 ms. (steps per millisecond=106 ) properties seen :3
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 390 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:35] [INFO ] Invariant cache hit.
[2023-03-08 03:24:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 03:24:35] [INFO ] Invariant cache hit.
[2023-03-08 03:24:35] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 03:24:35] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-08 03:24:35] [INFO ] Invariant cache hit.
[2023-03-08 03:24:35] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 134/134 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 435 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21991 steps, run visited all 3 properties in 102 ms. (steps per millisecond=215 )
Probabilistic random walk after 21991 steps, saw 10814 distinct states, run finished after 103 ms. (steps per millisecond=213 ) properties seen :3
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 22903 reset in 168 ms.
Product exploration explored 100000 steps with 22912 reset in 169 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:37] [INFO ] Invariant cache hit.
[2023-03-08 03:24:38] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 134/134 places, 204/204 transitions.
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:38] [INFO ] Invariant cache hit.
[2023-03-08 03:24:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 03:24:38] [INFO ] Invariant cache hit.
[2023-03-08 03:24:38] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 03:24:38] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 03:24:38] [INFO ] Invariant cache hit.
[2023-03-08 03:24:38] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 134/134 places, 204/204 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 6429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((!p1||G(F(p2)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-12
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 330
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 184 transition count 328
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 165 transition count 304
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 165 transition count 304
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 152 transition count 276
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 152 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 144 transition count 254
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 144 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 148 place count 144 transition count 249
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 154 place count 138 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 160 place count 138 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 166 place count 138 transition count 227
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 171 place count 133 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 176 place count 133 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 133 transition count 204
Applied a total of 177 rules in 26 ms. Remains 133 /206 variables (removed 73) and now considering 204/422 (removed 218) transitions.
// Phase 1: matrix 204 rows 133 cols
[2023-03-08 03:24:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:24:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:24:38] [INFO ] Invariant cache hit.
[2023-03-08 03:24:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:39] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-08 03:24:39] [INFO ] Invariant cache hit.
[2023-03-08 03:24:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/206 places, 204/422 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 457 ms. Remains : 133/206 places, 204/422 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(OR (LT s1 1) (LT s131 1)), p2:(OR (LT s1 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29765 reset in 177 ms.
Product exploration explored 100000 steps with 29835 reset in 187 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 296 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 423 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 174 ms. (steps per millisecond=423 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 174 ms. (steps per millisecond=423 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 408 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:41] [INFO ] Invariant cache hit.
[2023-03-08 03:24:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 03:24:41] [INFO ] Invariant cache hit.
[2023-03-08 03:24:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:41] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-08 03:24:41] [INFO ] Invariant cache hit.
[2023-03-08 03:24:41] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 425 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 427 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 285 ms. (steps per millisecond=258 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 286 ms. (steps per millisecond=257 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 407 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29855 reset in 173 ms.
Product exploration explored 100000 steps with 29772 reset in 185 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:24:44] [INFO ] Invariant cache hit.
[2023-03-08 03:24:44] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 133/133 places, 204/204 transitions.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-08 03:24:44] [INFO ] Invariant cache hit.
[2023-03-08 03:24:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 03:24:44] [INFO ] Invariant cache hit.
[2023-03-08 03:24:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 03:24:44] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-08 03:24:44] [INFO ] Invariant cache hit.
[2023-03-08 03:24:44] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 133/133 places, 204/204 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 6362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(F(p1))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-15
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 422/422 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 324
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 183 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 165 transition count 297
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 165 transition count 297
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 165 transition count 287
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 153 transition count 271
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 153 transition count 271
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 153 transition count 266
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 146 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 146 transition count 255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 146 place count 146 transition count 248
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 152 place count 140 transition count 225
Iterating global reduction 4 with 6 rules applied. Total rules applied 158 place count 140 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 161 place count 140 transition count 222
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 166 place count 135 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 171 place count 135 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 135 transition count 198
Applied a total of 173 rules in 34 ms. Remains 135 /206 variables (removed 71) and now considering 198/422 (removed 224) transitions.
// Phase 1: matrix 198 rows 135 cols
[2023-03-08 03:24:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:24:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 03:24:45] [INFO ] Invariant cache hit.
[2023-03-08 03:24:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:45] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-08 03:24:45] [INFO ] Invariant cache hit.
[2023-03-08 03:24:45] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 135/206 places, 198/422 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 515 ms. Remains : 135/206 places, 198/422 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s1 1) (GEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23019 reset in 176 ms.
Product exploration explored 100000 steps with 22991 reset in 172 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Finished probabilistic random walk after 18370 steps, run visited all 3 properties in 179 ms. (steps per millisecond=102 )
Probabilistic random walk after 18370 steps, saw 8586 distinct states, run finished after 179 ms. (steps per millisecond=102 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 426 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 03:24:47] [INFO ] Invariant cache hit.
[2023-03-08 03:24:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 03:24:47] [INFO ] Invariant cache hit.
[2023-03-08 03:24:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:48] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-08 03:24:48] [INFO ] Invariant cache hit.
[2023-03-08 03:24:48] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 135/135 places, 198/198 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 430 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Finished probabilistic random walk after 18370 steps, run visited all 3 properties in 108 ms. (steps per millisecond=170 )
Probabilistic random walk after 18370 steps, saw 8586 distinct states, run finished after 108 ms. (steps per millisecond=170 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 23021 reset in 163 ms.
Product exploration explored 100000 steps with 22923 reset in 211 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 03:24:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:24:50] [INFO ] Invariant cache hit.
[2023-03-08 03:24:50] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 135/135 places, 198/198 transitions.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-08 03:24:50] [INFO ] Invariant cache hit.
[2023-03-08 03:24:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 03:24:50] [INFO ] Invariant cache hit.
[2023-03-08 03:24:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:24:50] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-08 03:24:50] [INFO ] Invariant cache hit.
[2023-03-08 03:24:50] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 135/135 places, 198/198 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 5689 ms.
[2023-03-08 03:24:50] [INFO ] Flatten gal took : 23 ms
[2023-03-08 03:24:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 03:24:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 422 transitions and 1661 arcs took 3 ms.
Total runtime 62358 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d2m07
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLFireability

FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678245926958

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 15 (type EXCL) for 14 DBSingleClientW-PT-d2m07-LTLFireability-12
lola: time limit : 514 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 5/514 6/32 DBSingleClientW-PT-d2m07-LTLFireability-12 737980 m, 147596 m/sec, 1695073 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 10/514 12/32 DBSingleClientW-PT-d2m07-LTLFireability-12 1419200 m, 136244 m/sec, 3416408 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 15/514 17/32 DBSingleClientW-PT-d2m07-LTLFireability-12 2049475 m, 126055 m/sec, 5148033 t fired, .

Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 20/514 21/32 DBSingleClientW-PT-d2m07-LTLFireability-12 2683828 m, 126870 m/sec, 6734691 t fired, .

Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 25/514 26/32 DBSingleClientW-PT-d2m07-LTLFireability-12 3298763 m, 122987 m/sec, 8375428 t fired, .

Time elapsed: 25 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 30/514 30/32 DBSingleClientW-PT-d2m07-LTLFireability-12 3957617 m, 131770 m/sec, 9989292 t fired, .

Time elapsed: 30 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 15 (type EXCL) for DBSingleClientW-PT-d2m07-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ 0 2 0 0 2 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 21 (type EXCL) for 20 DBSingleClientW-PT-d2m07-LTLFireability-15
lola: time limit : 594 sec
lola: memory limit: 32 pages
lola: FINISHED task # 21 (type EXCL) for DBSingleClientW-PT-d2m07-LTLFireability-15
lola: result : false
lola: markings : 3077
lola: fired transitions : 5981
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 12 (type EXCL) for 7 DBSingleClientW-PT-d2m07-LTLFireability-07
lola: time limit : 713 sec
lola: memory limit: 32 pages
lola: FINISHED task # 12 (type EXCL) for DBSingleClientW-PT-d2m07-LTLFireability-07
lola: result : false
lola: markings : 767
lola: fired transitions : 1377
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 5 (type EXCL) for 0 DBSingleClientW-PT-d2m07-LTLFireability-04
lola: time limit : 1188 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for DBSingleClientW-PT-d2m07-LTLFireability-04
lola: result : false
lola: markings : 4777
lola: fired transitions : 9368
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 18 (type EXCL) for 17 DBSingleClientW-PT-d2m07-LTLFireability-14
lola: time limit : 3565 sec
lola: memory limit: 32 pages
lola: FINISHED task # 18 (type EXCL) for DBSingleClientW-PT-d2m07-LTLFireability-14
lola: result : false
lola: markings : 240
lola: fired transitions : 394
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m07-LTLFireability-04: CONJ false LTL model checker
DBSingleClientW-PT-d2m07-LTLFireability-07: CONJ false LTL model checker
DBSingleClientW-PT-d2m07-LTLFireability-12: LTL unknown AGGR
DBSingleClientW-PT-d2m07-LTLFireability-14: LTL false LTL model checker
DBSingleClientW-PT-d2m07-LTLFireability-15: LTL false LTL model checker


Time elapsed: 35 secs. Pages in use: 32

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-d2m07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DBSingleClientW-PT-d2m07, 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 r103-tall-167814478200316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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