About the Execution of LTSMin+red for DBSingleClientW-PT-d1m05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
478.140 | 33567.00 | 57619.00 | 518.20 | ?FTFFF?FFF?F?FFF | normal |
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-167814480900244.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-d1m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480900244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 8.7K Feb 26 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:20 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 432K 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-d1m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678265948904
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-d1m05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:59:10] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-08 08:59:10] [INFO ] Transformed 1440 places.
[2023-03-08 08:59:10] [INFO ] Transformed 672 transitions.
[2023-03-08 08:59:10] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 425
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 425
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 281 place count 246 transition count 405
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 339 place count 188 transition count 347
Iterating global reduction 2 with 58 rules applied. Total rules applied 397 place count 188 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 399 place count 188 transition count 345
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 427 place count 160 transition count 302
Iterating global reduction 3 with 28 rules applied. Total rules applied 455 place count 160 transition count 302
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 487 place count 160 transition count 270
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 490 place count 157 transition count 267
Iterating global reduction 4 with 3 rules applied. Total rules applied 493 place count 157 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 496 place count 154 transition count 264
Iterating global reduction 4 with 3 rules applied. Total rules applied 499 place count 154 transition count 264
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 501 place count 152 transition count 262
Iterating global reduction 4 with 2 rules applied. Total rules applied 503 place count 152 transition count 262
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 151 transition count 260
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 151 transition count 260
Applied a total of 505 rules in 76 ms. Remains 151 /347 variables (removed 196) and now considering 260/672 (removed 412) transitions.
// Phase 1: matrix 260 rows 151 cols
[2023-03-08 08:59:11] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-08 08:59:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-08 08:59:11] [INFO ] Invariant cache hit.
[2023-03-08 08:59:11] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-08 08:59:11] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-08 08:59:11] [INFO ] Invariant cache hit.
[2023-03-08 08:59:11] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/347 places, 260/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 151/347 places, 260/672 transitions.
Support contains 31 out of 151 places after structural reductions.
[2023-03-08 08:59:12] [INFO ] Flatten gal took : 50 ms
[2023-03-08 08:59:12] [INFO ] Flatten gal took : 22 ms
[2023-03-08 08:59:12] [INFO ] Input system was already deterministic with 260 transitions.
Support contains 30 out of 151 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-08 08:59:13] [INFO ] Invariant cache hit.
[2023-03-08 08:59:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:59:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-08 08:59:13] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-08 08:59:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:59:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 08:59:14] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-08 08:59:14] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-08 08:59:15] [INFO ] After 937ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-08 08:59:16] [INFO ] After 1998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 828 ms.
[2023-03-08 08:59:17] [INFO ] After 3755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 5 properties in 146 ms.
Support contains 18 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 260/260 transitions.
Graph (complete) has 509 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 150 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 145 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 145 transition count 248
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 140 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 140 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 140 transition count 241
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 138 transition count 235
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 138 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 138 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 137 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 137 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 136 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 136 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 136 transition count 230
Applied a total of 37 rules in 53 ms. Remains 136 /151 variables (removed 15) and now considering 230/260 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 136/151 places, 230/260 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 17) seen :0
Finished probabilistic random walk after 18284 steps, run visited all 17 properties in 328 ms. (steps per millisecond=55 )
Probabilistic random walk after 18284 steps, saw 8459 distinct states, run finished after 328 ms. (steps per millisecond=55 ) properties seen :17
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 560 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 192
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 192
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 115 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 115 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 78 place count 115 transition count 169
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 92 place count 101 transition count 143
Iterating global reduction 1 with 14 rules applied. Total rules applied 106 place count 101 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 101 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 117 place count 93 transition count 126
Iterating global reduction 2 with 8 rules applied. Total rules applied 125 place count 93 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 93 transition count 124
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 133 place count 87 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 87 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 143 place count 87 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 85 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 85 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 85 transition count 110
Applied a total of 149 rules in 32 ms. Remains 85 /151 variables (removed 66) and now considering 110/260 (removed 150) transitions.
// Phase 1: matrix 110 rows 85 cols
[2023-03-08 08:59:18] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:59:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:59:18] [INFO ] Invariant cache hit.
[2023-03-08 08:59:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 08:59:19] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 08:59:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:59:19] [INFO ] Invariant cache hit.
[2023-03-08 08:59:19] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/151 places, 110/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 85/151 places, 110/260 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22979 reset in 262 ms.
Product exploration explored 100000 steps with 22898 reset in 186 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12967 steps, run visited all 1 properties in 28 ms. (steps per millisecond=463 )
Probabilistic random walk after 12967 steps, saw 6075 distinct states, run finished after 28 ms. (steps per millisecond=463 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-08 08:59:20] [INFO ] Invariant cache hit.
[2023-03-08 08:59:20] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 08:59:20] [INFO ] Invariant cache hit.
[2023-03-08 08:59:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 08:59:20] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 08:59:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:59:20] [INFO ] Invariant cache hit.
[2023-03-08 08:59:20] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 85/85 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12967 steps, run visited all 1 properties in 50 ms. (steps per millisecond=259 )
Probabilistic random walk after 12967 steps, saw 6075 distinct states, run finished after 50 ms. (steps per millisecond=259 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23064 reset in 130 ms.
Product exploration explored 100000 steps with 22885 reset in 139 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-08 08:59:21] [INFO ] Invariant cache hit.
[2023-03-08 08:59:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:59:21] [INFO ] Invariant cache hit.
[2023-03-08 08:59:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 08:59:21] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 08:59:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:59:21] [INFO ] Invariant cache hit.
[2023-03-08 08:59:21] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 85/85 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-00 finished in 2857 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' '!(((p0 U G((p1&&X(G(!p2))))) U p2))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 206
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 133 transition count 204
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 119 transition count 189
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 119 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 72 place count 119 transition count 183
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 107 transition count 160
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 107 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 107 transition count 157
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 106 place count 100 transition count 140
Iterating global reduction 3 with 7 rules applied. Total rules applied 113 place count 100 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 121 place count 96 transition count 132
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 96 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 95 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 95 transition count 128
Applied a total of 130 rules in 12 ms. Remains 95 /151 variables (removed 56) and now considering 128/260 (removed 132) transitions.
// Phase 1: matrix 128 rows 95 cols
[2023-03-08 08:59:21] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:59:21] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 08:59:21] [INFO ] Invariant cache hit.
[2023-03-08 08:59:21] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-08 08:59:21] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-08 08:59:21] [INFO ] Invariant cache hit.
[2023-03-08 08:59:21] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/151 places, 128/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 95/151 places, 128/260 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), true, p2, (OR (AND (NOT p2) (NOT p1)) (AND p2 p1)), (OR (NOT p1) p2), p2]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=5 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 p0), acceptance={1} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s87 1)), p1:(OR (NOT (AND (GEQ s1 1) (GEQ s93 1))) (AND (GEQ s1 1) (GEQ s87 1))), p0:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=2, 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]]
Stuttering criterion allowed to conclude after 76 steps with 18 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-01 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 191
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 131 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 116 transition count 174
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 116 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 116 transition count 168
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 90 place count 103 transition count 146
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 103 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 103 transition count 143
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 114 place count 95 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 95 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 95 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 90 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 90 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 90 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 88 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 88 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 143 place count 88 transition count 110
Applied a total of 143 rules in 7 ms. Remains 88 /151 variables (removed 63) and now considering 110/260 (removed 150) transitions.
// Phase 1: matrix 110 rows 88 cols
[2023-03-08 08:59:22] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:59:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 08:59:22] [INFO ] Invariant cache hit.
[2023-03-08 08:59:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-08 08:59:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 08:59:22] [INFO ] Invariant cache hit.
[2023-03-08 08:59:22] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/151 places, 110/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 88/151 places, 110/260 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-02 finished in 1021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G((F((X(p2)&&p1))&&F(G(p0))))))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 132 transition count 201
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 117 transition count 185
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 117 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 117 transition count 179
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 86 place count 106 transition count 159
Iterating global reduction 2 with 11 rules applied. Total rules applied 97 place count 106 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 106 transition count 155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 108 place count 99 transition count 140
Iterating global reduction 3 with 7 rules applied. Total rules applied 115 place count 99 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 99 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 121 place count 95 transition count 134
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 95 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 95 transition count 131
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 94 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 94 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 132 place count 94 transition count 128
Applied a total of 132 rules in 16 ms. Remains 94 /151 variables (removed 57) and now considering 128/260 (removed 132) transitions.
// Phase 1: matrix 128 rows 94 cols
[2023-03-08 08:59:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:59:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:59:23] [INFO ] Invariant cache hit.
[2023-03-08 08:59:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 08:59:23] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-08 08:59:23] [INFO ] Invariant cache hit.
[2023-03-08 08:59:23] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/151 places, 128/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 94/151 places, 128/260 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=true, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s92 1)), p1:(AND (GEQ s1 1) (GEQ s91 1)), p2:(OR (AND (GEQ s1 1) (GEQ s88 1)) (AND (GEQ s1 1) (GEQ s64 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-03 finished in 588 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)&&F(p1))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 191
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 131 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 115 transition count 173
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 115 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 115 transition count 167
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 101 transition count 141
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 101 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 101 transition count 138
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 92 transition count 118
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 92 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 92 transition count 116
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 136 place count 86 transition count 110
Iterating global reduction 4 with 6 rules applied. Total rules applied 142 place count 86 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 86 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 84 transition count 104
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 84 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 84 transition count 103
Applied a total of 151 rules in 13 ms. Remains 84 /151 variables (removed 67) and now considering 103/260 (removed 157) transitions.
// Phase 1: matrix 103 rows 84 cols
[2023-03-08 08:59:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:59:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:59:23] [INFO ] Invariant cache hit.
[2023-03-08 08:59:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 08:59:24] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-08 08:59:24] [INFO ] Invariant cache hit.
[2023-03-08 08:59:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/151 places, 103/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 84/151 places, 103/260 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s62 1)), p1:(AND (GEQ s26 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-04 finished in 395 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)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 190
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 130 transition count 189
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 115 transition count 173
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 115 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 115 transition count 167
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 92 place count 102 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 105 place count 102 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 102 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 116 place count 94 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 94 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 94 transition count 119
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 131 place count 89 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 136 place count 89 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 139 place count 89 transition count 111
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 87 transition count 109
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 87 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 87 transition count 107
Applied a total of 145 rules in 26 ms. Remains 87 /151 variables (removed 64) and now considering 107/260 (removed 153) transitions.
// Phase 1: matrix 107 rows 87 cols
[2023-03-08 08:59:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:59:24] [INFO ] Invariant cache hit.
[2023-03-08 08:59:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 08:59:24] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 08:59:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 08:59:24] [INFO ] Invariant cache hit.
[2023-03-08 08:59:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/151 places, 107/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 87/151 places, 107/260 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s24 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22945 reset in 136 ms.
Product exploration explored 100000 steps with 22975 reset in 152 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 293 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16274 steps, run visited all 1 properties in 26 ms. (steps per millisecond=625 )
Probabilistic random walk after 16274 steps, saw 7756 distinct states, run finished after 27 ms. (steps per millisecond=602 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 08:59:25] [INFO ] Invariant cache hit.
[2023-03-08 08:59:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 08:59:25] [INFO ] Invariant cache hit.
[2023-03-08 08:59:25] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 08:59:25] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 08:59:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 08:59:25] [INFO ] Invariant cache hit.
[2023-03-08 08:59:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 87/87 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 293 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 978 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16274 steps, run visited all 1 properties in 31 ms. (steps per millisecond=524 )
Probabilistic random walk after 16274 steps, saw 7756 distinct states, run finished after 31 ms. (steps per millisecond=524 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22858 reset in 110 ms.
Product exploration explored 100000 steps with 22877 reset in 111 ms.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 08:59:26] [INFO ] Invariant cache hit.
[2023-03-08 08:59:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:59:26] [INFO ] Invariant cache hit.
[2023-03-08 08:59:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 08:59:26] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 08:59:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:59:26] [INFO ] Invariant cache hit.
[2023-03-08 08:59:26] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 87/87 places, 107/107 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-06 finished in 2594 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)&&F(p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 132 transition count 199
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 117 transition count 183
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 117 transition count 183
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 117 transition count 177
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 104 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 104 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 104 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 96 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 96 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 96 transition count 128
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 91 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 91 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 91 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 89 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 143 place count 89 transition count 116
Applied a total of 143 rules in 7 ms. Remains 89 /151 variables (removed 62) and now considering 116/260 (removed 144) transitions.
// Phase 1: matrix 116 rows 89 cols
[2023-03-08 08:59:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:26] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 08:59:26] [INFO ] Invariant cache hit.
[2023-03-08 08:59:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 08:59:27] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 08:59:27] [INFO ] Invariant cache hit.
[2023-03-08 08:59:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/151 places, 116/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 89/151 places, 116/260 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-07 finished in 540 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' '!((p0 U (G(F(p1))||G(p2))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 201
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 133 transition count 200
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 119 transition count 185
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 119 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 119 transition count 181
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 80 place count 108 transition count 159
Iterating global reduction 2 with 11 rules applied. Total rules applied 91 place count 108 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 108 transition count 156
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 101 transition count 142
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 101 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 101 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 114 place count 96 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 119 place count 96 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 123 place count 96 transition count 132
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 95 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 95 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 95 transition count 129
Applied a total of 127 rules in 25 ms. Remains 95 /151 variables (removed 56) and now considering 129/260 (removed 131) transitions.
// Phase 1: matrix 129 rows 95 cols
[2023-03-08 08:59:27] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:59:27] [INFO ] Invariant cache hit.
[2023-03-08 08:59:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:59:27] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 08:59:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:59:27] [INFO ] Invariant cache hit.
[2023-03-08 08:59:27] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/151 places, 129/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 95/151 places, 129/260 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NOT (AND (GEQ s1 1) (GEQ s47 1))) (AND (GEQ s1 1) (GEQ s82 1))), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-08 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||p1) U ((X(p0) U p2) U (G(X(p2)) U p3))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 133 transition count 202
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 133 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 133 transition count 201
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 119 transition count 187
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 119 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 119 transition count 182
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 83 place count 106 transition count 158
Iterating global reduction 2 with 13 rules applied. Total rules applied 96 place count 106 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 106 transition count 155
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 108 place count 97 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 117 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 121 place count 97 transition count 131
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 126 place count 92 transition count 126
Iterating global reduction 4 with 5 rules applied. Total rules applied 131 place count 92 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 135 place count 92 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 91 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 91 transition count 121
Applied a total of 137 rules in 13 ms. Remains 91 /151 variables (removed 60) and now considering 121/260 (removed 139) transitions.
// Phase 1: matrix 121 rows 91 cols
[2023-03-08 08:59:27] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:59:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:59:27] [INFO ] Invariant cache hit.
[2023-03-08 08:59:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 08:59:28] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-08 08:59:28] [INFO ] Invariant cache hit.
[2023-03-08 08:59:28] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/151 places, 121/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 91/151 places, 121/260 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s27 1) (GEQ s55 1)), p2:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s78 1)), p0:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-09 finished in 580 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 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 195
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 131 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 116 transition count 178
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 116 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 116 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 103 transition count 150
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 103 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 103 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 95 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 95 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 95 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 127 place count 89 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 133 place count 89 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 137 place count 89 transition count 118
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 87 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 143 place count 87 transition count 114
Applied a total of 143 rules in 15 ms. Remains 87 /151 variables (removed 64) and now considering 114/260 (removed 146) transitions.
// Phase 1: matrix 114 rows 87 cols
[2023-03-08 08:59:28] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:59:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:59:28] [INFO ] Invariant cache hit.
[2023-03-08 08:59:28] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 08:59:28] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 08:59:28] [INFO ] Invariant cache hit.
[2023-03-08 08:59:28] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/151 places, 114/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 87/151 places, 114/260 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-10 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 s1 1) (LT s78 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 22998 reset in 116 ms.
Product exploration explored 100000 steps with 23045 reset in 116 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 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 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17190 steps, run visited all 1 properties in 24 ms. (steps per millisecond=716 )
Probabilistic random walk after 17190 steps, saw 8139 distinct states, run finished after 24 ms. (steps per millisecond=716 ) 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 178 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 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2023-03-08 08:59:29] [INFO ] Invariant cache hit.
[2023-03-08 08:59:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 08:59:29] [INFO ] Invariant cache hit.
[2023-03-08 08:59:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 08:59:29] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-08 08:59:29] [INFO ] Invariant cache hit.
[2023-03-08 08:59:29] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 87/87 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
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 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2330 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17190 steps, run visited all 1 properties in 26 ms. (steps per millisecond=661 )
Probabilistic random walk after 17190 steps, saw 8139 distinct states, run finished after 27 ms. (steps per millisecond=636 ) 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 181 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 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23019 reset in 105 ms.
Product exploration explored 100000 steps with 22925 reset in 112 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 7 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2023-03-08 08:59:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:59:31] [INFO ] Invariant cache hit.
[2023-03-08 08:59:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 87/87 places, 114/114 transitions.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2023-03-08 08:59:31] [INFO ] Invariant cache hit.
[2023-03-08 08:59:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 08:59:31] [INFO ] Invariant cache hit.
[2023-03-08 08:59:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 08:59:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 08:59:31] [INFO ] Invariant cache hit.
[2023-03-08 08:59:31] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 87/87 places, 114/114 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-10 finished in 3088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((G(F(p0)) U (F(p2)&&p1))))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 202
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 132 transition count 201
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 117 transition count 185
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 117 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 74 place count 117 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 104 transition count 155
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 104 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 104 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 96 transition count 133
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 96 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 96 transition count 132
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 127 place count 90 transition count 126
Iterating global reduction 4 with 6 rules applied. Total rules applied 133 place count 90 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 137 place count 90 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 88 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 88 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 143 place count 88 transition count 118
Applied a total of 143 rules in 19 ms. Remains 88 /151 variables (removed 63) and now considering 118/260 (removed 142) transitions.
// Phase 1: matrix 118 rows 88 cols
[2023-03-08 08:59:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 08:59:31] [INFO ] Invariant cache hit.
[2023-03-08 08:59:31] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 08:59:31] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 08:59:31] [INFO ] Invariant cache hit.
[2023-03-08 08:59:31] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/151 places, 118/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 88/151 places, 118/260 transitions.
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=(NOT p1), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(NOT p1), acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s80 1)), p0:(AND (GEQ s1 1) (GEQ s61 1)), p2:(AND (GEQ s1 1) (GEQ s80 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, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-11 finished in 757 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(F(p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 195
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 132 transition count 194
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 118 transition count 179
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 118 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 118 transition count 174
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 106 transition count 152
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 106 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 106 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 107 place count 98 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 115 place count 98 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 98 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 124 place count 93 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 129 place count 93 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 133 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 91 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 91 transition count 115
Applied a total of 137 rules in 18 ms. Remains 91 /151 variables (removed 60) and now considering 115/260 (removed 145) transitions.
// Phase 1: matrix 115 rows 91 cols
[2023-03-08 08:59:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 08:59:32] [INFO ] Invariant cache hit.
[2023-03-08 08:59:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 08:59:32] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-08 08:59:32] [INFO ] Invariant cache hit.
[2023-03-08 08:59:32] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/151 places, 115/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 91/151 places, 115/260 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s7 1) (GEQ s35 1)), p0:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23000 reset in 118 ms.
Product exploration explored 100000 steps with 22955 reset in 125 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 484 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1004 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Finished probabilistic random walk after 17086 steps, run visited all 3 properties in 35 ms. (steps per millisecond=488 )
Probabilistic random walk after 17086 steps, saw 8143 distinct states, run finished after 36 ms. (steps per millisecond=474 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 115/115 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-08 08:59:34] [INFO ] Invariant cache hit.
[2023-03-08 08:59:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 08:59:34] [INFO ] Invariant cache hit.
[2023-03-08 08:59:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 08:59:34] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-08 08:59:34] [INFO ] Invariant cache hit.
[2023-03-08 08:59:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 91/91 places, 115/115 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Finished probabilistic random walk after 17086 steps, run visited all 3 properties in 38 ms. (steps per millisecond=449 )
Probabilistic random walk after 17086 steps, saw 8143 distinct states, run finished after 38 ms. (steps per millisecond=449 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22907 reset in 104 ms.
Product exploration explored 100000 steps with 22997 reset in 113 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 115/115 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-08 08:59:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:59:36] [INFO ] Invariant cache hit.
[2023-03-08 08:59:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 91/91 places, 115/115 transitions.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 115/115 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-08 08:59:36] [INFO ] Invariant cache hit.
[2023-03-08 08:59:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:59:36] [INFO ] Invariant cache hit.
[2023-03-08 08:59:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 08:59:36] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-08 08:59:36] [INFO ] Invariant cache hit.
[2023-03-08 08:59:36] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 91/91 places, 115/115 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-12 finished in 4642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 132 transition count 198
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 132 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 132 transition count 196
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 117 transition count 180
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 117 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 117 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 104 transition count 149
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 104 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 104 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 96 transition count 133
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 96 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 96 transition count 131
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 128 place count 90 transition count 125
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 90 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 138 place count 90 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 140 place count 88 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 88 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 144 place count 88 transition count 117
Applied a total of 144 rules in 15 ms. Remains 88 /151 variables (removed 63) and now considering 117/260 (removed 143) transitions.
// Phase 1: matrix 117 rows 88 cols
[2023-03-08 08:59:36] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:59:37] [INFO ] Invariant cache hit.
[2023-03-08 08:59:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 08:59:37] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 08:59:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:59:37] [INFO ] Invariant cache hit.
[2023-03-08 08:59:37] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/151 places, 117/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 88/151 places, 117/260 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s57 1)), p0:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-14 finished in 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 191
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 131 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 115 transition count 173
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 115 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 115 transition count 167
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 101 transition count 141
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 101 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 101 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 93 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 93 transition count 122
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 87 transition count 116
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 87 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 144 place count 87 transition count 112
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 146 place count 85 transition count 110
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 85 transition count 108
Applied a total of 150 rules in 16 ms. Remains 85 /151 variables (removed 66) and now considering 108/260 (removed 152) transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 08:59:37] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:59:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 08:59:37] [INFO ] Invariant cache hit.
[2023-03-08 08:59:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 08:59:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 08:59:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:59:37] [INFO ] Invariant cache hit.
[2023-03-08 08:59:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/151 places, 108/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 85/151 places, 108/260 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-15 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m05-LTLFireability-10
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 151/151 places, 260/260 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 195
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 131 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 116 transition count 178
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 116 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 116 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 103 transition count 150
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 103 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 103 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 95 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 95 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 95 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 127 place count 89 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 133 place count 89 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 137 place count 89 transition count 118
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 87 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 143 place count 87 transition count 114
Applied a total of 143 rules in 19 ms. Remains 87 /151 variables (removed 64) and now considering 114/260 (removed 146) transitions.
// Phase 1: matrix 114 rows 87 cols
[2023-03-08 08:59:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:59:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 08:59:38] [INFO ] Invariant cache hit.
[2023-03-08 08:59:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 08:59:38] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 08:59:38] [INFO ] Invariant cache hit.
[2023-03-08 08:59:38] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/151 places, 114/260 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 277 ms. Remains : 87/151 places, 114/260 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-10 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 s1 1) (LT s78 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 22934 reset in 101 ms.
Product exploration explored 100000 steps with 22891 reset in 106 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 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 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17190 steps, run visited all 1 properties in 27 ms. (steps per millisecond=636 )
Probabilistic random walk after 17190 steps, saw 8139 distinct states, run finished after 27 ms. (steps per millisecond=636 ) 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 203 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 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2023-03-08 08:59:39] [INFO ] Invariant cache hit.
[2023-03-08 08:59:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:59:39] [INFO ] Invariant cache hit.
[2023-03-08 08:59:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 08:59:39] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-08 08:59:39] [INFO ] Invariant cache hit.
[2023-03-08 08:59:39] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 87/87 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 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)]
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17190 steps, run visited all 1 properties in 25 ms. (steps per millisecond=687 )
Probabilistic random walk after 17190 steps, saw 8139 distinct states, run finished after 25 ms. (steps per millisecond=687 ) 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 177 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 99 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 23108 reset in 108 ms.
Product exploration explored 100000 steps with 22918 reset in 108 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2023-03-08 08:59:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:59:40] [INFO ] Invariant cache hit.
[2023-03-08 08:59:40] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 87/87 places, 114/114 transitions.
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2023-03-08 08:59:40] [INFO ] Invariant cache hit.
[2023-03-08 08:59:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:59:40] [INFO ] Invariant cache hit.
[2023-03-08 08:59:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 08:59:40] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 08:59:40] [INFO ] Invariant cache hit.
[2023-03-08 08:59:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 87/87 places, 114/114 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-10 finished in 3179 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(F(p1)))))'
[2023-03-08 08:59:41] [INFO ] Flatten gal took : 19 ms
[2023-03-08 08:59:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 08:59:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 260 transitions and 1021 arcs took 3 ms.
Total runtime 30641 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1739/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1739/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1739/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1739/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d1m05-LTLFireability-00
Could not compute solution for formula : DBSingleClientW-PT-d1m05-LTLFireability-06
Could not compute solution for formula : DBSingleClientW-PT-d1m05-LTLFireability-10
Could not compute solution for formula : DBSingleClientW-PT-d1m05-LTLFireability-12
BK_STOP 1678265982471
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DBSingleClientW-PT-d1m05-LTLFireability-00
ltl formula formula --ltl=/tmp/1739/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 151 places, 260 transitions and 1021 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1739/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1739/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1739/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1739/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d1m05-LTLFireability-06
ltl formula formula --ltl=/tmp/1739/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 151 places, 260 transitions and 1021 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1739/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1739/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1739/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1739/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 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-d1m05-LTLFireability-10
ltl formula formula --ltl=/tmp/1739/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
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 151 places, 260 transitions and 1021 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1739/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1739/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1739/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1739/ltl_2_
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-d1m05-LTLFireability-12
ltl formula formula --ltl=/tmp/1739/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
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 151 places, 260 transitions and 1021 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1739/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1739/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1739/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1739/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
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-d1m05"
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-d1m05, 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-167814480900244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m05.tgz
mv DBSingleClientW-PT-d1m05 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 '
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 ;