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.r105-tall-167814481000324.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 ltsminxred
Input is DBSingleClientW-PT-d2m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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-d2m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678278525094

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 12:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 12:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:28:47] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2023-03-08 12:28:47] [INFO ] Transformed 4763 places.
[2023-03-08 12:28:47] [INFO ] Transformed 2478 transitions.
[2023-03-08 12:28:47] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 427 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 3 formulas.
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 370 places :
Symmetric choice reduction at 1 with 370 rule applications. Total rules 615 place count 767 transition count 1482
Iterating global reduction 1 with 370 rules applied. Total rules applied 985 place count 767 transition count 1482
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 1048 place count 767 transition count 1419
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1347 place count 468 transition count 1120
Iterating global reduction 2 with 299 rules applied. Total rules applied 1646 place count 468 transition count 1120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1654 place count 468 transition count 1112
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 1876 place count 246 transition count 800
Iterating global reduction 3 with 222 rules applied. Total rules applied 2098 place count 246 transition count 800
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 3 with 286 rules applied. Total rules applied 2384 place count 246 transition count 514
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2397 place count 233 transition count 494
Iterating global reduction 4 with 13 rules applied. Total rules applied 2410 place count 233 transition count 494
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2431 place count 233 transition count 473
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2441 place count 223 transition count 463
Iterating global reduction 5 with 10 rules applied. Total rules applied 2451 place count 223 transition count 463
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2455 place count 223 transition count 459
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2462 place count 216 transition count 452
Iterating global reduction 6 with 7 rules applied. Total rules applied 2469 place count 216 transition count 452
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2477 place count 216 transition count 444
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2480 place count 213 transition count 435
Iterating global reduction 7 with 3 rules applied. Total rules applied 2483 place count 213 transition count 435
Applied a total of 2483 rules in 210 ms. Remains 213 /1183 variables (removed 970) and now considering 435/2478 (removed 2043) transitions.
// Phase 1: matrix 435 rows 213 cols
[2023-03-08 12:28:47] [INFO ] Computed 2 place invariants in 24 ms
[2023-03-08 12:28:47] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-08 12:28:47] [INFO ] Invariant cache hit.
[2023-03-08 12:28:48] [INFO ] State equation strengthened by 236 read => feed constraints.
[2023-03-08 12:28:48] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2023-03-08 12:28:48] [INFO ] Invariant cache hit.
[2023-03-08 12:28:48] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/1183 places, 435/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1694 ms. Remains : 213/1183 places, 435/2478 transitions.
Support contains 34 out of 213 places after structural reductions.
[2023-03-08 12:28:49] [INFO ] Flatten gal took : 80 ms
[2023-03-08 12:28:49] [INFO ] Flatten gal took : 29 ms
[2023-03-08 12:28:49] [INFO ] Input system was already deterministic with 435 transitions.
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 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 42 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 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 7 ms. (steps per millisecond=143 ) 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 1001 steps, including 83 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 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 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 47 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 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 41 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 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 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 85 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 100 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 38 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 48 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 43 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 44 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 49 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 637303 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1}
Probabilistic random walk after 637303 steps, saw 249686 distinct states, run finished after 3002 ms. (steps per millisecond=212 ) properties seen :27
Running SMT prover for 2 properties.
[2023-03-08 12:28:53] [INFO ] Invariant cache hit.
[2023-03-08 12:28:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 12:28:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 12:28:53] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 34 stable transitions
Graph (complete) has 862 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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) U (p1 U X(X(p2)))))&&F(!p2)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 327
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 327
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 188 transition count 324
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 171 transition count 301
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 171 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 171 transition count 295
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 107 place count 157 transition count 274
Iterating global reduction 2 with 14 rules applied. Total rules applied 121 place count 157 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 157 transition count 268
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 138 place count 146 transition count 241
Iterating global reduction 3 with 11 rules applied. Total rules applied 149 place count 146 transition count 241
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 146 transition count 235
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 160 place count 141 transition count 230
Iterating global reduction 4 with 5 rules applied. Total rules applied 165 place count 141 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 169 place count 141 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 173 place count 137 transition count 205
Iterating global reduction 5 with 4 rules applied. Total rules applied 177 place count 137 transition count 205
Applied a total of 177 rules in 13 ms. Remains 137 /213 variables (removed 76) and now considering 205/435 (removed 230) transitions.
// Phase 1: matrix 205 rows 137 cols
[2023-03-08 12:28:53] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:28:54] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 12:28:54] [INFO ] Invariant cache hit.
[2023-03-08 12:28:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 12:28:54] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-08 12:28:54] [INFO ] Invariant cache hit.
[2023-03-08 12:28:54] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/213 places, 205/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 137/213 places, 205/435 transitions.
Stuttering acceptance computed with spot in 517 ms :[true, (NOT p2), p2, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s1 1) (GEQ s129 1)), p0:(AND (GEQ s1 1) (GEQ s135 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 5 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-00 finished in 1234 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))&&(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 329
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 188 transition count 325
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 170 transition count 295
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 170 transition count 295
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 95 place count 170 transition count 290
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 109 place count 156 transition count 268
Iterating global reduction 2 with 14 rules applied. Total rules applied 123 place count 156 transition count 268
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 156 transition count 261
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 140 place count 146 transition count 239
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 146 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 146 transition count 237
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 158 place count 140 transition count 231
Iterating global reduction 4 with 6 rules applied. Total rules applied 164 place count 140 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 168 place count 140 transition count 227
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 173 place count 135 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 178 place count 135 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 181 place count 135 transition count 202
Applied a total of 181 rules in 60 ms. Remains 135 /213 variables (removed 78) and now considering 202/435 (removed 233) transitions.
// Phase 1: matrix 202 rows 135 cols
[2023-03-08 12:28:55] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:28:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 12:28:55] [INFO ] Invariant cache hit.
[2023-03-08 12:28:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 12:28:55] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-08 12:28:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 12:28:55] [INFO ] Invariant cache hit.
[2023-03-08 12:28:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/213 places, 202/435 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 135/213 places, 202/435 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s123 1))) (NOT (OR (AND (GEQ s1 1) (GEQ s128 1)) (AND (GEQ s1 1) (GEQ s95 1))))), p1:(OR (AND (GEQ s1 1) (GEQ s128 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-01 finished in 706 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 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 314
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 186 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 77 place count 167 transition count 280
Iterating global reduction 1 with 19 rules applied. Total rules applied 96 place count 167 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 167 transition count 275
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 117 place count 151 transition count 251
Iterating global reduction 2 with 16 rules applied. Total rules applied 133 place count 151 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 151 transition count 244
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 152 place count 139 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 164 place count 139 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 139 transition count 212
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 174 place count 132 transition count 205
Iterating global reduction 4 with 7 rules applied. Total rules applied 181 place count 132 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 185 place count 132 transition count 201
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 190 place count 127 transition count 185
Iterating global reduction 5 with 5 rules applied. Total rules applied 195 place count 127 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 198 place count 127 transition count 182
Applied a total of 198 rules in 21 ms. Remains 127 /213 variables (removed 86) and now considering 182/435 (removed 253) transitions.
// Phase 1: matrix 182 rows 127 cols
[2023-03-08 12:28:55] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 12:28:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 12:28:55] [INFO ] Invariant cache hit.
[2023-03-08 12:28:55] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:28:56] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-08 12:28:56] [INFO ] Invariant cache hit.
[2023-03-08 12:28:56] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/213 places, 182/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 127/213 places, 182/435 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s8 1) (LT 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]]
Product exploration explored 100000 steps with 23015 reset in 327 ms.
Product exploration explored 100000 steps with 22999 reset in 215 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41369 steps, run visited all 1 properties in 84 ms. (steps per millisecond=492 )
Probabilistic random walk after 41369 steps, saw 19278 distinct states, run finished after 84 ms. (steps per millisecond=492 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:28:57] [INFO ] Invariant cache hit.
[2023-03-08 12:28:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 12:28:57] [INFO ] Invariant cache hit.
[2023-03-08 12:28:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:28:57] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 12:28:57] [INFO ] Invariant cache hit.
[2023-03-08 12:28:58] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41369 steps, run visited all 1 properties in 82 ms. (steps per millisecond=504 )
Probabilistic random walk after 41369 steps, saw 19278 distinct states, run finished after 82 ms. (steps per millisecond=504 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22901 reset in 151 ms.
Product exploration explored 100000 steps with 23001 reset in 172 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 26 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:28:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 12:28:59] [INFO ] Invariant cache hit.
[2023-03-08 12:28:59] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 127/127 places, 182/182 transitions.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:28:59] [INFO ] Invariant cache hit.
[2023-03-08 12:28:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 12:28:59] [INFO ] Invariant cache hit.
[2023-03-08 12:28:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:29:00] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 12:29:00] [INFO ] Invariant cache hit.
[2023-03-08 12:29:00] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 127/127 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-03 finished in 4562 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||(X((X(p2)||p1))&&(!p3 U (p4||G(!p3)))))))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 189 transition count 327
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 189 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 189 transition count 323
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 173 transition count 298
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 173 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 173 transition count 292
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 161 transition count 274
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 161 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 161 transition count 270
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 127 place count 152 transition count 251
Iterating global reduction 3 with 9 rules applied. Total rules applied 136 place count 152 transition count 251
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 145 place count 152 transition count 242
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 149 place count 148 transition count 238
Iterating global reduction 4 with 4 rules applied. Total rules applied 153 place count 148 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 146 transition count 236
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 146 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 146 transition count 235
Applied a total of 158 rules in 20 ms. Remains 146 /213 variables (removed 67) and now considering 235/435 (removed 200) transitions.
// Phase 1: matrix 235 rows 146 cols
[2023-03-08 12:29:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:29:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 12:29:00] [INFO ] Invariant cache hit.
[2023-03-08 12:29:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-08 12:29:00] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-08 12:29:00] [INFO ] Invariant cache hit.
[2023-03-08 12:29:00] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/213 places, 235/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 146/213 places, 235/435 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3 (NOT p4))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p4) p3), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p0) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p4) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s140 1)), p4:(AND (NOT (AND (GEQ s1 1) (GEQ s139 1))) (NOT (AND (GEQ s27 1) (GEQ s119 1)))), p3:(AND (GEQ s27 1) (GEQ s119 1)), p1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 285 ms.
Product exploration explored 100000 steps with 33333 reset in 258 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 544 edges and 146 vertex of which 145 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 p0) p4 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X (OR (AND (NOT p0) p4) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p3)))), true, (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p4) p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 8 factoid took 219 ms. Reduced automaton from 6 states, 9 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-04 finished in 1565 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 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 324
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 186 transition count 319
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 166 transition count 287
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 166 transition count 287
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 106 place count 166 transition count 280
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 122 place count 150 transition count 256
Iterating global reduction 2 with 16 rules applied. Total rules applied 138 place count 150 transition count 256
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 146 place count 150 transition count 248
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 158 place count 138 transition count 219
Iterating global reduction 3 with 12 rules applied. Total rules applied 170 place count 138 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 173 place count 138 transition count 216
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 180 place count 131 transition count 209
Iterating global reduction 4 with 7 rules applied. Total rules applied 187 place count 131 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 131 transition count 205
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 197 place count 125 transition count 182
Iterating global reduction 5 with 6 rules applied. Total rules applied 203 place count 125 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 206 place count 125 transition count 179
Applied a total of 206 rules in 25 ms. Remains 125 /213 variables (removed 88) and now considering 179/435 (removed 256) transitions.
// Phase 1: matrix 179 rows 125 cols
[2023-03-08 12:29:01] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:29:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 12:29:01] [INFO ] Invariant cache hit.
[2023-03-08 12:29:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:29:02] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-08 12:29:02] [INFO ] Invariant cache hit.
[2023-03-08 12:29:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/213 places, 179/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 125/213 places, 179/435 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-07 finished in 539 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 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 314
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 186 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 77 place count 167 transition count 279
Iterating global reduction 1 with 19 rules applied. Total rules applied 96 place count 167 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 167 transition count 273
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 117 place count 152 transition count 251
Iterating global reduction 2 with 15 rules applied. Total rules applied 132 place count 152 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 152 transition count 245
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 150 place count 140 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 162 place count 140 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 165 place count 140 transition count 213
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 171 place count 134 transition count 207
Iterating global reduction 4 with 6 rules applied. Total rules applied 177 place count 134 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 181 place count 134 transition count 203
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 186 place count 129 transition count 181
Iterating global reduction 5 with 5 rules applied. Total rules applied 191 place count 129 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 193 place count 129 transition count 179
Applied a total of 193 rules in 21 ms. Remains 129 /213 variables (removed 84) and now considering 179/435 (removed 256) transitions.
// Phase 1: matrix 179 rows 129 cols
[2023-03-08 12:29:02] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:29:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 12:29:02] [INFO ] Invariant cache hit.
[2023-03-08 12:29:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-08 12:29:02] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 12:29:02] [INFO ] Invariant cache hit.
[2023-03-08 12:29:02] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/213 places, 179/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 129/213 places, 179/435 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-08 finished in 514 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&&X((X(F(p1)) U (G(!p2)||(!p2&&F(!p1)))))))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 329
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 329
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 188 transition count 326
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 169 transition count 295
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 169 transition count 295
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 169 transition count 290
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 111 place count 154 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 126 place count 154 transition count 267
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 133 place count 154 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 143 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 143 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 143 transition count 231
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 164 place count 136 transition count 224
Iterating global reduction 4 with 7 rules applied. Total rules applied 171 place count 136 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 175 place count 136 transition count 220
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 180 place count 131 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 185 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 188 place count 131 transition count 202
Applied a total of 188 rules in 43 ms. Remains 131 /213 variables (removed 82) and now considering 202/435 (removed 233) transitions.
// Phase 1: matrix 202 rows 131 cols
[2023-03-08 12:29:02] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 12:29:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 12:29:03] [INFO ] Invariant cache hit.
[2023-03-08 12:29:03] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 12:29:03] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 12:29:03] [INFO ] Invariant cache hit.
[2023-03-08 12:29:03] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/213 places, 202/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 131/213 places, 202/435 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s97 1)), p2:(AND (GEQ s1 1) (GEQ s70 1)), p1:(AND (GEQ s1 1) (GEQ s122 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]]
Product exploration explored 100000 steps with 29820 reset in 230 ms.
Product exploration explored 100000 steps with 29795 reset in 209 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 485 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Finished probabilistic random walk after 41971 steps, run visited all 5 properties in 242 ms. (steps per millisecond=173 )
Probabilistic random walk after 41971 steps, saw 19766 distinct states, run finished after 242 ms. (steps per millisecond=173 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (NOT p0)), (F (AND (NOT p2) p1)), (F p2)]
Knowledge based reduction with 6 factoid took 394 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:29:06] [INFO ] Invariant cache hit.
[2023-03-08 12:29:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 12:29:06] [INFO ] Invariant cache hit.
[2023-03-08 12:29:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 12:29:06] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-08 12:29:06] [INFO ] Invariant cache hit.
[2023-03-08 12:29:06] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 131/131 places, 202/202 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 485 edges and 131 vertex of which 130 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 p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 440 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Finished probabilistic random walk after 41971 steps, run visited all 5 properties in 196 ms. (steps per millisecond=214 )
Probabilistic random walk after 41971 steps, saw 19766 distinct states, run finished after 196 ms. (steps per millisecond=214 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (NOT p0)), (F (AND (NOT p2) p1)), (F p2)]
Knowledge based reduction with 6 factoid took 407 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Product exploration explored 100000 steps with 29687 reset in 192 ms.
Product exploration explored 100000 steps with 29757 reset in 192 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:29:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:29:09] [INFO ] Invariant cache hit.
[2023-03-08 12:29:09] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 131/131 places, 202/202 transitions.
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:29:09] [INFO ] Invariant cache hit.
[2023-03-08 12:29:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 12:29:10] [INFO ] Invariant cache hit.
[2023-03-08 12:29:10] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 12:29:10] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-08 12:29:10] [INFO ] Invariant cache hit.
[2023-03-08 12:29:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 131/131 places, 202/202 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-09 finished in 7567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&G(p1)))||F(!p0)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 314
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 186 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 77 place count 167 transition count 279
Iterating global reduction 1 with 19 rules applied. Total rules applied 96 place count 167 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 167 transition count 274
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 115 place count 153 transition count 254
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 153 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 153 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 145 place count 143 transition count 222
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 143 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 143 transition count 220
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 163 place count 137 transition count 214
Iterating global reduction 4 with 6 rules applied. Total rules applied 169 place count 137 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 172 place count 137 transition count 211
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 178 place count 131 transition count 188
Iterating global reduction 5 with 6 rules applied. Total rules applied 184 place count 131 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 187 place count 131 transition count 185
Applied a total of 187 rules in 9 ms. Remains 131 /213 variables (removed 82) and now considering 185/435 (removed 250) transitions.
// Phase 1: matrix 185 rows 131 cols
[2023-03-08 12:29:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:29:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 12:29:10] [INFO ] Invariant cache hit.
[2023-03-08 12:29:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:29:10] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-08 12:29:10] [INFO ] Invariant cache hit.
[2023-03-08 12:29:10] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/213 places, 185/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 131/213 places, 185/435 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s49 1) (LT s55 1)), p1:(OR (LT s45 1) (LT s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23085 reset in 160 ms.
Product exploration explored 100000 steps with 22973 reset in 171 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21060 steps, run visited all 3 properties in 82 ms. (steps per millisecond=256 )
Probabilistic random walk after 21060 steps, saw 10400 distinct states, run finished after 83 ms. (steps per millisecond=253 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 12:29:12] [INFO ] Invariant cache hit.
[2023-03-08 12:29:12] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 12:29:12] [INFO ] Invariant cache hit.
[2023-03-08 12:29:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:29:13] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-08 12:29:13] [INFO ] Invariant cache hit.
[2023-03-08 12:29:13] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 131/131 places, 185/185 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21060 steps, run visited all 3 properties in 63 ms. (steps per millisecond=334 )
Probabilistic random walk after 21060 steps, saw 10400 distinct states, run finished after 63 ms. (steps per millisecond=334 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 302 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22926 reset in 158 ms.
Product exploration explored 100000 steps with 23001 reset in 163 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 12:29:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:29:15] [INFO ] Invariant cache hit.
[2023-03-08 12:29:15] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 131/131 places, 185/185 transitions.
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 12:29:15] [INFO ] Invariant cache hit.
[2023-03-08 12:29:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 12:29:15] [INFO ] Invariant cache hit.
[2023-03-08 12:29:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:29:15] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 12:29:15] [INFO ] Invariant cache hit.
[2023-03-08 12:29:15] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 131/131 places, 185/185 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-11 finished in 5280 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)) U p1)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 320
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 186 transition count 316
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 77 place count 167 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 96 place count 167 transition count 285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 167 transition count 279
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 117 place count 152 transition count 256
Iterating global reduction 2 with 15 rules applied. Total rules applied 132 place count 152 transition count 256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 139 place count 152 transition count 249
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 150 place count 141 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 161 place count 141 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 164 place count 141 transition count 222
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 170 place count 135 transition count 216
Iterating global reduction 4 with 6 rules applied. Total rules applied 176 place count 135 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 180 place count 135 transition count 212
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 185 place count 130 transition count 190
Iterating global reduction 5 with 5 rules applied. Total rules applied 190 place count 130 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 193 place count 130 transition count 187
Applied a total of 193 rules in 13 ms. Remains 130 /213 variables (removed 83) and now considering 187/435 (removed 248) transitions.
// Phase 1: matrix 187 rows 130 cols
[2023-03-08 12:29:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:29:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 12:29:15] [INFO ] Invariant cache hit.
[2023-03-08 12:29:15] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 12:29:16] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-08 12:29:16] [INFO ] Invariant cache hit.
[2023-03-08 12:29:16] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/213 places, 187/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 130/213 places, 187/435 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s124 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-12 finished in 635 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) U (X(p2)&&p1)))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 189 transition count 329
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 189 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 189 transition count 326
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 68 place count 172 transition count 298
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 172 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 172 transition count 292
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 105 place count 158 transition count 271
Iterating global reduction 2 with 14 rules applied. Total rules applied 119 place count 158 transition count 271
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 126 place count 158 transition count 264
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 135 place count 149 transition count 239
Iterating global reduction 3 with 9 rules applied. Total rules applied 144 place count 149 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 150 place count 149 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 154 place count 145 transition count 229
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 145 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 161 place count 145 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 165 place count 141 transition count 211
Iterating global reduction 5 with 4 rules applied. Total rules applied 169 place count 141 transition count 211
Applied a total of 169 rules in 16 ms. Remains 141 /213 variables (removed 72) and now considering 211/435 (removed 224) transitions.
// Phase 1: matrix 211 rows 141 cols
[2023-03-08 12:29:16] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 12:29:16] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 12:29:16] [INFO ] Invariant cache hit.
[2023-03-08 12:29:16] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 12:29:16] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-08 12:29:16] [INFO ] Invariant cache hit.
[2023-03-08 12:29:16] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/213 places, 211/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 141/213 places, 211/435 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s75 1)), p0:(AND (OR (AND (GEQ s43 1) (GEQ s86 1)) (AND (GEQ s1 1) (GEQ s139 1))) (NOT (AND (GEQ s1 1) (GEQ s133 1)))), p2:(AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-13 finished in 763 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||X(p1)))||G(p2))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 336
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 188 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 170 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 170 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 170 transition count 296
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 156 transition count 275
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 156 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 156 transition count 269
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 140 place count 146 transition count 243
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 146 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 154 place count 146 transition count 239
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 160 place count 140 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 166 place count 140 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 170 place count 140 transition count 229
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 176 place count 134 transition count 206
Iterating global reduction 5 with 6 rules applied. Total rules applied 182 place count 134 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 185 place count 134 transition count 203
Applied a total of 185 rules in 15 ms. Remains 134 /213 variables (removed 79) and now considering 203/435 (removed 232) transitions.
// Phase 1: matrix 203 rows 134 cols
[2023-03-08 12:29:17] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:29:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 12:29:17] [INFO ] Invariant cache hit.
[2023-03-08 12:29:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:29:17] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-08 12:29:17] [INFO ] Invariant cache hit.
[2023-03-08 12:29:17] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/213 places, 203/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 134/213 places, 203/435 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s124 1)), p2:(AND (GEQ s1 1) (GEQ s127 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23043 reset in 260 ms.
Product exploration explored 100000 steps with 23038 reset in 334 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 968 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 430 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 410 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 695393 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Probabilistic random walk after 695393 steps, saw 271050 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :10
Running SMT prover for 2 properties.
[2023-03-08 12:29:23] [INFO ] Invariant cache hit.
[2023-03-08 12:29:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 12:29:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 12:29:23] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 12:29:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-08 12:29:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 12:29:23] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 27 factoid took 1447 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 12:29:25] [INFO ] Invariant cache hit.
[2023-03-08 12:29:25] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 12:29:25] [INFO ] Invariant cache hit.
[2023-03-08 12:29:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:29:25] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 12:29:25] [INFO ] Invariant cache hit.
[2023-03-08 12:29:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 134/134 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 390 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 405 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Finished probabilistic random walk after 31768 steps, run visited all 5 properties in 241 ms. (steps per millisecond=131 )
Probabilistic random walk after 31768 steps, saw 15500 distinct states, run finished after 241 ms. (steps per millisecond=131 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 520 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22907 reset in 208 ms.
Product exploration explored 100000 steps with 22918 reset in 207 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 132 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 132 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 131 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 131 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 131 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 130 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 130 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 129 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 129 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 129 transition count 192
Applied a total of 12 rules in 13 ms. Remains 129 /134 variables (removed 5) and now considering 192/203 (removed 11) transitions.
// Phase 1: matrix 192 rows 129 cols
[2023-03-08 12:29:28] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 12:29:28] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 12:29:28] [INFO ] Invariant cache hit.
[2023-03-08 12:29:28] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 12:29:28] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-08 12:29:28] [INFO ] Invariant cache hit.
[2023-03-08 12:29:28] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/134 places, 192/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 129/134 places, 192/203 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-15 finished in 11429 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)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m08-LTLFireability-03
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 314
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 186 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 77 place count 167 transition count 280
Iterating global reduction 1 with 19 rules applied. Total rules applied 96 place count 167 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 167 transition count 275
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 117 place count 151 transition count 251
Iterating global reduction 2 with 16 rules applied. Total rules applied 133 place count 151 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 151 transition count 244
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 152 place count 139 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 164 place count 139 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 139 transition count 212
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 174 place count 132 transition count 205
Iterating global reduction 4 with 7 rules applied. Total rules applied 181 place count 132 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 185 place count 132 transition count 201
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 190 place count 127 transition count 185
Iterating global reduction 5 with 5 rules applied. Total rules applied 195 place count 127 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 198 place count 127 transition count 182
Applied a total of 198 rules in 41 ms. Remains 127 /213 variables (removed 86) and now considering 182/435 (removed 253) transitions.
// Phase 1: matrix 182 rows 127 cols
[2023-03-08 12:29:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:29:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 12:29:28] [INFO ] Invariant cache hit.
[2023-03-08 12:29:28] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:29:29] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 12:29:29] [INFO ] Invariant cache hit.
[2023-03-08 12:29:29] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 127/213 places, 182/435 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 449 ms. Remains : 127/213 places, 182/435 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s8 1) (LT 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22949 reset in 148 ms.
Product exploration explored 100000 steps with 22994 reset in 152 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41369 steps, run visited all 1 properties in 79 ms. (steps per millisecond=523 )
Probabilistic random walk after 41369 steps, saw 19278 distinct states, run finished after 79 ms. (steps per millisecond=523 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:29:30] [INFO ] Invariant cache hit.
[2023-03-08 12:29:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 12:29:30] [INFO ] Invariant cache hit.
[2023-03-08 12:29:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:29:30] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-08 12:29:30] [INFO ] Invariant cache hit.
[2023-03-08 12:29:30] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 990 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41369 steps, run visited all 1 properties in 72 ms. (steps per millisecond=574 )
Probabilistic random walk after 41369 steps, saw 19278 distinct states, run finished after 73 ms. (steps per millisecond=566 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22927 reset in 148 ms.
Product exploration explored 100000 steps with 23044 reset in 155 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:29:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:29:31] [INFO ] Invariant cache hit.
[2023-03-08 12:29:32] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 127/127 places, 182/182 transitions.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:29:32] [INFO ] Invariant cache hit.
[2023-03-08 12:29:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 12:29:32] [INFO ] Invariant cache hit.
[2023-03-08 12:29:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:29:32] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 12:29:32] [INFO ] Invariant cache hit.
[2023-03-08 12:29:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 127/127 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-03 finished in 4016 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&&X((X(F(p1)) U (G(!p2)||(!p2&&F(!p1)))))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m08-LTLFireability-09
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 329
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 329
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 188 transition count 326
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 169 transition count 295
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 169 transition count 295
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 169 transition count 290
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 111 place count 154 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 126 place count 154 transition count 267
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 133 place count 154 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 143 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 143 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 143 transition count 231
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 164 place count 136 transition count 224
Iterating global reduction 4 with 7 rules applied. Total rules applied 171 place count 136 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 175 place count 136 transition count 220
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 180 place count 131 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 185 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 188 place count 131 transition count 202
Applied a total of 188 rules in 28 ms. Remains 131 /213 variables (removed 82) and now considering 202/435 (removed 233) transitions.
// Phase 1: matrix 202 rows 131 cols
[2023-03-08 12:29:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:29:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 12:29:32] [INFO ] Invariant cache hit.
[2023-03-08 12:29:33] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 12:29:33] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-08 12:29:33] [INFO ] Invariant cache hit.
[2023-03-08 12:29:33] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 131/213 places, 202/435 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 496 ms. Remains : 131/213 places, 202/435 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s97 1)), p2:(AND (GEQ s1 1) (GEQ s70 1)), p1:(AND (GEQ s1 1) (GEQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29846 reset in 182 ms.
Product exploration explored 100000 steps with 29818 reset in 192 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 485 edges and 131 vertex of which 130 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 p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 441 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Finished probabilistic random walk after 41971 steps, run visited all 5 properties in 217 ms. (steps per millisecond=193 )
Probabilistic random walk after 41971 steps, saw 19766 distinct states, run finished after 217 ms. (steps per millisecond=193 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (NOT p0)), (F (AND (NOT p2) p1)), (F p2)]
Knowledge based reduction with 6 factoid took 449 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:29:35] [INFO ] Invariant cache hit.
[2023-03-08 12:29:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 12:29:35] [INFO ] Invariant cache hit.
[2023-03-08 12:29:35] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 12:29:36] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 12:29:36] [INFO ] Invariant cache hit.
[2023-03-08 12:29:36] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 131/131 places, 202/202 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 485 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 426 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Finished probabilistic random walk after 41971 steps, run visited all 5 properties in 219 ms. (steps per millisecond=191 )
Probabilistic random walk after 41971 steps, saw 19766 distinct states, run finished after 219 ms. (steps per millisecond=191 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (NOT p0)), (F (AND (NOT p2) p1)), (F p2)]
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Product exploration explored 100000 steps with 29791 reset in 187 ms.
Product exploration explored 100000 steps with 29796 reset in 191 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (NOT p1), (AND p2 p1)]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:29:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:29:39] [INFO ] Invariant cache hit.
[2023-03-08 12:29:39] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 131/131 places, 202/202 transitions.
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:29:39] [INFO ] Invariant cache hit.
[2023-03-08 12:29:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 12:29:39] [INFO ] Invariant cache hit.
[2023-03-08 12:29:39] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 12:29:39] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 12:29:39] [INFO ] Invariant cache hit.
[2023-03-08 12:29:39] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 131/131 places, 202/202 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-09 finished in 7117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&G(p1)))||F(!p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m08-LTLFireability-11
Stuttering acceptance computed with spot in 110 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 314
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 186 transition count 310
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 77 place count 167 transition count 279
Iterating global reduction 1 with 19 rules applied. Total rules applied 96 place count 167 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 167 transition count 274
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 115 place count 153 transition count 254
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 153 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 153 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 145 place count 143 transition count 222
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 143 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 143 transition count 220
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 163 place count 137 transition count 214
Iterating global reduction 4 with 6 rules applied. Total rules applied 169 place count 137 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 172 place count 137 transition count 211
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 178 place count 131 transition count 188
Iterating global reduction 5 with 6 rules applied. Total rules applied 184 place count 131 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 187 place count 131 transition count 185
Applied a total of 187 rules in 24 ms. Remains 131 /213 variables (removed 82) and now considering 185/435 (removed 250) transitions.
// Phase 1: matrix 185 rows 131 cols
[2023-03-08 12:29:39] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:29:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 12:29:39] [INFO ] Invariant cache hit.
[2023-03-08 12:29:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:29:40] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 12:29:40] [INFO ] Invariant cache hit.
[2023-03-08 12:29:40] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 131/213 places, 185/435 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 424 ms. Remains : 131/213 places, 185/435 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s49 1) (LT s55 1)), p1:(OR (LT s45 1) (LT s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22917 reset in 161 ms.
Product exploration explored 100000 steps with 22907 reset in 177 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21060 steps, run visited all 3 properties in 72 ms. (steps per millisecond=292 )
Probabilistic random walk after 21060 steps, saw 10400 distinct states, run finished after 72 ms. (steps per millisecond=292 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 12:29:41] [INFO ] Invariant cache hit.
[2023-03-08 12:29:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 12:29:41] [INFO ] Invariant cache hit.
[2023-03-08 12:29:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:29:42] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-08 12:29:42] [INFO ] Invariant cache hit.
[2023-03-08 12:29:42] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 131/131 places, 185/185 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 961 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 945 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21060 steps, run visited all 3 properties in 113 ms. (steps per millisecond=186 )
Probabilistic random walk after 21060 steps, saw 10400 distinct states, run finished after 113 ms. (steps per millisecond=186 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22954 reset in 163 ms.
Product exploration explored 100000 steps with 22914 reset in 172 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 12:29:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:29:44] [INFO ] Invariant cache hit.
[2023-03-08 12:29:44] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 131/131 places, 185/185 transitions.
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 12:29:44] [INFO ] Invariant cache hit.
[2023-03-08 12:29:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 12:29:44] [INFO ] Invariant cache hit.
[2023-03-08 12:29:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:29:44] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-08 12:29:44] [INFO ] Invariant cache hit.
[2023-03-08 12:29:44] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 131/131 places, 185/185 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-11 finished in 5211 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||X(p1)))||G(p2))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m08-LTLFireability-15
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 213/213 places, 435/435 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 336
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 188 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 170 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 170 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 170 transition count 296
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 156 transition count 275
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 156 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 156 transition count 269
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 140 place count 146 transition count 243
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 146 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 154 place count 146 transition count 239
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 160 place count 140 transition count 233
Iterating global reduction 4 with 6 rules applied. Total rules applied 166 place count 140 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 170 place count 140 transition count 229
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 176 place count 134 transition count 206
Iterating global reduction 5 with 6 rules applied. Total rules applied 182 place count 134 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 185 place count 134 transition count 203
Applied a total of 185 rules in 27 ms. Remains 134 /213 variables (removed 79) and now considering 203/435 (removed 232) transitions.
// Phase 1: matrix 203 rows 134 cols
[2023-03-08 12:29:45] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 12:29:45] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 12:29:45] [INFO ] Invariant cache hit.
[2023-03-08 12:29:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:29:45] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-08 12:29:45] [INFO ] Invariant cache hit.
[2023-03-08 12:29:45] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/213 places, 203/435 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 579 ms. Remains : 134/213 places, 203/435 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s124 1)), p2:(AND (GEQ s1 1) (GEQ s127 1)), p1:(OR (LT s1 1) (LT s95 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22916 reset in 243 ms.
Product exploration explored 100000 steps with 22889 reset in 258 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 974 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 432 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 773194 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Probabilistic random walk after 773194 steps, saw 306249 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :10
Running SMT prover for 2 properties.
[2023-03-08 12:29:51] [INFO ] Invariant cache hit.
[2023-03-08 12:29:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 12:29:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 12:29:51] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 12:29:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 12:29:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 12:29:51] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 27 factoid took 1433 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 12:29:53] [INFO ] Invariant cache hit.
[2023-03-08 12:29:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 12:29:53] [INFO ] Invariant cache hit.
[2023-03-08 12:29:53] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:29:53] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-08 12:29:53] [INFO ] Invariant cache hit.
[2023-03-08 12:29:53] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 134/134 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 494 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 398 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 431 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Finished probabilistic random walk after 31768 steps, run visited all 5 properties in 118 ms. (steps per millisecond=269 )
Probabilistic random walk after 31768 steps, saw 15500 distinct states, run finished after 118 ms. (steps per millisecond=269 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 534 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22934 reset in 200 ms.
Product exploration explored 100000 steps with 23022 reset in 198 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 203/203 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 132 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 132 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 131 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 131 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 131 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 130 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 130 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 129 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 129 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 129 transition count 192
Applied a total of 12 rules in 10 ms. Remains 129 /134 variables (removed 5) and now considering 192/203 (removed 11) transitions.
// Phase 1: matrix 192 rows 129 cols
[2023-03-08 12:29:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:29:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 12:29:55] [INFO ] Invariant cache hit.
[2023-03-08 12:29:55] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 12:29:56] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-08 12:29:56] [INFO ] Invariant cache hit.
[2023-03-08 12:29:56] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/134 places, 192/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 129/134 places, 192/203 transitions.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-15 finished in 11299 ms.
[2023-03-08 12:29:56] [INFO ] Flatten gal took : 32 ms
[2023-03-08 12:29:56] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 12:29:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 213 places, 435 transitions and 1711 arcs took 4 ms.
Total runtime 69628 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2985/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2985/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2985/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2985/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d2m08-LTLFireability-03
Could not compute solution for formula : DBSingleClientW-PT-d2m08-LTLFireability-09
Could not compute solution for formula : DBSingleClientW-PT-d2m08-LTLFireability-11
Could not compute solution for formula : DBSingleClientW-PT-d2m08-LTLFireability-15

BK_STOP 1678278598130

--------------------
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
mcc2023
ltl formula name DBSingleClientW-PT-d2m08-LTLFireability-03
ltl formula formula --ltl=/tmp/2985/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 213 places, 435 transitions and 1711 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m08-LTLFireability-09
ltl formula formula --ltl=/tmp/2985/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 213 places, 435 transitions and 1711 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DBSingleClientW-PT-d2m08-LTLFireability-11
ltl formula formula --ltl=/tmp/2985/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 213 places, 435 transitions and 1711 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.000 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2985/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2985/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2985/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2985/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DBSingleClientW-PT-d2m08-LTLFireability-15
ltl formula formula --ltl=/tmp/2985/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 213 places, 435 transitions and 1711 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2985/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2985/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2985/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2985/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-d2m08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m08, 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 r105-tall-167814481000324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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