Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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-d1m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716324961048

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:56:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:56:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:56:02] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 20:56:02] [INFO ] Transformed 1440 places.
[2024-05-21 20:56:02] [INFO ] Transformed 672 transitions.
[2024-05-21 20:56:02] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 156 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 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 183 place count 244 transition count 407
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 407
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 277 place count 244 transition count 395
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 339 place count 182 transition count 333
Iterating global reduction 2 with 62 rules applied. Total rules applied 401 place count 182 transition count 333
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 404 place count 182 transition count 330
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 436 place count 150 transition count 282
Iterating global reduction 3 with 32 rules applied. Total rules applied 468 place count 150 transition count 282
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 494 place count 150 transition count 256
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 497 place count 147 transition count 252
Iterating global reduction 4 with 3 rules applied. Total rules applied 500 place count 147 transition count 252
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 502 place count 145 transition count 250
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 145 transition count 250
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 506 place count 143 transition count 248
Iterating global reduction 4 with 2 rules applied. Total rules applied 508 place count 143 transition count 248
Applied a total of 508 rules in 205 ms. Remains 143 /347 variables (removed 204) and now considering 248/672 (removed 424) transitions.
// Phase 1: matrix 248 rows 143 cols
[2024-05-21 20:56:03] [INFO ] Computed 2 invariants in 26 ms
[2024-05-21 20:56:03] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 20:56:03] [INFO ] Invariant cache hit.
[2024-05-21 20:56:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-21 20:56:03] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-21 20:56:03] [INFO ] Invariant cache hit.
[2024-05-21 20:56:03] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/347 places, 248/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 143/347 places, 248/672 transitions.
Support contains 32 out of 143 places after structural reductions.
[2024-05-21 20:56:03] [INFO ] Flatten gal took : 42 ms
[2024-05-21 20:56:03] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:56:04] [INFO ] Input system was already deterministic with 248 transitions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 28) seen :5
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 159 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) 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 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2024-05-21 20:56:04] [INFO ] Invariant cache hit.
[2024-05-21 20:56:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:56:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 20:56:05] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:21
[2024-05-21 20:56:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:56:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:56:06] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2024-05-21 20:56:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-21 20:56:06] [INFO ] After 698ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :1 sat :21
[2024-05-21 20:56:07] [INFO ] After 1521ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :21
Attempting to minimize the solution found.
Minimization took 745 ms.
[2024-05-21 20:56:08] [INFO ] After 2924ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :21
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 1 properties in 268 ms.
Support contains 25 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 140 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 140 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 138 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 138 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 136 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 136 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 136 transition count 230
Applied a total of 16 rules in 32 ms. Remains 136 /143 variables (removed 7) and now considering 230/248 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 136/143 places, 230/248 transitions.
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 156 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Finished probabilistic random walk after 5647 steps, run visited all 19 properties in 72 ms. (steps per millisecond=78 )
Probabilistic random walk after 5647 steps, saw 2595 distinct states, run finished after 72 ms. (steps per millisecond=78 ) properties seen :19
Parikh walk visited 0 properties in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 534 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p1)||(!p1&&F(!p2))||p0)))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 111 transition count 167
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 111 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 111 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 100 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 100 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 100 transition count 135
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 92 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 92 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 114 place count 92 transition count 119
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 119 place count 87 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 124 place count 87 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 129 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 86 transition count 108
Applied a total of 131 rules in 13 ms. Remains 86 /143 variables (removed 57) and now considering 108/248 (removed 140) transitions.
// Phase 1: matrix 108 rows 86 cols
[2024-05-21 20:56:09] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 20:56:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 20:56:09] [INFO ] Invariant cache hit.
[2024-05-21 20:56:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:56:09] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 20:56:09] [INFO ] Invariant cache hit.
[2024-05-21 20:56:09] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/143 places, 108/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 86/143 places, 108/248 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 398 ms :[true, p2, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s85 1)), p0:(OR (LT s1 1) (LT s85 1)), p1:(AND (GEQ s19 1) (GEQ s63 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-00 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(F(p0)))&&G(p1)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 177
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 112 transition count 165
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 112 transition count 165
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 112 transition count 161
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 102 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 102 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 102 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 96 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 96 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 96 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 110 place count 92 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 114 place count 92 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 91 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 91 transition count 117
Applied a total of 119 rules in 14 ms. Remains 91 /143 variables (removed 52) and now considering 117/248 (removed 131) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-21 20:56:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 20:56:10] [INFO ] Invariant cache hit.
[2024-05-21 20:56:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:56:11] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 20:56:11] [INFO ] Invariant cache hit.
[2024-05-21 20:56:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/143 places, 117/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 91/143 places, 117/248 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p1:(OR (LT s1 1) (LT s85 1)), p0:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-01 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p0))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 184
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 111 transition count 168
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 111 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 111 transition count 164
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 100 transition count 139
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 100 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 100 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 104 place count 93 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 111 place count 93 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 117 place count 89 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 89 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 126 place count 89 transition count 114
Applied a total of 126 rules in 12 ms. Remains 89 /143 variables (removed 54) and now considering 114/248 (removed 134) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 20:56:11] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:56:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:56:11] [INFO ] Invariant cache hit.
[2024-05-21 20:56:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:56:11] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 20:56:11] [INFO ] Invariant cache hit.
[2024-05-21 20:56:11] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/143 places, 114/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 89/143 places, 114/248 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-02 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 125 transition count 181
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 113 transition count 169
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 113 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 113 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 103 transition count 148
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 103 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 103 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 99 place count 96 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 106 place count 96 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 96 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 92 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 92 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 92 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 91 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 91 transition count 118
Applied a total of 124 rules in 45 ms. Remains 91 /143 variables (removed 52) and now considering 118/248 (removed 130) transitions.
// Phase 1: matrix 118 rows 91 cols
[2024-05-21 20:56:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:56:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:56:11] [INFO ] Invariant cache hit.
[2024-05-21 20:56:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:56:12] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-21 20:56:12] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 20:56:12] [INFO ] Invariant cache hit.
[2024-05-21 20:56:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/143 places, 118/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 91/143 places, 118/248 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-05 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p0))))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 126 transition count 190
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 126 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 126 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 115 transition count 176
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 115 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 115 transition count 175
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 69 place count 106 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 78 place count 106 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 106 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 86 place count 101 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 101 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 97 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 97 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 97 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 96 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 96 transition count 133
Applied a total of 105 rules in 28 ms. Remains 96 /143 variables (removed 47) and now considering 133/248 (removed 115) transitions.
// Phase 1: matrix 133 rows 96 cols
[2024-05-21 20:56:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:56:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:56:12] [INFO ] Invariant cache hit.
[2024-05-21 20:56:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 20:56:12] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 20:56:12] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 20:56:12] [INFO ] Invariant cache hit.
[2024-05-21 20:56:12] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/143 places, 133/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 96/143 places, 133/248 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (OR (LT s1 1) (LT s82 1)) (OR (LT s1 1) (LT s94 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22960 reset in 260 ms.
Product exploration explored 100000 steps with 22879 reset in 194 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 334 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 135 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Probably explored full state space saw : 12248 states, properties seen :5
Probabilistic random walk after 29880 steps, saw 12248 distinct states, run finished after 192 ms. (steps per millisecond=155 ) properties seen :5
Explored full state space saw : 12310 states, properties seen :0
Exhaustive walk after 30001 steps, saw 12310 distinct states, run finished after 44 ms. (steps per millisecond=681 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (OR (NOT p1) (NOT p0)))]
Knowledge based reduction with 12 factoid took 310 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Applied a total of 0 rules in 10 ms. Remains 96 /96 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-21 20:56:14] [INFO ] Invariant cache hit.
[2024-05-21 20:56:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 20:56:14] [INFO ] Invariant cache hit.
[2024-05-21 20:56:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 20:56:14] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-21 20:56:14] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 20:56:15] [INFO ] Invariant cache hit.
[2024-05-21 20:56:15] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 96/96 places, 133/133 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 334 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Probably explored full state space saw : 12248 states, properties seen :5
Probabilistic random walk after 29880 steps, saw 12248 distinct states, run finished after 67 ms. (steps per millisecond=445 ) properties seen :5
Explored full state space saw : 12310 states, properties seen :0
Exhaustive walk after 30001 steps, saw 12310 distinct states, run finished after 31 ms. (steps per millisecond=967 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (OR (NOT p1) (NOT p0)))]
Knowledge based reduction with 12 factoid took 271 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23029 reset in 146 ms.
Product exploration explored 100000 steps with 23070 reset in 151 ms.
Built C files in :
/tmp/ltsmin14038716007581640781
[2024-05-21 20:56:16] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2024-05-21 20:56:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:16] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2024-05-21 20:56:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:16] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2024-05-21 20:56:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:16] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14038716007581640781
Running compilation step : cd /tmp/ltsmin14038716007581640781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 339 ms.
Running link step : cd /tmp/ltsmin14038716007581640781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14038716007581640781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8993453104125969518.hoa' '--buchi-type=spotba'
LTSmin run took 312 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-06 finished in 5399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 126 transition count 193
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 126 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 126 transition count 189
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 114 transition count 177
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 114 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 114 transition count 173
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 104 transition count 151
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 104 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 104 transition count 148
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 95 place count 98 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 98 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 98 transition count 130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 95 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 95 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 94 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 94 transition count 124
Applied a total of 117 rules in 13 ms. Remains 94 /143 variables (removed 49) and now considering 124/248 (removed 124) transitions.
// Phase 1: matrix 124 rows 94 cols
[2024-05-21 20:56:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:56:17] [INFO ] Invariant cache hit.
[2024-05-21 20:56:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:56:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 20:56:17] [INFO ] Invariant cache hit.
[2024-05-21 20:56:17] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/143 places, 124/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 94/143 places, 124/248 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s87 1)) (AND (GEQ s2 1) (GEQ s90 1))), p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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-d1m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U G(p1))||G(F(p2)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 181
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 125 transition count 178
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 112 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 112 transition count 165
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 112 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 80 place count 101 transition count 136
Iterating global reduction 2 with 11 rules applied. Total rules applied 91 place count 101 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 101 transition count 132
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 102 place count 94 transition count 120
Iterating global reduction 3 with 7 rules applied. Total rules applied 109 place count 94 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 94 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 116 place count 89 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 121 place count 89 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 125 place count 89 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 88 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 88 transition count 108
Applied a total of 127 rules in 22 ms. Remains 88 /143 variables (removed 55) and now considering 108/248 (removed 140) transitions.
// Phase 1: matrix 108 rows 88 cols
[2024-05-21 20:56:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:56:18] [INFO ] Invariant cache hit.
[2024-05-21 20:56:18] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 20:56:18] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-21 20:56:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:56:18] [INFO ] Invariant cache hit.
[2024-05-21 20:56:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/143 places, 108/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 88/143 places, 108/248 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s28 1) (GEQ s34 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-08 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U ((p1 U p2)&&F(p0))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 125 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 112 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 112 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 112 transition count 165
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 103 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 103 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 90 place count 103 transition count 147
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 97 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 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 106 place count 97 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 94 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 115 place count 93 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 93 transition count 125
Applied a total of 116 rules in 19 ms. Remains 93 /143 variables (removed 50) and now considering 125/248 (removed 123) transitions.
// Phase 1: matrix 125 rows 93 cols
[2024-05-21 20:56:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:56:18] [INFO ] Invariant cache hit.
[2024-05-21 20:56:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 20:56:18] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-21 20:56:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:18] [INFO ] Invariant cache hit.
[2024-05-21 20:56:18] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/143 places, 125/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 93/143 places, 125/248 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p2:(AND (GEQ s1 1) (GEQ s80 1)), p1:(AND (GEQ s1 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-09 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 177
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 110 transition count 163
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 110 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 110 transition count 159
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 84 place count 99 transition count 135
Iterating global reduction 2 with 11 rules applied. Total rules applied 95 place count 99 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 99 place count 99 transition count 131
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 106 place count 92 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 113 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 115 place count 92 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 119 place count 88 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 88 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 127 place count 88 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 87 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 87 transition count 107
Applied a total of 129 rules in 4 ms. Remains 87 /143 variables (removed 56) and now considering 107/248 (removed 141) transitions.
// Phase 1: matrix 107 rows 87 cols
[2024-05-21 20:56:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 20:56:18] [INFO ] Invariant cache hit.
[2024-05-21 20:56:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:56:18] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-21 20:56:18] [INFO ] Invariant cache hit.
[2024-05-21 20:56:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/143 places, 107/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 87/143 places, 107/248 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s23 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-10 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 186
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 124 transition count 182
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 110 transition count 168
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 110 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 110 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 98 transition count 138
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 98 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 98 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 90 transition count 120
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 90 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 125 place count 85 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 130 place count 85 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 135 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 84 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 84 transition count 107
Applied a total of 137 rules in 14 ms. Remains 84 /143 variables (removed 59) and now considering 107/248 (removed 141) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 20:56:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:56:19] [INFO ] Invariant cache hit.
[2024-05-21 20:56:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 20:56:19] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-21 20:56:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:56:19] [INFO ] Invariant cache hit.
[2024-05-21 20:56:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/143 places, 107/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 84/143 places, 107/248 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-11 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 s58 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 23009 reset in 111 ms.
Product exploration explored 100000 steps with 23003 reset in 122 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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)]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10420 steps, run visited all 1 properties in 16 ms. (steps per millisecond=651 )
Probabilistic random walk after 10420 steps, saw 4750 distinct states, run finished after 16 ms. (steps per millisecond=651 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 20:56:19] [INFO ] Invariant cache hit.
[2024-05-21 20:56:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:56:19] [INFO ] Invariant cache hit.
[2024-05-21 20:56:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 20:56:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 20:56:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:20] [INFO ] Invariant cache hit.
[2024-05-21 20:56:20] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 84/84 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 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 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10420 steps, run visited all 1 properties in 18 ms. (steps per millisecond=578 )
Probabilistic random walk after 10420 steps, saw 4750 distinct states, run finished after 19 ms. (steps per millisecond=548 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22959 reset in 115 ms.
Product exploration explored 100000 steps with 23042 reset in 120 ms.
Built C files in :
/tmp/ltsmin746741056527930294
[2024-05-21 20:56:20] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2024-05-21 20:56:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:20] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2024-05-21 20:56:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:20] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2024-05-21 20:56:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin746741056527930294
Running compilation step : cd /tmp/ltsmin746741056527930294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 217 ms.
Running link step : cd /tmp/ltsmin746741056527930294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin746741056527930294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8330534193640052710.hoa' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-11 finished in 2257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p1)&&F(p2)))||p0)))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 123 transition count 179
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 123 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 123 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 109 transition count 162
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 109 transition count 162
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 109 transition count 158
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 86 place count 98 transition count 134
Iterating global reduction 2 with 11 rules applied. Total rules applied 97 place count 98 transition count 134
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 98 transition count 130
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 108 place count 91 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 115 place count 91 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 91 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 121 place count 86 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 126 place count 86 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 131 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 85 transition count 106
Applied a total of 133 rules in 5 ms. Remains 85 /143 variables (removed 58) and now considering 106/248 (removed 142) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 20:56:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:56:21] [INFO ] Invariant cache hit.
[2024-05-21 20:56:21] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 20:56:21] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-21 20:56:21] [INFO ] Invariant cache hit.
[2024-05-21 20:56:21] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/143 places, 106/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 85/143 places, 106/248 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s77 1)), p1:(AND (GEQ s1 1) (GEQ s77 1)), p2:(AND (GEQ s1 1) (GEQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-12 finished in 796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U ((p1 U G(p0))&&G(p1)))))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 183
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 125 transition count 181
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 111 transition count 167
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 111 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 111 transition count 163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 82 place count 99 transition count 137
Iterating global reduction 2 with 12 rules applied. Total rules applied 94 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 99 transition count 133
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 106 place count 91 transition count 119
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 91 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 91 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 121 place count 86 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 126 place count 86 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 131 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 85 transition count 106
Applied a total of 133 rules in 9 ms. Remains 85 /143 variables (removed 58) and now considering 106/248 (removed 142) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 20:56:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:56:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:56:22] [INFO ] Invariant cache hit.
[2024-05-21 20:56:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:56:22] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-21 20:56:22] [INFO ] Invariant cache hit.
[2024-05-21 20:56:22] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/143 places, 106/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 85/143 places, 106/248 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s2 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-13 finished in 500 ms.
All properties solved by simple procedures.
Total runtime 20150 ms.

BK_STOP 1716324983613

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d1m04, 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 r109-tall-171624208300308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;