Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:25 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-d0m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678238392888

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:19:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:19:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:19:54] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 01:19:54] [INFO ] Transformed 553 places.
[2023-03-08 01:19:54] [INFO ] Transformed 150 transitions.
[2023-03-08 01:19:54] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 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-d0m10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 118
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 118
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 83 transition count 113
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 83 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 82 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 82 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 82 transition count 109
Applied a total of 60 rules in 22 ms. Remains 82 /109 variables (removed 27) and now considering 109/150 (removed 41) transitions.
// Phase 1: matrix 109 rows 82 cols
[2023-03-08 01:19:54] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 01:19:54] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 01:19:54] [INFO ] Invariant cache hit.
[2023-03-08 01:19:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 01:19:54] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-08 01:19:54] [INFO ] Invariant cache hit.
[2023-03-08 01:19:55] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 109/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 82/109 places, 109/150 transitions.
Support contains 27 out of 82 places after structural reductions.
[2023-03-08 01:19:55] [INFO ] Flatten gal took : 33 ms
[2023-03-08 01:19:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 01:19:55] [INFO ] Input system was already deterministic with 109 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 25) seen :10
Incomplete Best-First random walk after 1001 steps, including 50 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 111 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 01:19:55] [INFO ] Invariant cache hit.
[2023-03-08 01:19:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:19:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:19:55] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-08 01:19:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:19:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:19:56] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-08 01:19:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 01:19:56] [INFO ] After 101ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2023-03-08 01:19:56] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-08 01:19:56] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 2 properties in 47 ms.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 76 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 76 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 75 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 75 transition count 96
Applied a total of 14 rules in 14 ms. Remains 75 /82 variables (removed 7) and now considering 96/109 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 75/82 places, 96/109 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 992 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 961 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1035 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Finished probabilistic random walk after 3905 steps, run visited all 7 properties in 46 ms. (steps per millisecond=84 )
Probabilistic random walk after 3905 steps, saw 1874 distinct states, run finished after 46 ms. (steps per millisecond=84 ) properties seen :7
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 274 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 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 21 place count 72 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 65 transition count 77
Applied a total of 37 rules in 11 ms. Remains 65 /82 variables (removed 17) and now considering 77/109 (removed 32) transitions.
// Phase 1: matrix 77 rows 65 cols
[2023-03-08 01:19:57] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:19:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 01:19:57] [INFO ] Invariant cache hit.
[2023-03-08 01:19:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:19:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-08 01:19:57] [INFO ] Invariant cache hit.
[2023-03-08 01:19:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/82 places, 77/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 65/82 places, 77/109 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s20 1) (GEQ s24 1)), p1:(OR (AND (GEQ s20 1) (GEQ s24 1)) (LT s1 1) (LT s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26888 reset in 248 ms.
Product exploration explored 100000 steps with 27002 reset in 139 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 996 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6112 steps, run visited all 2 properties in 17 ms. (steps per millisecond=359 )
Probabilistic random walk after 6112 steps, saw 2759 distinct states, run finished after 17 ms. (steps per millisecond=359 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-03-08 01:19:59] [INFO ] Invariant cache hit.
[2023-03-08 01:19:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 01:19:59] [INFO ] Invariant cache hit.
[2023-03-08 01:19:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:19:59] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-08 01:19:59] [INFO ] Invariant cache hit.
[2023-03-08 01:19:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 65/65 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 999 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6112 steps, run visited all 2 properties in 26 ms. (steps per millisecond=235 )
Probabilistic random walk after 6112 steps, saw 2759 distinct states, run finished after 26 ms. (steps per millisecond=235 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 26901 reset in 101 ms.
Product exploration explored 100000 steps with 26878 reset in 106 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 8 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-03-08 01:20:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:00] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 65/65 places, 77/77 transitions.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-03-08 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:20:01] [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 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 65/65 places, 77/77 transitions.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-00 finished in 3908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1) U p2))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 72 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 70 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 69 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 84
Applied a total of 29 rules in 5 ms. Remains 69 /82 variables (removed 13) and now considering 84/109 (removed 25) transitions.
// Phase 1: matrix 84 rows 69 cols
[2023-03-08 01:20:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 01:20:01] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-08 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/82 places, 84/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 69/82 places, 84/109 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s44 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(OR (AND (GEQ s1 1) (GEQ s61 1)) (AND (GEQ s1 1) (GEQ s64 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-01 finished in 474 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))||F(p0)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 58 transition count 64
Applied a total of 54 rules in 22 ms. Remains 58 /82 variables (removed 24) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:20:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:20:01] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 01:20:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:20:01] [INFO ] Invariant cache hit.
[2023-03-08 01:20:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/82 places, 64/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 58/82 places, 64/109 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-03 finished in 256 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))&&F((G((p2||X(p2)))||p1))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 86
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 71 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 66 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 66 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 61 transition count 72
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 61 transition count 70
Applied a total of 45 rules in 15 ms. Remains 61 /82 variables (removed 21) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 61 cols
[2023-03-08 01:20:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:20:02] [INFO ] Invariant cache hit.
[2023-03-08 01:20:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:20:02] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:20:02] [INFO ] Invariant cache hit.
[2023-03-08 01:20:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 61/82 places, 70/109 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s19 1) (LT s23 1)), p2:(AND (GEQ s1 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s52 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-04 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((F(p0)&&p1)))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 60 transition count 68
Applied a total of 48 rules in 9 ms. Remains 60 /82 variables (removed 22) and now considering 68/109 (removed 41) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 01:20:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:20:02] [INFO ] Invariant cache hit.
[2023-03-08 01:20:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:20:02] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 01:20:02] [INFO ] Invariant cache hit.
[2023-03-08 01:20:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 68/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 60/82 places, 68/109 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-06 finished in 280 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(p0))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 58 transition count 64
Applied a total of 54 rules in 11 ms. Remains 58 /82 variables (removed 24) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:20:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:20:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:20:02] [INFO ] Invariant cache hit.
[2023-03-08 01:20:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:20:02] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 01:20:02] [INFO ] Invariant cache hit.
[2023-03-08 01:20:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 58/82 places, 64/109 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-07 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1&&X(G((G(p3)||p2))))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 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 19 place count 73 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 70 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 69 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 68 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 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 35 place count 66 transition count 82
Applied a total of 35 rules in 16 ms. Remains 66 /82 variables (removed 16) and now considering 82/109 (removed 27) transitions.
// Phase 1: matrix 82 rows 66 cols
[2023-03-08 01:20:02] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:20:03] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 01:20:03] [INFO ] Invariant cache hit.
[2023-03-08 01:20:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:20:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-08 01:20:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:03] [INFO ] Invariant cache hit.
[2023-03-08 01:20:03] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/82 places, 82/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 66/82 places, 82/109 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p3), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=3 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p3), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=5 dest: 4}, { cond=(AND p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s63 1)), p0:(OR (LT s1 1) (LT s44 1)), p2:(OR (LT s1 1) (LT s63 1)), p3:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22877 reset in 144 ms.
Product exploration explored 100000 steps with 22954 reset in 159 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 218 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR p2 p3)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (X (OR p2 p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1040 ms. Reduced automaton from 6 states, 23 edges and 4 AP (stutter insensitive) to 6 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 1124803 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{0=1, 1=1, 2=1, 4=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Probabilistic random walk after 1124803 steps, saw 446293 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :10
Running SMT prover for 2 properties.
[2023-03-08 01:20:09] [INFO ] Invariant cache hit.
[2023-03-08 01:20:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR p2 p3)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (X (OR p2 p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3)), (F (NOT (OR p2 p3))), (F (AND p2 p3)), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (AND p2 (NOT p3)))), (F (AND p1 p3))]
Knowledge based reduction with 23 factoid took 1484 ms. Reduced automaton from 6 states, 23 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 01:20:11] [INFO ] Invariant cache hit.
[2023-03-08 01:20:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 01:20:11] [INFO ] Invariant cache hit.
[2023-03-08 01:20:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:20:11] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 01:20:11] [INFO ] Invariant cache hit.
[2023-03-08 01:20:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 66/66 places, 82/82 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 218 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X (OR p2 p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR (NOT p1) p2)), (X p1), (X (AND p1 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p2) p3))), (X (OR (AND (NOT p1) p0) (AND p2 p0))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (OR (NOT p1) p2))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (OR (AND (NOT p1) p0) (AND p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1191 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 522 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-08 01:20:13] [INFO ] Invariant cache hit.
[2023-03-08 01:20:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:20:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:20:13] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-08 01:20:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:20:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:20:13] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-08 01:20:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:20:14] [INFO ] After 95ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-08 01:20:14] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-08 01:20:14] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 77
Applied a total of 2 rules in 5 ms. Remains 65 /66 variables (removed 1) and now considering 77/82 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 65/66 places, 77/82 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 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 492 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 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 525 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 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 530 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Finished probabilistic random walk after 19461 steps, run visited all 11 properties in 105 ms. (steps per millisecond=185 )
Probabilistic random walk after 19461 steps, saw 8760 distinct states, run finished after 105 ms. (steps per millisecond=185 ) properties seen :11
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X (OR p2 p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR (NOT p1) p2)), (X p1), (X (AND p1 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p2) p3))), (X (OR (AND (NOT p1) p0) (AND p2 p0))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (OR (NOT p1) p2))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (OR (AND (NOT p1) p0) (AND p2 p0)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3))), (F (AND (NOT p2) p3)), (F (NOT (AND p1 (NOT p3)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (F (AND p2 p3)), (F (NOT (OR p2 p3))), (F (NOT (AND p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (AND p1 p3)), (F (AND (NOT p1) p3))]
Knowledge based reduction with 22 factoid took 1149 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 22782 reset in 108 ms.
Product exploration explored 100000 steps with 22882 reset in 212 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 01:20:17] [INFO ] Invariant cache hit.
[2023-03-08 01:20:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 01:20:17] [INFO ] Invariant cache hit.
[2023-03-08 01:20:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:20:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 01:20:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:17] [INFO ] Invariant cache hit.
[2023-03-08 01:20:17] [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 192 ms. Remains : 66/66 places, 82/82 transitions.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-09 finished in 14950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((F((!p0&&F(p1)))||G(!p0))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 67 transition count 82
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 73
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 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 60 transition count 70
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 60 transition count 69
Applied a total of 49 rules in 2 ms. Remains 60 /82 variables (removed 22) and now considering 69/109 (removed 40) transitions.
// Phase 1: matrix 69 rows 60 cols
[2023-03-08 01:20:17] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:20:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:20:17] [INFO ] Invariant cache hit.
[2023-03-08 01:20:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:18] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:20:18] [INFO ] Invariant cache hit.
[2023-03-08 01:20:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 69/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 60/82 places, 69/109 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s16 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22878 reset in 102 ms.
Product exploration explored 100000 steps with 23017 reset in 104 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 35 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:19] [INFO ] Invariant cache hit.
[2023-03-08 01:20:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:20:19] [INFO ] Invariant cache hit.
[2023-03-08 01:20:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:19] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-08 01:20:19] [INFO ] Invariant cache hit.
[2023-03-08 01:20:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 73 steps, including 17 resets, run visited all 2 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22921 reset in 93 ms.
Product exploration explored 100000 steps with 22918 reset in 114 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:20] [INFO ] Invariant cache hit.
[2023-03-08 01:20:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 60/60 places, 69/69 transitions.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:20] [INFO ] Invariant cache hit.
[2023-03-08 01:20:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:20:20] [INFO ] Invariant cache hit.
[2023-03-08 01:20:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:20] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 01:20:20] [INFO ] Invariant cache hit.
[2023-03-08 01:20:20] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 60/60 places, 69/69 transitions.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-10 finished in 2758 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(F(p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 67 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 75
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 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 60 transition count 70
Applied a total of 50 rules in 10 ms. Remains 60 /82 variables (removed 22) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:20:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:20] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:20:20] [INFO ] Invariant cache hit.
[2023-03-08 01:20:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:20:20] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 01:20:20] [INFO ] Invariant cache hit.
[2023-03-08 01:20:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 60/82 places, 70/109 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s5 1) (LT s22 1)), p0:(OR (LT s1 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-12 finished in 679 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(F(!p0))||(F(!p0)&&p1))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
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 61 transition count 71
Applied a total of 46 rules in 21 ms. Remains 61 /82 variables (removed 21) and now considering 71/109 (removed 38) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:20:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:20:21] [INFO ] Invariant cache hit.
[2023-03-08 01:20:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:20:21] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 01:20:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:21] [INFO ] Invariant cache hit.
[2023-03-08 01:20:21] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 71/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 61/82 places, 71/109 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s60 1)), p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22999 reset in 179 ms.
Product exploration explored 100000 steps with 22892 reset in 177 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Finished random walk after 3571 steps, including 805 resets, run visited all 2 properties in 34 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-08 01:20:22] [INFO ] Invariant cache hit.
[2023-03-08 01:20:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:20:22] [INFO ] Invariant cache hit.
[2023-03-08 01:20:22] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:20:22] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 01:20:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:22] [INFO ] Invariant cache hit.
[2023-03-08 01:20:22] [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 170 ms. Remains : 61/61 places, 71/71 transitions.
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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Finished random walk after 2321 steps, including 538 resets, run visited all 2 properties in 29 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Product exploration explored 100000 steps with 22825 reset in 97 ms.
Product exploration explored 100000 steps with 22876 reset in 98 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-08 01:20:23] [INFO ] Invariant cache hit.
[2023-03-08 01:20:23] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:20:23] [INFO ] Invariant cache hit.
[2023-03-08 01:20:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:20:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 01:20:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:23] [INFO ] Invariant cache hit.
[2023-03-08 01:20:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 61/61 places, 71/71 transitions.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-13 finished in 2474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1&&X(G((G(p3)||p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((F((!p0&&F(p1)))||G(!p0))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m10-LTLFireability-10
Stuttering acceptance computed with spot in 125 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 67 transition count 82
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 73
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 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 60 transition count 70
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 60 transition count 69
Applied a total of 49 rules in 16 ms. Remains 60 /82 variables (removed 22) and now considering 69/109 (removed 40) transitions.
// Phase 1: matrix 69 rows 60 cols
[2023-03-08 01:20:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:20:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:20:24] [INFO ] Invariant cache hit.
[2023-03-08 01:20:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 01:20:24] [INFO ] Invariant cache hit.
[2023-03-08 01:20:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/82 places, 69/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 175 ms. Remains : 60/82 places, 69/109 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s16 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22936 reset in 92 ms.
Product exploration explored 100000 steps with 23029 reset in 103 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 94 steps, including 19 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:25] [INFO ] Invariant cache hit.
[2023-03-08 01:20:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:20:25] [INFO ] Invariant cache hit.
[2023-03-08 01:20:25] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:25] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 01:20:25] [INFO ] Invariant cache hit.
[2023-03-08 01:20:25] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 203 steps, including 46 resets, run visited all 2 properties in 7 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23019 reset in 97 ms.
Product exploration explored 100000 steps with 22908 reset in 101 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:20:26] [INFO ] Invariant cache hit.
[2023-03-08 01:20:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 60/60 places, 69/69 transitions.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:26] [INFO ] Invariant cache hit.
[2023-03-08 01:20:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 01:20:26] [INFO ] Invariant cache hit.
[2023-03-08 01:20:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:26] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 01:20:26] [INFO ] Invariant cache hit.
[2023-03-08 01:20:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 60/60 places, 69/69 transitions.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-10 finished in 2762 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(F(!p0))||(F(!p0)&&p1))))'
[2023-03-08 01:20:26] [INFO ] Flatten gal took : 12 ms
[2023-03-08 01:20:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:20:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 109 transitions and 427 arcs took 1 ms.
Total runtime 32565 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

FORMULA DBSingleClientW-PT-d0m10-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DBSingleClientW-PT-d0m10-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678238448208

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m10-LTLFireability-00
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d0m10-LTLFireability-00
lola: result : false
lola: markings : 2081
lola: fired transitions : 3461
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 DBSingleClientW-PT-d0m10-LTLFireability-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for DBSingleClientW-PT-d0m10-LTLFireability-10
lola: result : false
lola: markings : 112901
lola: fired transitions : 443975
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 3 DBSingleClientW-PT-d0m10-LTLFireability-09
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for DBSingleClientW-PT-d0m10-LTLFireability-09
lola: result : false
lola: markings : 382
lola: fired transitions : 653
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 13 DBSingleClientW-PT-d0m10-LTLFireability-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m10-LTLFireability-00: LTL false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-09: CONJ false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d0m10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/3600 9/32 DBSingleClientW-PT-d0m10-LTLFireability-13 1308701 m, 261740 m/sec, 3396771 t fired, .

Time elapsed: 5 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m10-LTLFireability-00: LTL false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-09: CONJ false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d0m10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/3600 18/32 DBSingleClientW-PT-d0m10-LTLFireability-13 2622459 m, 262751 m/sec, 6984549 t fired, .

Time elapsed: 10 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m10-LTLFireability-00: LTL false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-09: CONJ false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d0m10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/3600 25/32 DBSingleClientW-PT-d0m10-LTLFireability-13 3793806 m, 234269 m/sec, 10612463 t fired, .

Time elapsed: 15 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for DBSingleClientW-PT-d0m10-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m10-LTLFireability-00: LTL false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-09: CONJ false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d0m10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m10-LTLFireability-00: LTL false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-09: CONJ false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-10: LTL false LTL model checker
DBSingleClientW-PT-d0m10-LTLFireability-13: LTL unknown AGGR


Time elapsed: 20 secs. Pages in use: 32

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-d0m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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