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-167814478000204.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-d0m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478000204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 13K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:32 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-d0m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678238128889

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-d0m07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:15:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:15:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:15:30] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 01:15:30] [INFO ] Transformed 553 places.
[2023-03-08 01:15:30] [INFO ] Transformed 150 transitions.
[2023-03-08 01:15:30] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-15 TRUE 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 82 transition count 112
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 82 transition count 112
Applied a total of 58 rules in 25 ms. Remains 82 /109 variables (removed 27) and now considering 112/150 (removed 38) transitions.
// Phase 1: matrix 112 rows 82 cols
[2023-03-08 01:15:30] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-08 01:15:30] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 01:15:30] [INFO ] Invariant cache hit.
[2023-03-08 01:15:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 01:15:30] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 01:15:30] [INFO ] Invariant cache hit.
[2023-03-08 01:15:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 112/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 82/109 places, 112/150 transitions.
Support contains 27 out of 82 places after structural reductions.
[2023-03-08 01:15:31] [INFO ] Flatten gal took : 26 ms
[2023-03-08 01:15:31] [INFO ] Flatten gal took : 17 ms
[2023-03-08 01:15:31] [INFO ] Input system was already deterministic with 112 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 20) seen :8
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 623 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 526 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 961 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2023-03-08 01:15:32] [INFO ] Invariant cache hit.
[2023-03-08 01:15:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:15:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:32] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:7
[2023-03-08 01:15:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 01:15:32] [INFO ] After 15ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-08 01:15:32] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-08 01:15:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-08 01:15:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:33] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-08 01:15:33] [INFO ] After 84ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-08 01:15:33] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-08 01:15:33] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 12 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 103
Applied a total of 10 rules in 12 ms. Remains 77 /82 variables (removed 5) and now considering 103/112 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 77/82 places, 103/112 transitions.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 995 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1010 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Finished probabilistic random walk after 15123 steps, run visited all 8 properties in 61 ms. (steps per millisecond=247 )
Probabilistic random walk after 15123 steps, saw 6832 distinct states, run finished after 61 ms. (steps per millisecond=247 ) properties seen :8
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 277 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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(X(p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 94
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 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 66 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 63 transition count 77
Applied a total of 44 rules in 15 ms. Remains 63 /82 variables (removed 19) and now considering 77/112 (removed 35) transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 01:15:34] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 01:15:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:15:34] [INFO ] Invariant cache hit.
[2023-03-08 01:15:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:15:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 01:15:34] [INFO ] Invariant cache hit.
[2023-03-08 01:15:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 77/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 63/82 places, 77/112 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s44 1)), p1:(OR (LT s19 1) (LT s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 294 ms.
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-00 finished in 1047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 65 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 58 transition count 64
Applied a total of 56 rules in 27 ms. Remains 58 /82 variables (removed 24) and now considering 64/112 (removed 48) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:15:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:15:35] [INFO ] Invariant cache hit.
[2023-03-08 01:15:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:15:35] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-08 01:15:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:15:35] [INFO ] Invariant cache hit.
[2023-03-08 01:15:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/82 places, 64/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 58/82 places, 64/112 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-01 finished in 281 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((X(p1)||p0)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 90
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 67 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 63 transition count 73
Applied a total of 44 rules in 8 ms. Remains 63 /82 variables (removed 19) and now considering 73/112 (removed 39) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:15:35] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:15:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:15:35] [INFO ] Invariant cache hit.
[2023-03-08 01:15:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 01:15:35] [INFO ] Invariant cache hit.
[2023-03-08 01:15:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 73/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 63/82 places, 73/112 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s59 1)) (AND (GEQ s7 1) (GEQ s45 1))), p1:(AND (GEQ s7 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-02 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 64 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 52 place count 60 transition count 68
Applied a total of 52 rules in 24 ms. Remains 60 /82 variables (removed 22) and now considering 68/112 (removed 44) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 01:15:36] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:15:36] [INFO ] Invariant cache hit.
[2023-03-08 01:15:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:15:36] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:15:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:36] [INFO ] Invariant cache hit.
[2023-03-08 01:15:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/82 places, 68/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 60/82 places, 68/112 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23160 reset in 181 ms.
Product exploration explored 100000 steps with 22907 reset in 124 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 519 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1181 steps, run visited all 1 properties in 10 ms. (steps per millisecond=118 )
Probabilistic random walk after 1181 steps, saw 610 distinct states, run finished after 10 ms. (steps per millisecond=118 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:15:37] [INFO ] Invariant cache hit.
[2023-03-08 01:15:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:15:37] [INFO ] Invariant cache hit.
[2023-03-08 01:15:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:15:37] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 01:15:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:37] [INFO ] Invariant cache hit.
[2023-03-08 01:15:37] [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 179 ms. Remains : 60/60 places, 68/68 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1181 steps, run visited all 1 properties in 6 ms. (steps per millisecond=196 )
Probabilistic random walk after 1181 steps, saw 610 distinct states, run finished after 6 ms. (steps per millisecond=196 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23073 reset in 84 ms.
Product exploration explored 100000 steps with 22932 reset in 88 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:15:38] [INFO ] Invariant cache hit.
[2023-03-08 01:15:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:15:38] [INFO ] Invariant cache hit.
[2023-03-08 01:15:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:15:38] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-08 01:15:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:38] [INFO ] Invariant cache hit.
[2023-03-08 01:15:38] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-06 finished in 2398 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)||G(p1))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 94
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 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 67 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 62 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 61 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 60 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 60 transition count 71
Applied a total of 51 rules in 12 ms. Remains 60 /82 variables (removed 22) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 60 cols
[2023-03-08 01:15:38] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:15:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:15:38] [INFO ] Invariant cache hit.
[2023-03-08 01:15:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:38] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 01:15:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:38] [INFO ] Invariant cache hit.
[2023-03-08 01:15:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/82 places, 71/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 60/82 places, 71/112 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s46 1)), p1:(OR (AND (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s8 1) (GEQ s46 1)) (AND (GEQ s1 1) (GEQ s43 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22856 reset in 139 ms.
Product exploration explored 100000 steps with 22980 reset in 180 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 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 (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 305 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 1036 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:15:39] [INFO ] Invariant cache hit.
[2023-03-08 01:15:39] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 414 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND p0 (NOT p1))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 71/71 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-08 01:15:39] [INFO ] Invariant cache hit.
[2023-03-08 01:15:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:15:40] [INFO ] Invariant cache hit.
[2023-03-08 01:15:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 01:15:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:15:40] [INFO ] Invariant cache hit.
[2023-03-08 01:15:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 60/60 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 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 (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 1044 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:15:40] [INFO ] Invariant cache hit.
[2023-03-08 01:15:40] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 415 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22948 reset in 163 ms.
Product exploration explored 100000 steps with 22900 reset in 136 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-08 01:15:41] [INFO ] Invariant cache hit.
[2023-03-08 01:15:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 01:15:41] [INFO ] Invariant cache hit.
[2023-03-08 01:15:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:41] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-08 01:15:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:15:41] [INFO ] Invariant cache hit.
[2023-03-08 01:15:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 60/60 places, 71/71 transitions.
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-07 finished in 3232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G((X(p3)&&p2))||G(!p0)))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 112/112 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 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 68 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 68 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 64 transition count 75
Applied a total of 41 rules in 8 ms. Remains 64 /82 variables (removed 18) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 01:15:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:15:41] [INFO ] Invariant cache hit.
[2023-03-08 01:15:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:41] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-08 01:15:41] [INFO ] Invariant cache hit.
[2023-03-08 01:15:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 75/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 64/82 places, 75/112 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p3), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s45 1)), p0:(AND (GEQ s1 1) (GEQ s60 1)), p2:(AND (GEQ s19 1) (GEQ s24 1)), p3:(AND (GEQ s19 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22965 reset in 184 ms.
Product exploration explored 100000 steps with 22945 reset in 144 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 208 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 p3))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p2 p3))), (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p3)))), true, (X (X (OR (NOT p2) (NOT p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1003 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2345 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4403 steps, run visited all 1 properties in 9 ms. (steps per millisecond=489 )
Probabilistic random walk after 4403 steps, saw 2011 distinct states, run finished after 9 ms. (steps per millisecond=489 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 p3))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p2 p3))), (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0 p2 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p3)))), true, (X (X (OR (NOT p2) (NOT p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 26 factoid took 834 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Support contains 2 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:15:44] [INFO ] Invariant cache hit.
[2023-03-08 01:15:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:15:44] [INFO ] Invariant cache hit.
[2023-03-08 01:15:44] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:44] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-08 01:15:44] [INFO ] Invariant cache hit.
[2023-03-08 01:15:44] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 64/64 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 208 edges and 64 vertex of which 63 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 : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4403 steps, run visited all 1 properties in 9 ms. (steps per millisecond=489 )
Probabilistic random walk after 4403 steps, saw 2011 distinct states, run finished after 9 ms. (steps per millisecond=489 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Product exploration explored 100000 steps with 22879 reset in 91 ms.
Product exploration explored 100000 steps with 22786 reset in 84 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 63 transition count 73
Applied a total of 3 rules in 10 ms. Remains 63 /64 variables (removed 1) and now considering 73/75 (removed 2) transitions.
[2023-03-08 01:15:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:15:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:15:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/64 places, 73/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 63/64 places, 73/75 transitions.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 63 transition count 73
Applied a total of 3 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 73/75 (removed 2) transitions.
[2023-03-08 01:15:45] [INFO ] Invariant cache hit.
[2023-03-08 01:15:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:15:45] [INFO ] Invariant cache hit.
[2023-03-08 01:15:45] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:45] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 01:15:45] [INFO ] Invariant cache hit.
[2023-03-08 01:15:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/64 places, 73/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 63/64 places, 73/75 transitions.
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-08 finished in 4374 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)||G(p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 66 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 64 transition count 78
Applied a total of 39 rules in 9 ms. Remains 64 /82 variables (removed 18) and now considering 78/112 (removed 34) transitions.
// Phase 1: matrix 78 rows 64 cols
[2023-03-08 01:15:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:15:46] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:15:46] [INFO ] Invariant cache hit.
[2023-03-08 01:15:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 01:15:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:46] [INFO ] Invariant cache hit.
[2023-03-08 01:15:46] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 78/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 64/82 places, 78/112 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s15 1) (LT s36 1)), p1:(OR (LT s1 1) (LT s58 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22840 reset in 123 ms.
Product exploration explored 100000 steps with 22987 reset in 129 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 276 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 3134809 steps, run timeout after 3001 ms. (steps per millisecond=1044 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 3134809 steps, saw 1170193 distinct states, run finished after 3002 ms. (steps per millisecond=1044 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:15:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:50] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 407 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 01:15:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [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 161 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 302 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 522 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1038 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 3175111 steps, run timeout after 3001 ms. (steps per millisecond=1058 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 3175111 steps, saw 1185428 distinct states, run finished after 3004 ms. (steps per millisecond=1056 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-08 01:15:54] [INFO ] Invariant cache hit.
[2023-03-08 01:15:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:15:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:15:54] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 405 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22852 reset in 113 ms.
Product exploration explored 100000 steps with 22929 reset in 126 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 01:15:55] [INFO ] Invariant cache hit.
[2023-03-08 01:15:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:15:55] [INFO ] Invariant cache hit.
[2023-03-08 01:15:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-08 01:15:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:55] [INFO ] Invariant cache hit.
[2023-03-08 01:15:55] [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 175 ms. Remains : 64/64 places, 78/78 transitions.
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-09 finished in 9508 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((G(p0) U p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 90
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 67 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 63 transition count 73
Applied a total of 44 rules in 8 ms. Remains 63 /82 variables (removed 19) and now considering 73/112 (removed 39) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:15:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 01:15:55] [INFO ] Invariant cache hit.
[2023-03-08 01:15:55] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-08 01:15:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:55] [INFO ] Invariant cache hit.
[2023-03-08 01:15:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 73/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 63/82 places, 73/112 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s4 1) (GEQ s23 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-12 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F((G(p0)||p1))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 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 23 place count 71 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 65 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 63 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 63 transition count 77
Applied a total of 43 rules in 4 ms. Remains 63 /82 variables (removed 19) and now considering 77/112 (removed 35) transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 01:15:55] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:15:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:15:55] [INFO ] Invariant cache hit.
[2023-03-08 01:15:55] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 01:15:56] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 01:15:56] [INFO ] Invariant cache hit.
[2023-03-08 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 77/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 63/82 places, 77/112 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s15 1) (LT s40 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 2 factoid took 44 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-13 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&X(p0)))&&(p1 U p2)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 64 transition count 75
Applied a total of 42 rules in 5 ms. Remains 64 /82 variables (removed 18) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 01:15:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:15:56] [INFO ] Invariant cache hit.
[2023-03-08 01:15:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:56] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 01:15:56] [INFO ] Invariant cache hit.
[2023-03-08 01:15:56] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 75/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 64/82 places, 75/112 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s52 1)), p2:(AND (GEQ s1 1) (GEQ s32 1)), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-14 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)||G(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' '!(((p0 U p1)||G((X(p3)&&p2))||G(!p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m07-LTLFireability-08
Stuttering acceptance computed with spot in 234 ms :[true, (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), p0]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 112/112 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 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 68 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 68 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 64 transition count 75
Applied a total of 41 rules in 13 ms. Remains 64 /82 variables (removed 18) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 01:15:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:15:57] [INFO ] Invariant cache hit.
[2023-03-08 01:15:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 01:15:57] [INFO ] Invariant cache hit.
[2023-03-08 01:15:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/82 places, 75/112 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 187 ms. Remains : 64/82 places, 75/112 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p3), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s45 1)), p0:(AND (GEQ s1 1) (GEQ s60 1)), p2:(AND (GEQ s19 1) (GEQ s24 1)), p3:(AND (GEQ s19 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22976 reset in 133 ms.
Entered a terminal (fully accepting) state of product in 53694 steps with 12363 reset in 75 ms.
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-08 finished in 708 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)||G(p1))))'
[2023-03-08 01:15:57] [INFO ] Flatten gal took : 10 ms
[2023-03-08 01:15:57] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:15:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 112 transitions and 439 arcs took 1 ms.
Total runtime 27515 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m07
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

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

