Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678265283119

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:48:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:48:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:48:05] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2023-03-08 08:48:05] [INFO ] Transformed 553 places.
[2023-03-08 08:48:05] [INFO ] Transformed 150 transitions.
[2023-03-08 08:48:05] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 29 place count 91 transition count 125
Iterating global reduction 1 with 11 rules applied. Total rules applied 40 place count 91 transition count 125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 86 transition count 120
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 86 transition count 120
Applied a total of 50 rules in 21 ms. Remains 86 /109 variables (removed 23) and now considering 120/150 (removed 30) transitions.
// Phase 1: matrix 120 rows 86 cols
[2023-03-08 08:48:05] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-08 08:48:05] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-08 08:48:05] [INFO ] Invariant cache hit.
[2023-03-08 08:48:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-08 08:48:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-08 08:48:05] [INFO ] Invariant cache hit.
[2023-03-08 08:48:05] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/109 places, 120/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 86/109 places, 120/150 transitions.
Support contains 29 out of 86 places after structural reductions.
[2023-03-08 08:48:05] [INFO ] Flatten gal took : 31 ms
[2023-03-08 08:48:05] [INFO ] Flatten gal took : 13 ms
[2023-03-08 08:48:05] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 25) seen :10
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-08 08:48:06] [INFO ] Invariant cache hit.
[2023-03-08 08:48:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:48:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:48:07] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-08 08:48:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:48:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:48:07] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-08 08:48:07] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-08 08:48:07] [INFO ] After 239ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-08 08:48:08] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-08 08:48:08] [INFO ] After 1081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 2 properties in 78 ms.
Support contains 17 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 112
Applied a total of 8 rules in 14 ms. Remains 82 /86 variables (removed 4) and now considering 112/120 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 82/86 places, 112/120 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1066 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 531 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Finished probabilistic random walk after 3850 steps, run visited all 13 properties in 44 ms. (steps per millisecond=87 )
Probabilistic random walk after 3850 steps, saw 1806 distinct states, run finished after 44 ms. (steps per millisecond=87 ) properties seen :13
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 288 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(p1)&&F(p2)))&&p0))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 96
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 70 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 68 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 67 transition count 82
Applied a total of 42 rules in 13 ms. Remains 67 /86 variables (removed 19) and now considering 82/120 (removed 38) transitions.
// Phase 1: matrix 82 rows 67 cols
[2023-03-08 08:48:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:48:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 08:48:10] [INFO ] Invariant cache hit.
[2023-03-08 08:48:10] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 08:48:10] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-08 08:48:10] [INFO ] Invariant cache hit.
[2023-03-08 08:48:10] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/86 places, 82/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 67/86 places, 82/120 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ 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}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s65 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-00 finished in 891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&!(G((G(p1)||X(p2))) U (p0 U p3))))'
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 91
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 67 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 67 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 72
Applied a total of 52 rules in 11 ms. Remains 63 /86 variables (removed 23) and now considering 72/120 (removed 48) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 08:48:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:48:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 08:48:11] [INFO ] Invariant cache hit.
[2023-03-08 08:48:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:48:11] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 08:48:11] [INFO ] Invariant cache hit.
[2023-03-08 08:48:11] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 72/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 63/86 places, 72/120 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR p3 p1), true, p1, p3, (AND p2 p3), p2, (AND p1 p3), p1]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p3), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p3), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s24 1)), p3:(AND (GEQ s14 1) (GEQ s41 1)), p0:(AND (GEQ s0 1) (GEQ s24 1)), p2:(AND (GEQ s1 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p3)), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p3) p0 (NOT p2))
Knowledge based reduction with 22 factoid took 921 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-01 finished in 2044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(!(p0 U (p0 U p1)))&&X(p2))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 92
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 67 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 64 transition count 75
Applied a total of 50 rules in 17 ms. Remains 64 /86 variables (removed 22) and now considering 75/120 (removed 45) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 08:48:12] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:48:13] [INFO ] Invariant cache hit.
[2023-03-08 08:48:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:48:13] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 08:48:13] [INFO ] Invariant cache hit.
[2023-03-08 08:48:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/86 places, 75/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 64/86 places, 75/120 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s7 1) (GEQ s45 1)), p2:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-02 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 89
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 66 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 71
Applied a total of 56 rules in 22 ms. Remains 61 /86 variables (removed 25) and now considering 71/120 (removed 49) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:48:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:48:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:48:13] [INFO ] Invariant cache hit.
[2023-03-08 08:48:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:48:13] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-08 08:48:13] [INFO ] Invariant cache hit.
[2023-03-08 08:48:13] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 71/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 61/86 places, 71/120 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s59 1)), p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-03 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(G((F(p2)||p1))&&X(p3)))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 62 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 61 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 61 transition count 72
Applied a total of 55 rules in 11 ms. Remains 61 /86 variables (removed 25) and now considering 72/120 (removed 48) transitions.
// Phase 1: matrix 72 rows 61 cols
[2023-03-08 08:48:14] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:48:14] [INFO ] Invariant cache hit.
[2023-03-08 08:48:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 08:48:14] [INFO ] Invariant cache hit.
[2023-03-08 08:48:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 72/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 61/86 places, 72/120 transitions.
Stuttering acceptance computed with spot in 445 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(OR (LT s1 1) (LT s38 1)), p2:(OR (LT s1 1) (LT s55 1)), p0:(OR (LT s1 1) (LT s38 1)), p3:(OR (LT s17 1) (LT s23 1))], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 25395 reset in 127 ms.
Product exploration explored 100000 steps with 25335 reset in 141 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 513 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 518 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 08:48:16] [INFO ] Invariant cache hit.
[2023-03-08 08:48:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:48:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:48:16] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2023-03-08 08:48:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:48:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:48:16] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-08 08:48:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:16] [INFO ] After 22ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2023-03-08 08:48:17] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 08:48:17] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 72/72 transitions.
Graph (complete) has 181 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 59 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 59 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 69
Applied a total of 5 rules in 16 ms. Remains 59 /61 variables (removed 2) and now considering 69/72 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 59/61 places, 69/72 transitions.
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 513 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4284 steps, run visited all 3 properties in 47 ms. (steps per millisecond=91 )
Probabilistic random walk after 4284 steps, saw 1941 distinct states, run finished after 47 ms. (steps per millisecond=91 ) properties seen :3
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p3)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 790 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:48:18] [INFO ] Invariant cache hit.
[2023-03-08 08:48:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:48:18] [INFO ] Invariant cache hit.
[2023-03-08 08:48:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:18] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-08 08:48:18] [INFO ] Invariant cache hit.
[2023-03-08 08:48:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 61/61 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2 p3)), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2 p3)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2813898 steps, run timeout after 3001 ms. (steps per millisecond=937 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2813898 steps, saw 1078291 distinct states, run finished after 3004 ms. (steps per millisecond=936 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-08 08:48:22] [INFO ] Invariant cache hit.
[2023-03-08 08:48:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:48:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:48:22] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2 p3)), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2 p3))), (G (OR (NOT p0) p2 p3))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22928 reset in 102 ms.
Product exploration explored 100000 steps with 22993 reset in 101 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 72/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 70
Applied a total of 3 rules in 6 ms. Remains 60 /61 variables (removed 1) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 08:48:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:23] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:48:23] [INFO ] Invariant cache hit.
[2023-03-08 08:48:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:23] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 08:48:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:23] [INFO ] Invariant cache hit.
[2023-03-08 08:48:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/61 places, 70/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 60/61 places, 70/72 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-04 finished in 9451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 89
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 13 ms. Remains 58 /86 variables (removed 28) and now considering 64/120 (removed 56) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 08:48:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:48:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:48:23] [INFO ] Invariant cache hit.
[2023-03-08 08:48:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:48:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 08:48:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:23] [INFO ] Invariant cache hit.
[2023-03-08 08:48:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/86 places, 64/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 58/86 places, 64/120 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-05 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 s52 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 22871 reset in 184 ms.
Product exploration explored 100000 steps with 22930 reset in 182 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 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 61 ms :[(NOT p0)]
Finished random walk after 473 steps, including 103 resets, run visited all 1 properties in 2 ms. (steps per millisecond=236 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-08 08:48:24] [INFO ] Invariant cache hit.
[2023-03-08 08:48:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:48:24] [INFO ] Invariant cache hit.
[2023-03-08 08:48:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:48:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 08:48:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:24] [INFO ] Invariant cache hit.
[2023-03-08 08:48:24] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 58/58 places, 64/64 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 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 51 ms :[(NOT p0)]
Finished random walk after 1407 steps, including 319 resets, run visited all 1 properties in 7 ms. (steps per millisecond=201 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22910 reset in 94 ms.
Product exploration explored 100000 steps with 22949 reset in 92 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-08 08:48:25] [INFO ] Invariant cache hit.
[2023-03-08 08:48:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:48:25] [INFO ] Invariant cache hit.
[2023-03-08 08:48:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:48:25] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 08:48:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:25] [INFO ] Invariant cache hit.
[2023-03-08 08:48:25] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 58/58 places, 64/64 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-05 finished in 2192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 89
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 11 ms. Remains 58 /86 variables (removed 28) and now considering 64/120 (removed 56) transitions.
[2023-03-08 08:48:25] [INFO ] Invariant cache hit.
[2023-03-08 08:48:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:48:25] [INFO ] Invariant cache hit.
[2023-03-08 08:48:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/86 places, 64/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 58/86 places, 64/120 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 216 steps with 49 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-06 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 90
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 89
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 66 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 66 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 63 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 61 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 60 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 59 transition count 66
Applied a total of 61 rules in 22 ms. Remains 59 /86 variables (removed 27) and now considering 66/120 (removed 54) transitions.
// Phase 1: matrix 66 rows 59 cols
[2023-03-08 08:48:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 08:48:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/86 places, 66/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 59/86 places, 66/120 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-10 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U p1))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 97
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 65 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 65 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 63 transition count 79
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 62 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 61 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 61 transition count 73
Applied a total of 58 rules in 10 ms. Remains 61 /86 variables (removed 25) and now considering 73/120 (removed 47) transitions.
// Phase 1: matrix 73 rows 61 cols
[2023-03-08 08:48:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 73/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 61/86 places, 73/120 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s58 1)), p0:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-11 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(!p0)&&G(p2))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 94
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 73 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 69 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 67 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 65 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 65 transition count 79
Applied a total of 46 rules in 4 ms. Remains 65 /86 variables (removed 21) and now considering 79/120 (removed 41) transitions.
// Phase 1: matrix 79 rows 65 cols
[2023-03-08 08:48:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 08:48:26] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-08 08:48:26] [INFO ] Invariant cache hit.
[2023-03-08 08:48:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/86 places, 79/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 65/86 places, 79/120 transitions.
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s24 1)), p0:(AND (GEQ s1 1) (GEQ s58 1)), p2:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-12 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(((G(p2)&&p1) U G(p3)))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 94
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 68 transition count 87
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 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 61 transition count 71
Applied a total of 57 rules in 9 ms. Remains 61 /86 variables (removed 25) and now considering 71/120 (removed 49) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:48:27] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:48:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 08:48:27] [INFO ] Invariant cache hit.
[2023-03-08 08:48:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 08:48:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:48:27] [INFO ] Invariant cache hit.
[2023-03-08 08:48:27] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 71/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 61/86 places, 71/120 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (NOT p2), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 3}, { cond=(AND p3 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=4 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s59 1)), p3:(AND (GEQ s1 1) (GEQ s58 1)), p1:(AND (GEQ s1 1) (GEQ s58 1)), p2:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-13 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((p0||X(F(p1))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 95
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 66 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 77
Applied a total of 52 rules in 8 ms. Remains 63 /86 variables (removed 23) and now considering 77/120 (removed 43) transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 08:48:27] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:28] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:48:28] [INFO ] Invariant cache hit.
[2023-03-08 08:48:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 08:48:28] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 08:48:28] [INFO ] Invariant cache hit.
[2023-03-08 08:48:28] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 77/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 63/86 places, 77/120 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, false, (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s44 1)), p1:(OR (LT s19 1) (LT s36 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 33333 reset in 111 ms.
Product exploration explored 100000 steps with 33333 reset in 126 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(!p1)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 65 transition count 77
Applied a total of 47 rules in 14 ms. Remains 65 /86 variables (removed 21) and now considering 77/120 (removed 43) transitions.
// Phase 1: matrix 77 rows 65 cols
[2023-03-08 08:48:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:48:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:48:28] [INFO ] Invariant cache hit.
[2023-03-08 08:48:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:48:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 08:48:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:28] [INFO ] Invariant cache hit.
[2023-03-08 08:48:28] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/86 places, 77/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 65/86 places, 77/120 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s63 1)), p0:(OR (LT s18 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-15 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(G((F(p2)||p1))&&X(p3)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m08-LTLFireability-04
Stuttering acceptance computed with spot in 469 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 62 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 61 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 61 transition count 72
Applied a total of 55 rules in 16 ms. Remains 61 /86 variables (removed 25) and now considering 72/120 (removed 48) transitions.
// Phase 1: matrix 72 rows 61 cols
[2023-03-08 08:48:29] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:48:29] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 08:48:29] [INFO ] Invariant cache hit.
[2023-03-08 08:48:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:29] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 08:48:29] [INFO ] Invariant cache hit.
[2023-03-08 08:48:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 61/86 places, 72/120 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 202 ms. Remains : 61/86 places, 72/120 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(OR (LT s1 1) (LT s38 1)), p2:(OR (LT s1 1) (LT s55 1)), p0:(OR (LT s1 1) (LT s38 1)), p3:(OR (LT s17 1) (LT s23 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25448 reset in 96 ms.
Product exploration explored 100000 steps with 25435 reset in 102 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 539 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 537 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 08:48:31] [INFO ] Invariant cache hit.
[2023-03-08 08:48:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:48:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:48:31] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2023-03-08 08:48:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:48:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:48:31] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-08 08:48:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:32] [INFO ] After 26ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2023-03-08 08:48:32] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 08:48:32] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 72/72 transitions.
Graph (complete) has 181 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 59 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 59 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 69
Applied a total of 5 rules in 6 ms. Remains 59 /61 variables (removed 2) and now considering 69/72 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 59/61 places, 69/72 transitions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4284 steps, run visited all 3 properties in 37 ms. (steps per millisecond=115 )
Probabilistic random walk after 4284 steps, saw 1941 distinct states, run finished after 37 ms. (steps per millisecond=115 ) properties seen :3
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p3)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 881 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:48:33] [INFO ] Invariant cache hit.
[2023-03-08 08:48:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:48:33] [INFO ] Invariant cache hit.
[2023-03-08 08:48:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:33] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-08 08:48:33] [INFO ] Invariant cache hit.
[2023-03-08 08:48:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 61/61 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2 p3)), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2 p3)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2648352 steps, run timeout after 3001 ms. (steps per millisecond=882 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2648352 steps, saw 1028209 distinct states, run finished after 3001 ms. (steps per millisecond=882 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-08 08:48:37] [INFO ] Invariant cache hit.
[2023-03-08 08:48:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:48:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:48:37] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2 p3)), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2 p3))), (G (OR (NOT p0) p2 p3))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 514 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22982 reset in 93 ms.
Product exploration explored 100000 steps with 23009 reset in 96 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 72/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 70
Applied a total of 3 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 08:48:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:48:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:48:38] [INFO ] Invariant cache hit.
[2023-03-08 08:48:38] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:48:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 08:48:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:48:38] [INFO ] Invariant cache hit.
[2023-03-08 08:48:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/61 places, 70/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 60/61 places, 70/72 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-04 finished in 9704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-08 08:48:38] [INFO ] Flatten gal took : 14 ms
[2023-03-08 08:48:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 08:48:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 120 transitions and 469 arcs took 2 ms.
Total runtime 34318 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1616/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1616/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d0m08-LTLFireability-04
Could not compute solution for formula : DBSingleClientW-PT-d0m08-LTLFireability-05

BK_STOP 1678265320352

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DBSingleClientW-PT-d0m08-LTLFireability-04
ltl formula formula --ltl=/tmp/1616/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 86 places, 120 transitions and 469 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1616/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1616/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1616/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1616/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d0m08-LTLFireability-05
ltl formula formula --ltl=/tmp/1616/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 86 places, 120 transitions and 469 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1616/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1616/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1616/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1616/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d0m08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814480900212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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