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-167814478100300.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-d2m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478100300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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-d2m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678245484914

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-d2m05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:18:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 03:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:18:06] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-08 03:18:06] [INFO ] Transformed 4763 places.
[2023-03-08 03:18:06] [INFO ] Transformed 2478 transitions.
[2023-03-08 03:18:06] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 259 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 14 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 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 1439
Iterating global reduction 1 with 374 rules applied. Total rules applied 993 place count 763 transition count 1439
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 1033 place count 763 transition count 1399
Discarding 298 places :
Symmetric choice reduction at 2 with 298 rule applications. Total rules 1331 place count 465 transition count 1101
Iterating global reduction 2 with 298 rules applied. Total rules applied 1629 place count 465 transition count 1101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1639 place count 465 transition count 1091
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 1862 place count 242 transition count 783
Iterating global reduction 3 with 223 rules applied. Total rules applied 2085 place count 242 transition count 783
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Iterating post reduction 3 with 285 rules applied. Total rules applied 2370 place count 242 transition count 498
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2387 place count 225 transition count 468
Iterating global reduction 4 with 17 rules applied. Total rules applied 2404 place count 225 transition count 468
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2424 place count 225 transition count 448
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2433 place count 216 transition count 439
Iterating global reduction 5 with 9 rules applied. Total rules applied 2442 place count 216 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2443 place count 216 transition count 438
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2450 place count 209 transition count 431
Iterating global reduction 6 with 7 rules applied. Total rules applied 2457 place count 209 transition count 431
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2461 place count 209 transition count 427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2462 place count 208 transition count 425
Iterating global reduction 7 with 1 rules applied. Total rules applied 2463 place count 208 transition count 425
Applied a total of 2463 rules in 194 ms. Remains 208 /1183 variables (removed 975) and now considering 425/2478 (removed 2053) transitions.
// Phase 1: matrix 425 rows 208 cols
[2023-03-08 03:18:07] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-08 03:18:07] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-08 03:18:07] [INFO ] Invariant cache hit.
[2023-03-08 03:18:07] [INFO ] State equation strengthened by 222 read => feed constraints.
[2023-03-08 03:18:08] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2023-03-08 03:18:08] [INFO ] Invariant cache hit.
[2023-03-08 03:18:08] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/1183 places, 425/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 208/1183 places, 425/2478 transitions.
Support contains 39 out of 208 places after structural reductions.
[2023-03-08 03:18:08] [INFO ] Flatten gal took : 170 ms
[2023-03-08 03:18:08] [INFO ] Flatten gal took : 33 ms
[2023-03-08 03:18:08] [INFO ] Input system was already deterministic with 425 transitions.
Support contains 38 out of 208 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 158 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 115 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 851974 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{0=1, 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, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1}
Probabilistic random walk after 851974 steps, saw 326142 distinct states, run finished after 3002 ms. (steps per millisecond=283 ) properties seen :28
Running SMT prover for 1 properties.
[2023-03-08 03:18:12] [INFO ] Invariant cache hit.
[2023-03-08 03:18:12] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 843 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 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(G((F(p0)&&X((F(G(p2))&&p1))))))'
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 183 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 183 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 183 transition count 318
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 163 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 163 transition count 289
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 103 place count 163 transition count 278
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 116 place count 150 transition count 246
Iterating global reduction 2 with 13 rules applied. Total rules applied 129 place count 150 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 150 transition count 242
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 141 place count 142 transition count 231
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 142 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 142 transition count 227
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 137 transition count 222
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 137 transition count 222
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 137 transition count 217
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 172 place count 133 transition count 196
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 133 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 133 transition count 194
Applied a total of 178 rules in 24 ms. Remains 133 /208 variables (removed 75) and now considering 194/425 (removed 231) transitions.
// Phase 1: matrix 194 rows 133 cols
[2023-03-08 03:18:13] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:18:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 03:18:13] [INFO ] Invariant cache hit.
[2023-03-08 03:18:13] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-08 03:18:13] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-08 03:18:13] [INFO ] Invariant cache hit.
[2023-03-08 03:18:13] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/208 places, 194/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 133/208 places, 194/425 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s8 1) (GEQ s55 1)), p2:(AND (GEQ s54 1) (GEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-00 finished in 994 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)||G(F(p1))))'
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 183 transition count 326
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 183 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 183 transition count 325
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 72 place count 162 transition count 290
Iterating global reduction 1 with 21 rules applied. Total rules applied 93 place count 162 transition count 290
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 104 place count 162 transition count 279
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 117 place count 149 transition count 248
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 149 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 149 transition count 245
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 141 place count 141 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 141 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 155 place count 141 transition count 228
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 159 place count 137 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 137 transition count 224
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 137 transition count 219
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 172 place count 133 transition count 198
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 133 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 178 place count 133 transition count 196
Applied a total of 178 rules in 70 ms. Remains 133 /208 variables (removed 75) and now considering 196/425 (removed 229) transitions.
// Phase 1: matrix 196 rows 133 cols
[2023-03-08 03:18:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:18:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:18:14] [INFO ] Invariant cache hit.
[2023-03-08 03:18:14] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 03:18:14] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 03:18:14] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 03:18:14] [INFO ] Invariant cache hit.
[2023-03-08 03:18:14] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/208 places, 196/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 133/208 places, 196/425 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s55 1)), p1:(OR (AND (GEQ s1 1) (GEQ s126 1)) (AND (GEQ s2 1) (GEQ s131 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-01 finished in 622 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 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 181 transition count 328
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 181 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 326
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 158 transition count 289
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 158 transition count 289
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 117 place count 158 transition count 274
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 132 place count 143 transition count 233
Iterating global reduction 2 with 15 rules applied. Total rules applied 147 place count 143 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 151 place count 143 transition count 229
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 160 place count 134 transition count 217
Iterating global reduction 3 with 9 rules applied. Total rules applied 169 place count 134 transition count 217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 173 place count 134 transition count 213
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 178 place count 129 transition count 208
Iterating global reduction 4 with 5 rules applied. Total rules applied 183 place count 129 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 189 place count 129 transition count 202
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 193 place count 125 transition count 181
Iterating global reduction 5 with 4 rules applied. Total rules applied 197 place count 125 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 199 place count 125 transition count 179
Applied a total of 199 rules in 31 ms. Remains 125 /208 variables (removed 83) and now considering 179/425 (removed 246) transitions.
// Phase 1: matrix 179 rows 125 cols
[2023-03-08 03:18:14] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 03:18:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 03:18:14] [INFO ] Invariant cache hit.
[2023-03-08 03:18:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:18:14] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-08 03:18:14] [INFO ] Invariant cache hit.
[2023-03-08 03:18:15] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/208 places, 179/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 125/208 places, 179/425 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s94 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]]
Product exploration explored 100000 steps with 50000 reset in 321 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 453 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-02 finished in 1170 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||(p0 U p1))) U (G(!p2) U p3)))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 183 transition count 340
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 183 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 183 transition count 337
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 74 place count 162 transition count 302
Iterating global reduction 1 with 21 rules applied. Total rules applied 95 place count 162 transition count 302
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 108 place count 162 transition count 289
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 150 transition count 258
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 150 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 150 transition count 255
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 143 place count 142 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 142 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 155 place count 142 transition count 241
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 159 place count 138 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 138 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 169 place count 138 transition count 231
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 172 place count 135 transition count 211
Iterating global reduction 5 with 3 rules applied. Total rules applied 175 place count 135 transition count 211
Applied a total of 175 rules in 16 ms. Remains 135 /208 variables (removed 73) and now considering 211/425 (removed 214) transitions.
// Phase 1: matrix 211 rows 135 cols
[2023-03-08 03:18:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:18:15] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 03:18:15] [INFO ] Invariant cache hit.
[2023-03-08 03:18:16] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-08 03:18:16] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 03:18:16] [INFO ] Invariant cache hit.
[2023-03-08 03:18:16] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/208 places, 211/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 135/208 places, 211/425 transitions.
Stuttering acceptance computed with spot in 250 ms :[p2, true, (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1) p2)), (OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=p2, acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s95 1)), p3:(AND (GEQ s1 1) (GEQ s125 1)), p0:(AND (GEQ s1 1) (GEQ s128 1)), p1:(AND (GEQ s1 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-03 finished in 785 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((X(F(p1))&&p0)))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 182 transition count 335
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 182 transition count 335
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 182 transition count 332
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 160 transition count 296
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 160 transition count 296
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 112 place count 160 transition count 283
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 125 place count 147 transition count 244
Iterating global reduction 2 with 13 rules applied. Total rules applied 138 place count 147 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 142 place count 147 transition count 240
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 140 transition count 231
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 140 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 140 transition count 227
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 163 place count 137 transition count 224
Iterating global reduction 4 with 3 rules applied. Total rules applied 166 place count 137 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 169 place count 137 transition count 221
Applied a total of 169 rules in 15 ms. Remains 137 /208 variables (removed 71) and now considering 221/425 (removed 204) transitions.
// Phase 1: matrix 221 rows 137 cols
[2023-03-08 03:18:16] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:18:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 03:18:16] [INFO ] Invariant cache hit.
[2023-03-08 03:18:16] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-08 03:18:17] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 03:18:17] [INFO ] Invariant cache hit.
[2023-03-08 03:18:17] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/208 places, 221/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 137/208 places, 221/425 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s135 1) (OR (GEQ s96 1) (GEQ s86 1))), p1:(AND (GEQ s1 1) (GEQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-04 finished in 605 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)&&F(G(p1)))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 182 transition count 335
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 182 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 333
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 160 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 160 transition count 297
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 112 place count 160 transition count 283
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 146 transition count 243
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 146 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 144 place count 146 transition count 239
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 152 place count 138 transition count 229
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 138 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 163 place count 138 transition count 226
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 133 transition count 221
Iterating global reduction 4 with 5 rules applied. Total rules applied 173 place count 133 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 179 place count 133 transition count 215
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 183 place count 129 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 187 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 189 place count 129 transition count 192
Applied a total of 189 rules in 43 ms. Remains 129 /208 variables (removed 79) and now considering 192/425 (removed 233) transitions.
// Phase 1: matrix 192 rows 129 cols
[2023-03-08 03:18:17] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:18:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 03:18:17] [INFO ] Invariant cache hit.
[2023-03-08 03:18:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 03:18:17] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 03:18:17] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 03:18:17] [INFO ] Invariant cache hit.
[2023-03-08 03:18:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/208 places, 192/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 469 ms. Remains : 129/208 places, 192/425 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s93 1)), p1:(AND (GEQ s1 1) (GEQ s120 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 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-05 finished in 587 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) U G(p1)))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 182 transition count 331
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 182 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 329
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 160 transition count 293
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 160 transition count 293
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 109 place count 160 transition count 282
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 123 place count 146 transition count 242
Iterating global reduction 2 with 14 rules applied. Total rules applied 137 place count 146 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 141 place count 146 transition count 238
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 149 place count 138 transition count 228
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 138 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 160 place count 138 transition count 225
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 165 place count 133 transition count 220
Iterating global reduction 4 with 5 rules applied. Total rules applied 170 place count 133 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 176 place count 133 transition count 214
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 180 place count 129 transition count 193
Iterating global reduction 5 with 4 rules applied. Total rules applied 184 place count 129 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 186 place count 129 transition count 191
Applied a total of 186 rules in 30 ms. Remains 129 /208 variables (removed 79) and now considering 191/425 (removed 234) transitions.
// Phase 1: matrix 191 rows 129 cols
[2023-03-08 03:18:17] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:18:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 03:18:17] [INFO ] Invariant cache hit.
[2023-03-08 03:18:17] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 03:18:18] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-08 03:18:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:18:18] [INFO ] Invariant cache hit.
[2023-03-08 03:18:18] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/208 places, 191/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 129/208 places, 191/425 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s120 1)), p0:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-06 finished in 515 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 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 181 transition count 318
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 181 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 316
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 159 transition count 284
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 159 transition count 284
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 159 transition count 272
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 145 transition count 232
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 145 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 144 place count 145 transition count 228
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 152 place count 137 transition count 217
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 137 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 137 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 167 place count 132 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 172 place count 132 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 178 place count 132 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 182 place count 128 transition count 183
Iterating global reduction 5 with 4 rules applied. Total rules applied 186 place count 128 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 188 place count 128 transition count 181
Applied a total of 188 rules in 31 ms. Remains 128 /208 variables (removed 80) and now considering 181/425 (removed 244) transitions.
// Phase 1: matrix 181 rows 128 cols
[2023-03-08 03:18:18] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 03:18:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 03:18:18] [INFO ] Invariant cache hit.
[2023-03-08 03:18:18] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 03:18:18] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 03:18:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:18:18] [INFO ] Invariant cache hit.
[2023-03-08 03:18:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/208 places, 181/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 128/208 places, 181/425 transitions.
Stuttering acceptance computed with spot in 159 ms :[p0]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s53 1) (GEQ s77 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 22962 reset in 233 ms.
Product exploration explored 100000 steps with 23010 reset in 186 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 29 ms :[p0]
Incomplete random walk after 10000 steps, including 2296 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 911 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1910 steps, run visited all 1 properties in 8 ms. (steps per millisecond=238 )
Probabilistic random walk after 1910 steps, saw 902 distinct states, run finished after 9 ms. (steps per millisecond=212 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 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 :[p0]
Stuttering acceptance computed with spot in 27 ms :[p0]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 181/181 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 03:18:19] [INFO ] Invariant cache hit.
[2023-03-08 03:18:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 03:18:19] [INFO ] Invariant cache hit.
[2023-03-08 03:18:19] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 03:18:20] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 03:18:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:18:20] [INFO ] Invariant cache hit.
[2023-03-08 03:18:20] [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 395 ms. Remains : 128/128 places, 181/181 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 26 ms :[p0]
Incomplete random walk after 10000 steps, including 2321 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1910 steps, run visited all 1 properties in 7 ms. (steps per millisecond=272 )
Probabilistic random walk after 1910 steps, saw 902 distinct states, run finished after 8 ms. (steps per millisecond=238 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 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 28 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 23076 reset in 136 ms.
Product exploration explored 100000 steps with 22897 reset in 144 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 03:18:20] [INFO ] Invariant cache hit.
[2023-03-08 03:18:20] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 03:18:20] [INFO ] Invariant cache hit.
[2023-03-08 03:18:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 03:18:21] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 03:18:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:18:21] [INFO ] Invariant cache hit.
[2023-03-08 03:18:21] [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 402 ms. Remains : 128/128 places, 181/181 transitions.
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-07 finished in 2970 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(X((G(F(p0))&&(p1||G(p2)))))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 182 transition count 324
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 182 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 182 transition count 321
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 76 place count 161 transition count 286
Iterating global reduction 1 with 21 rules applied. Total rules applied 97 place count 161 transition count 286
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 109 place count 161 transition count 274
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 148 transition count 237
Iterating global reduction 2 with 13 rules applied. Total rules applied 135 place count 148 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 138 place count 148 transition count 234
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 140 transition count 223
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 140 transition count 223
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 160 place count 140 transition count 217
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 136 transition count 213
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 136 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 173 place count 136 transition count 208
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 176 place count 133 transition count 194
Iterating global reduction 5 with 3 rules applied. Total rules applied 179 place count 133 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 181 place count 133 transition count 192
Applied a total of 181 rules in 8 ms. Remains 133 /208 variables (removed 75) and now considering 192/425 (removed 233) transitions.
// Phase 1: matrix 192 rows 133 cols
[2023-03-08 03:18:21] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:18:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 03:18:21] [INFO ] Invariant cache hit.
[2023-03-08 03:18:21] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-08 03:18:21] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 03:18:21] [INFO ] Invariant cache hit.
[2023-03-08 03:18:21] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/208 places, 192/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 133/208 places, 192/425 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=3 dest: 5}, { cond=(OR p1 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p2:(AND (GEQ s1 1) (GEQ s93 1)), p0:(AND (GEQ s1 1) (GEQ s87 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, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-09 finished in 743 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((F(p0)&&G(p1))))||G(p2)))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 183 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 183 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 183 transition count 327
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 163 transition count 294
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 163 transition count 294
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 104 place count 163 transition count 283
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 149 transition count 247
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 149 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 136 place count 149 transition count 243
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 144 place count 141 transition count 232
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 141 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 156 place count 141 transition count 228
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 137 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 137 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 170 place count 137 transition count 218
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 173 place count 134 transition count 205
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 134 transition count 205
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 134 transition count 203
Applied a total of 178 rules in 13 ms. Remains 134 /208 variables (removed 74) and now considering 203/425 (removed 222) transitions.
// Phase 1: matrix 203 rows 134 cols
[2023-03-08 03:18:22] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 03:18:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 03:18:22] [INFO ] Invariant cache hit.
[2023-03-08 03:18:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 03:18:22] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-08 03:18:22] [INFO ] Invariant cache hit.
[2023-03-08 03:18:22] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/208 places, 203/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 134/208 places, 203/425 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s96 1)), p1:(AND (GEQ s8 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 23094 reset in 206 ms.
Product exploration explored 100000 steps with 23009 reset in 201 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 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 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1150 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 955 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 451 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Probably explored full state space saw : 269930 states, properties seen :9
Probabilistic random walk after 676768 steps, saw 269930 distinct states, run finished after 2762 ms. (steps per millisecond=245 ) properties seen :9
Explored full state space saw : 270986 states, properties seen :0
Exhaustive walk after 678873 steps, saw 270986 distinct states, run finished after 2457 ms. (steps per millisecond=276 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p0) p2)), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 22 factoid took 1156 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-08 03:18:32] [INFO ] Invariant cache hit.
[2023-03-08 03:18:32] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:18:32] [INFO ] Invariant cache hit.
[2023-03-08 03:18:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 03:18:33] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 03:18:33] [INFO ] Invariant cache hit.
[2023-03-08 03:18:33] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 134/134 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 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 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) p2)), (X p2), (X (NOT p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 488 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 528 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 945 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Finished probabilistic random walk after 18080 steps, run visited all 7 properties in 156 ms. (steps per millisecond=115 )
Probabilistic random walk after 18080 steps, saw 8451 distinct states, run finished after 156 ms. (steps per millisecond=115 ) properties seen :7
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) p2)), (X p2), (X (NOT p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p1), (F (NOT p2)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 646 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 23089 reset in 170 ms.
Product exploration explored 100000 steps with 22965 reset in 164 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Applied a total of 0 rules in 24 ms. Remains 134 /134 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-08 03:18:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 134/134 places, 203/203 transitions.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 03:18:37] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 134/134 places, 203/203 transitions.
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-10 finished in 15823 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)||G(!p0))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 181 transition count 318
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 181 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 316
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 159 transition count 280
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 159 transition count 280
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 109 place count 159 transition count 271
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 121 place count 147 transition count 250
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 147 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 137 place count 147 transition count 246
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 146 place count 138 transition count 234
Iterating global reduction 3 with 9 rules applied. Total rules applied 155 place count 138 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 138 transition count 230
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 164 place count 133 transition count 225
Iterating global reduction 4 with 5 rules applied. Total rules applied 169 place count 133 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 175 place count 133 transition count 219
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 178 place count 130 transition count 203
Iterating global reduction 5 with 3 rules applied. Total rules applied 181 place count 130 transition count 203
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 201
Applied a total of 183 rules in 20 ms. Remains 130 /208 variables (removed 78) and now considering 201/425 (removed 224) transitions.
// Phase 1: matrix 201 rows 130 cols
[2023-03-08 03:18:37] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:18:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-08 03:18:38] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-08 03:18:38] [INFO ] Invariant cache hit.
[2023-03-08 03:18:38] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/208 places, 201/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 130/208 places, 201/425 transitions.
Stuttering acceptance computed with spot in 155 ms :[p1, false, false, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s26 1) (GEQ s53 1)), p0:(AND (GEQ s1 1) (GEQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 479 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-11 finished in 1236 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(G(p0)))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 181 transition count 318
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 181 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 316
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 159 transition count 280
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 159 transition count 280
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 111 place count 159 transition count 269
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 126 place count 144 transition count 228
Iterating global reduction 2 with 15 rules applied. Total rules applied 141 place count 144 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 145 place count 144 transition count 224
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 154 place count 135 transition count 212
Iterating global reduction 3 with 9 rules applied. Total rules applied 163 place count 135 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 167 place count 135 transition count 208
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 172 place count 130 transition count 203
Iterating global reduction 4 with 5 rules applied. Total rules applied 177 place count 130 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 183 place count 130 transition count 197
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 186 place count 127 transition count 183
Iterating global reduction 5 with 3 rules applied. Total rules applied 189 place count 127 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 191 place count 127 transition count 181
Applied a total of 191 rules in 17 ms. Remains 127 /208 variables (removed 81) and now considering 181/425 (removed 244) transitions.
// Phase 1: matrix 181 rows 127 cols
[2023-03-08 03:18:39] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:18:39] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 03:18:39] [INFO ] Invariant cache hit.
[2023-03-08 03:18:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:18:39] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-08 03:18:39] [INFO ] Invariant cache hit.
[2023-03-08 03:18:39] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/208 places, 181/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 127/208 places, 181/425 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-14 finished in 754 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 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 182 transition count 319
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 182 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 317
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 161 transition count 282
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 161 transition count 282
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 161 transition count 272
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 148 transition count 246
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 148 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 136 place count 148 transition count 242
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 139 transition count 230
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 139 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 139 transition count 226
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 163 place count 134 transition count 221
Iterating global reduction 4 with 5 rules applied. Total rules applied 168 place count 134 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 174 place count 134 transition count 215
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 178 place count 130 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 182 place count 130 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 184 place count 130 transition count 192
Applied a total of 184 rules in 36 ms. Remains 130 /208 variables (removed 78) and now considering 192/425 (removed 233) transitions.
// Phase 1: matrix 192 rows 130 cols
[2023-03-08 03:18:39] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:18:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 03:18:39] [INFO ] Invariant cache hit.
[2023-03-08 03:18:40] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 03:18:40] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 03:18:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:18:40] [INFO ] Invariant cache hit.
[2023-03-08 03:18:40] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/208 places, 192/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 130/208 places, 192/425 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s54 1)) (AND (GEQ s9 1) (GEQ s54 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 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-15 finished in 490 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' '!((X(F((F(p0)&&G(p1))))||G(p2)))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m05-LTLFireability-10
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 208/208 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 183 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 183 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 183 transition count 327
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 163 transition count 294
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 163 transition count 294
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 104 place count 163 transition count 283
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 149 transition count 247
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 149 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 136 place count 149 transition count 243
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 144 place count 141 transition count 232
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 141 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 156 place count 141 transition count 228
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 137 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 137 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 170 place count 137 transition count 218
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 173 place count 134 transition count 205
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 134 transition count 205
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 134 transition count 203
Applied a total of 178 rules in 21 ms. Remains 134 /208 variables (removed 74) and now considering 203/425 (removed 222) transitions.
// Phase 1: matrix 203 rows 134 cols
[2023-03-08 03:18:40] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:18:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 03:18:40] [INFO ] Invariant cache hit.
[2023-03-08 03:18:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 03:18:41] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 03:18:41] [INFO ] Invariant cache hit.
[2023-03-08 03:18:41] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/208 places, 203/425 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 457 ms. Remains : 134/208 places, 203/425 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s96 1)), p1:(AND (GEQ s8 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22958 reset in 196 ms.
Product exploration explored 100000 steps with 23110 reset in 206 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 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 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 892 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 986 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Probably explored full state space saw : 269930 states, properties seen :9
Probabilistic random walk after 676768 steps, saw 269930 distinct states, run finished after 2527 ms. (steps per millisecond=267 ) properties seen :9
Explored full state space saw : 270986 states, properties seen :0
Exhaustive walk after 678873 steps, saw 270986 distinct states, run finished after 2148 ms. (steps per millisecond=316 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p0) p2)), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 22 factoid took 1250 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 134 /134 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-08 03:18:50] [INFO ] Invariant cache hit.
[2023-03-08 03:18:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 03:18:50] [INFO ] Invariant cache hit.
[2023-03-08 03:18:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 03:18:50] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 03:18:50] [INFO ] Invariant cache hit.
[2023-03-08 03:18:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 134/134 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 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 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) p2)), (X p2), (X (NOT p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 485 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 425 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 401 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Finished probabilistic random walk after 18080 steps, run visited all 7 properties in 156 ms. (steps per millisecond=115 )
Probabilistic random walk after 18080 steps, saw 8451 distinct states, run finished after 156 ms. (steps per millisecond=115 ) properties seen :7
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p1) p2)), (X p2), (X (NOT p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p1), (F (NOT p2)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 626 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 22968 reset in 178 ms.
Product exploration explored 100000 steps with 22978 reset in 173 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 403 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-08 03:18:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:18:54] [INFO ] Invariant cache hit.
[2023-03-08 03:18:54] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 134/134 places, 203/203 transitions.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Applied a total of 0 rules in 0 ms. Remains 134 /134 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-08 03:18:54] [INFO ] Invariant cache hit.
[2023-03-08 03:18:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 03:18:54] [INFO ] Invariant cache hit.
[2023-03-08 03:18:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 03:18:55] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-08 03:18:55] [INFO ] Invariant cache hit.
[2023-03-08 03:18:55] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 134/134 places, 203/203 transitions.
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-10 finished in 14746 ms.
[2023-03-08 03:18:55] [INFO ] Flatten gal took : 23 ms
[2023-03-08 03:18:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 03:18:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 425 transitions and 1672 arcs took 4 ms.
Total runtime 48880 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d2m05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA DBSingleClientW-PT-d2m05-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1678245536324

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 DBSingleClientW-PT-d2m05-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DBSingleClientW-PT-d2m05-LTLFireability-10
lola: result : false
lola: markings : 5324
lola: fired transitions : 21161
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d2m05-LTLFireability-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d2m05-LTLFireability-07
lola: result : false
lola: markings : 1614
lola: fired transitions : 3012
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m05-LTLFireability-07: LTL false LTL model checker
DBSingleClientW-PT-d2m05-LTLFireability-10: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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

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