FORMULA DBSingleClientW-PT-d0m07-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m07-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678238179132

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
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: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 10 (type EXCL) for 9 DBSingleClientW-PT-d0m07-LTLFireability-09
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for DBSingleClientW-PT-d0m07-LTLFireability-09
lola: result : false
lola: markings : 826
lola: fired transitions : 1484
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DBSingleClientW-PT-d0m07-LTLFireability-08
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DBSingleClientW-PT-d0m07-LTLFireability-08
lola: result : false
lola: markings : 303
lola: fired transitions : 538
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m07-LTLFireability-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m07-LTLFireability-08: LTL false LTL model checker
DBSingleClientW-PT-d0m07-LTLFireability-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 11/32 DBSingleClientW-PT-d0m07-LTLFireability-06 1554869 m, 310973 m/sec, 3833394 t fired, .

Time elapsed: 5 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m07-LTLFireability-08: LTL false LTL model checker
DBSingleClientW-PT-d0m07-LTLFireability-09: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 19/32 DBSingleClientW-PT-d0m07-LTLFireability-06 2900836 m, 269193 m/sec, 7427530 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 27/32 DBSingleClientW-PT-d0m07-LTLFireability-06 4111915 m, 242215 m/sec, 11032049 t fired, .

Time elapsed: 15 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for DBSingleClientW-PT-d0m07-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m07-LTLFireability-08: LTL false LTL model checker
DBSingleClientW-PT-d0m07-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d0m07-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
DBSingleClientW-PT-d0m07-LTLFireability-07: LTL 0 1 0 0 1 0 0 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: LAUNCH task # 4 (type EXCL) for 3 DBSingleClientW-PT-d0m07-LTLFireability-07
lola: time limit : 3580 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DBSingleClientW-PT-d0m07-LTLFireability-07
lola: result : false
lola: markings : 1027
lola: fired transitions : 1969
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m07-LTLFireability-06: LTL unknown AGGR
DBSingleClientW-PT-d0m07-LTLFireability-07: LTL false LTL model checker
DBSingleClientW-PT-d0m07-LTLFireability-08: LTL false LTL model checker
DBSingleClientW-PT-d0m07-LTLFireability-09: LTL false LTL model checker


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-d0m07"
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-d0m07, 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-167814478000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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