Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:24 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-d0m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678264974830

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:42:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:42:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:42:56] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-08 08:42:56] [INFO ] Transformed 553 places.
[2023-03-08 08:42:56] [INFO ] Transformed 150 transitions.
[2023-03-08 08:42:56] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 135 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-d0m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 37 place count 83 transition count 109
Iterating global reduction 1 with 19 rules applied. Total rules applied 56 place count 83 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 83 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 76 transition count 101
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 76 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 75 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 75 transition count 100
Applied a total of 73 rules in 212 ms. Remains 75 /109 variables (removed 34) and now considering 100/150 (removed 50) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-08 08:42:56] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 08:42:57] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 08:42:57] [INFO ] Invariant cache hit.
[2023-03-08 08:42:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 08:42:57] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-08 08:42:57] [INFO ] Invariant cache hit.
[2023-03-08 08:42:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/109 places, 100/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 75/109 places, 100/150 transitions.
Support contains 25 out of 75 places after structural reductions.
[2023-03-08 08:42:57] [INFO ] Flatten gal took : 30 ms
[2023-03-08 08:42:57] [INFO ] Flatten gal took : 28 ms
[2023-03-08 08:42:57] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1021 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 08:42:58] [INFO ] Invariant cache hit.
[2023-03-08 08:42:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:42:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:42:58] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-08 08:42:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 08:42:58] [INFO ] After 15ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 08:42:58] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 08:42:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:42:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:42:59] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 08:42:59] [INFO ] After 52ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 08:42:59] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-08 08:42:59] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 100/100 transitions.
Graph (complete) has 228 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 71 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 71 transition count 92
Applied a total of 8 rules in 15 ms. Remains 71 /75 variables (removed 4) and now considering 92/100 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 71/75 places, 92/100 transitions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1040 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1050 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Probably explored full state space saw : 7218 states, properties seen :4
Probabilistic random walk after 17805 steps, saw 7218 distinct states, run finished after 75 ms. (steps per millisecond=237 ) properties seen :4
Explored full state space saw : 7255 states, properties seen :0
Exhaustive walk after 17842 steps, saw 7255 distinct states, run finished after 20 ms. (steps per millisecond=892 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 250 edges and 75 vertex of which 74 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' '!((X(p0)||G((!p0&&F(p1)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 61 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 59 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 59 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 59 transition count 69
Applied a total of 39 rules in 11 ms. Remains 59 /75 variables (removed 16) and now considering 69/100 (removed 31) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 08:43:00] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 08:43:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 08:43:00] [INFO ] Invariant cache hit.
[2023-03-08 08:43:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:00] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-08 08:43:00] [INFO ] Invariant cache hit.
[2023-03-08 08:43:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/75 places, 69/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 59/75 places, 69/100 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1)), p1:(AND (GEQ s1 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 4 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-00 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((X(X(!p0))||G(p1)))) U (p0||F(p2))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 66 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 63 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 63 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 71
Applied a total of 33 rules in 15 ms. Remains 61 /75 variables (removed 14) and now considering 71/100 (removed 29) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:43:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:43:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 08:43:01] [INFO ] Invariant cache hit.
[2023-03-08 08:43:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:43:01] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 08:43:01] [INFO ] Invariant cache hit.
[2023-03-08 08:43:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 71/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 61/75 places, 71/100 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s3 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-03 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(!p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 64 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 64 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 76
Applied a total of 25 rules in 5 ms. Remains 64 /75 variables (removed 11) and now considering 76/100 (removed 24) transitions.
// Phase 1: matrix 76 rows 64 cols
[2023-03-08 08:43:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:43:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:43:01] [INFO ] Invariant cache hit.
[2023-03-08 08:43:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 08:43:01] [INFO ] Invariant cache hit.
[2023-03-08 08:43:01] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 76/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 64/75 places, 76/100 transitions.
Stuttering acceptance computed with spot in 197 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s22 1) (GEQ s43 1)), p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23030 reset in 266 ms.
Product exploration explored 100000 steps with 23006 reset in 183 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.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2340 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 995 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1072 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:43:03] [INFO ] Invariant cache hit.
[2023-03-08 08:43:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:03] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 08:43:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:03] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:03] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:03] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:03] [INFO ] After 15ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:03] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 08:43:03] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 76/76 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 75
Applied a total of 2 rules in 7 ms. Remains 63 /64 variables (removed 1) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 63/64 places, 75/76 transitions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 996 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2020 steps, run visited all 2 properties in 15 ms. (steps per millisecond=134 )
Probabilistic random walk after 2020 steps, saw 944 distinct states, run finished after 20 ms. (steps per millisecond=101 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 476 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 08:43:04] [INFO ] Invariant cache hit.
[2023-03-08 08:43:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 08:43:04] [INFO ] Invariant cache hit.
[2023-03-08 08:43:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:04] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-08 08:43:04] [INFO ] Invariant cache hit.
[2023-03-08 08:43:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 64/64 places, 76/76 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 : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 1075 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 991 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:43:05] [INFO ] Invariant cache hit.
[2023-03-08 08:43:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:05] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 08:43:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:05] [INFO ] After 7ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:05] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:43:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:05] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:05] [INFO ] After 14ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:05] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 08:43:05] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 76/76 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 75
Applied a total of 2 rules in 6 ms. Remains 63 /64 variables (removed 1) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/64 places, 75/76 transitions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2020 steps, run visited all 2 properties in 19 ms. (steps per millisecond=106 )
Probabilistic random walk after 2020 steps, saw 944 distinct states, run finished after 19 ms. (steps per millisecond=106 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 428 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22889 reset in 108 ms.
Product exploration explored 100000 steps with 22879 reset in 132 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[p1, p1, (NOT p0), (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, 76/76 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 08:43:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 64/64 places, 76/76 transitions.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 64/64 places, 76/76 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-05 finished in 6059 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 66 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 63 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 63 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 71
Applied a total of 33 rules in 16 ms. Remains 61 /75 variables (removed 14) and now considering 71/100 (removed 29) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:43:07] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:43:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:43:07] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-08 08:43:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/75 places, 71/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 61/75 places, 71/100 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-06 finished in 266 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 61 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 59 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 59 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 59 transition count 69
Applied a total of 39 rules in 17 ms. Remains 59 /75 variables (removed 16) and now considering 69/100 (removed 31) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 08:43:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:43:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:43:07] [INFO ] Invariant cache hit.
[2023-03-08 08:43:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:08] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 08:43:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:08] [INFO ] Invariant cache hit.
[2023-03-08 08:43:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/75 places, 69/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 59/75 places, 69/100 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-07 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 s42 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 22932 reset in 133 ms.
Product exploration explored 100000 steps with 22898 reset in 144 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 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 297 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 2288 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 538 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3694 steps, run visited all 1 properties in 8 ms. (steps per millisecond=461 )
Probabilistic random walk after 3694 steps, saw 1640 distinct states, run finished after 9 ms. (steps per millisecond=410 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 08:43:09] [INFO ] Invariant cache hit.
[2023-03-08 08:43:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:43:09] [INFO ] Invariant cache hit.
[2023-03-08 08:43:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:09] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-08 08:43:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:09] [INFO ] Invariant cache hit.
[2023-03-08 08:43:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 59/59 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 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 114 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 89 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2326 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 1319 steps, including 62 resets, run visited all 1 properties in 2 ms. (steps per millisecond=659 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22897 reset in 96 ms.
Product exploration explored 100000 steps with 22841 reset in 193 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 08:43:10] [INFO ] Invariant cache hit.
[2023-03-08 08:43:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:43:10] [INFO ] Invariant cache hit.
[2023-03-08 08:43:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:10] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-08 08:43:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:10] [INFO ] Invariant cache hit.
[2023-03-08 08:43:10] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 59/59 places, 69/69 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-07 finished in 2723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 65 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 65 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 63 transition count 73
Applied a total of 29 rules in 7 ms. Remains 63 /75 variables (removed 12) and now considering 73/100 (removed 27) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 08:43:10] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:43:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:43:10] [INFO ] Invariant cache hit.
[2023-03-08 08:43:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:43:10] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-08 08:43:10] [INFO ] Invariant cache hit.
[2023-03-08 08:43:10] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 73/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 63/75 places, 73/100 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (GEQ s23 1) (GEQ s37 1))) (NOT (AND (GEQ s17 1) (GEQ s24 1)))), p0:(AND (GEQ s17 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 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 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-08 finished in 835 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)&&X(G(!p1)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 61 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 59 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 59 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 59 transition count 69
Applied a total of 39 rules in 8 ms. Remains 59 /75 variables (removed 16) and now considering 69/100 (removed 31) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 08:43:11] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:43:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:43:11] [INFO ] Invariant cache hit.
[2023-03-08 08:43:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:43:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:11] [INFO ] Invariant cache hit.
[2023-03-08 08:43:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/75 places, 69/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 59/75 places, 69/100 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR p1 p0), p0, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 0}, { cond=(NOT p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1)), p1:(OR (LT s1 1) (LT s42 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 5 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-09 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 65 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 65 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 63 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 63 transition count 75
Applied a total of 29 rules in 16 ms. Remains 63 /75 variables (removed 12) and now considering 75/100 (removed 25) transitions.
// Phase 1: matrix 75 rows 63 cols
[2023-03-08 08:43:11] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:43:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:43:11] [INFO ] Invariant cache hit.
[2023-03-08 08:43:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:11] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-08 08:43:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:11] [INFO ] Invariant cache hit.
[2023-03-08 08:43:11] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/75 places, 75/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 63/75 places, 75/100 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s62 1)) (OR (LT s1 1) (LT s61 1)) (OR (LT s1 1) (LT s59 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22917 reset in 129 ms.
Product exploration explored 100000 steps with 22856 reset in 126 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 414 steps, including 98 resets, run visited all 1 properties in 3 ms. (steps per millisecond=138 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 75/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 08:43:12] [INFO ] Invariant cache hit.
[2023-03-08 08:43:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 08:43:12] [INFO ] Invariant cache hit.
[2023-03-08 08:43:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 08:43:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:12] [INFO ] Invariant cache hit.
[2023-03-08 08:43:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 63/63 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 710 steps, including 153 resets, run visited all 1 properties in 3 ms. (steps per millisecond=236 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22838 reset in 121 ms.
Product exploration explored 100000 steps with 22994 reset in 132 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 08:43:13] [INFO ] Invariant cache hit.
[2023-03-08 08:43:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:43:13] [INFO ] Invariant cache hit.
[2023-03-08 08:43:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:13] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 08:43:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:13] [INFO ] Invariant cache hit.
[2023-03-08 08:43:13] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 63/63 places, 75/75 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-10 finished in 2112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((F(G(p2))||p1))||p0))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 60 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 60 transition count 70
Applied a total of 37 rules in 3 ms. Remains 60 /75 variables (removed 15) and now considering 70/100 (removed 30) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 08:43:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:43:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 08:43:13] [INFO ] Invariant cache hit.
[2023-03-08 08:43:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:13] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 08:43:13] [INFO ] Invariant cache hit.
[2023-03-08 08:43:14] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/75 places, 70/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 60/75 places, 70/100 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s22 1)), p1:(OR (LT s1 1) (LT s42 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22919 reset in 181 ms.
Product exploration explored 100000 steps with 22955 reset in 170 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.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 601 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 507 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 477 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 08:43:15] [INFO ] Invariant cache hit.
[2023-03-08 08:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:43:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:43:15] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 16 factoid took 841 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[false, false, false]
Stuttering acceptance computed with spot in 126 ms :[false, false, false]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:43:16] [INFO ] Invariant cache hit.
[2023-03-08 08:43:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:43:16] [INFO ] Invariant cache hit.
[2023-03-08 08:43:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-08 08:43:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:17] [INFO ] Invariant cache hit.
[2023-03-08 08:43:17] [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 205 ms. Remains : 60/60 places, 70/70 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 993 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 08:43:17] [INFO ] Invariant cache hit.
[2023-03-08 08:43:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:17] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:43:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:17] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:43:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:17] [INFO ] After 15ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:43:17] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 08:43:17] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 178 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 58 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 64
Applied a total of 4 rules in 4 ms. Remains 58 /60 variables (removed 2) and now considering 64/70 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 58/60 places, 64/70 transitions.
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1005 steps, run visited all 1 properties in 6 ms. (steps per millisecond=167 )
Probabilistic random walk after 1005 steps, saw 507 distinct states, run finished after 6 ms. (steps per millisecond=167 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[false, false, false]
Stuttering acceptance computed with spot in 113 ms :[false, false, false]
Stuttering acceptance computed with spot in 124 ms :[false, false, false]
Product exploration explored 100000 steps with 22784 reset in 108 ms.
Product exploration explored 100000 steps with 22907 reset in 91 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:43:18] [INFO ] Invariant cache hit.
[2023-03-08 08:43:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 08:43:18] [INFO ] Invariant cache hit.
[2023-03-08 08:43:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:18] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 08:43:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:18] [INFO ] Invariant cache hit.
[2023-03-08 08:43:18] [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 269 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-12 finished in 4956 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(G(((F((X(p0) U G(p1)))||X(p0)) U p2)))))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 86
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 66 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 65 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 64 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 64 transition count 80
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 64 transition count 78
Applied a total of 24 rules in 5 ms. Remains 64 /75 variables (removed 11) and now considering 78/100 (removed 22) transitions.
// Phase 1: matrix 78 rows 64 cols
[2023-03-08 08:43:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:43:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:43:18] [INFO ] Invariant cache hit.
[2023-03-08 08:43:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:43:18] [INFO ] Invariant cache hit.
[2023-03-08 08:43:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 78/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 64/75 places, 78/100 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s32 1)), p0:(AND (GEQ s15 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-13 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 70
Applied a total of 33 rules in 7 ms. Remains 61 /75 variables (removed 14) and now considering 70/100 (removed 30) transitions.
// Phase 1: matrix 70 rows 61 cols
[2023-03-08 08:43:19] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:43:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 08:43:19] [INFO ] Invariant cache hit.
[2023-03-08 08:43:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:43:19] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-08 08:43:19] [INFO ] Invariant cache hit.
[2023-03-08 08:43:19] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 70/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 61/75 places, 70/100 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-14 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(!p1))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m04-LTLFireability-05
Stuttering acceptance computed with spot in 170 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 64 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 64 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 76
Applied a total of 25 rules in 6 ms. Remains 64 /75 variables (removed 11) and now considering 76/100 (removed 24) transitions.
// Phase 1: matrix 76 rows 64 cols
[2023-03-08 08:43:19] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:43:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 08:43:19] [INFO ] Invariant cache hit.
[2023-03-08 08:43:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:43:19] [INFO ] Invariant cache hit.
[2023-03-08 08:43:20] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/75 places, 76/100 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 201 ms. Remains : 64/75 places, 76/100 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s22 1) (GEQ s43 1)), p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22899 reset in 100 ms.
Product exploration explored 100000 steps with 22931 reset in 106 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.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 323 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 1049 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 995 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:43:20] [INFO ] Invariant cache hit.
[2023-03-08 08:43:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:43:21] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 08:43:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:21] [INFO ] After 7ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:21] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:43:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:21] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:21] [INFO ] After 14ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:21] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 08:43:21] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 76/76 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 75
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/64 places, 75/76 transitions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1066 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2020 steps, run visited all 2 properties in 11 ms. (steps per millisecond=183 )
Probabilistic random walk after 2020 steps, saw 944 distinct states, run finished after 11 ms. (steps per millisecond=183 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 467 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 08:43:22] [INFO ] Invariant cache hit.
[2023-03-08 08:43:22] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:43:22] [INFO ] Invariant cache hit.
[2023-03-08 08:43:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-08 08:43:22] [INFO ] Invariant cache hit.
[2023-03-08 08:43:22] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 64/64 places, 76/76 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.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:43:23] [INFO ] Invariant cache hit.
[2023-03-08 08:43:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 08:43:23] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 08:43:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:23] [INFO ] After 6ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:23] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:43:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:43:23] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:23] [INFO ] After 14ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:43:23] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 08:43:23] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 76/76 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 75
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/64 places, 75/76 transitions.
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2020 steps, run visited all 2 properties in 12 ms. (steps per millisecond=168 )
Probabilistic random walk after 2020 steps, saw 944 distinct states, run finished after 12 ms. (steps per millisecond=168 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 483 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22876 reset in 114 ms.
Product exploration explored 100000 steps with 22911 reset in 114 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[p1, p1, (NOT p0), (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, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 08:43:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:43:25] [INFO ] Invariant cache hit.
[2023-03-08 08:43:25] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 64/64 places, 76/76 transitions.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 08:43:25] [INFO ] Invariant cache hit.
[2023-03-08 08:43:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 08:43:25] [INFO ] Invariant cache hit.
[2023-03-08 08:43:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:43:25] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:43:25] [INFO ] Invariant cache hit.
[2023-03-08 08:43:25] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 64/64 places, 76/76 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-05 finished in 5703 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((F(G(p2))||p1))||p0))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m04-LTLFireability-12
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 60 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 60 transition count 70
Applied a total of 37 rules in 6 ms. Remains 60 /75 variables (removed 15) and now considering 70/100 (removed 30) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 08:43:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:43:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:43:25] [INFO ] Invariant cache hit.
[2023-03-08 08:43:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:25] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:43:25] [INFO ] Invariant cache hit.
[2023-03-08 08:43:25] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/75 places, 70/100 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 195 ms. Remains : 60/75 places, 70/100 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s22 1)), p1:(OR (LT s1 1) (LT s42 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22892 reset in 83 ms.
Product exploration explored 100000 steps with 23004 reset in 95 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 p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 646 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 536 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 512 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 08:43:27] [INFO ] Invariant cache hit.
[2023-03-08 08:43:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:43:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:27] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2023-03-08 08:43:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:43:27] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-08 08:43:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:27] [INFO ] After 13ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2023-03-08 08:43:27] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 08:43:27] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 178 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 69
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 69/70 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 59/60 places, 69/70 transitions.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1051 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1005 steps, run visited all 2 properties in 7 ms. (steps per millisecond=143 )
Probabilistic random walk after 1005 steps, saw 507 distinct states, run finished after 7 ms. (steps per millisecond=143 ) properties seen :2
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 16 factoid took 776 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[false, false, false]
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:43:28] [INFO ] Invariant cache hit.
[2023-03-08 08:43:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:43:28] [INFO ] Invariant cache hit.
[2023-03-08 08:43:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 08:43:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:28] [INFO ] Invariant cache hit.
[2023-03-08 08:43:28] [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 194 ms. Remains : 60/60 places, 70/70 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.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 1015 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:43:29] [INFO ] Invariant cache hit.
[2023-03-08 08:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:29] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:29] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:43:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:29] [INFO ] After 7ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:43:29] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 08:43:29] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 178 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 58 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 64
Applied a total of 4 rules in 3 ms. Remains 58 /60 variables (removed 2) and now considering 64/70 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 58/60 places, 64/70 transitions.
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished Best-First random walk after 8700 steps, including 871 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1740 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[false, false, false]
Stuttering acceptance computed with spot in 120 ms :[false, false, false]
Stuttering acceptance computed with spot in 137 ms :[false, false, false]
Product exploration explored 100000 steps with 22919 reset in 86 ms.
Product exploration explored 100000 steps with 22962 reset in 95 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:43:30] [INFO ] Invariant cache hit.
[2023-03-08 08:43:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:43:30] [INFO ] Invariant cache hit.
[2023-03-08 08:43:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:43:30] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 08:43:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:30] [INFO ] Invariant cache hit.
[2023-03-08 08:43:30] [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 181 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-12 finished in 5061 ms.
[2023-03-08 08:43:30] [INFO ] Flatten gal took : 8 ms
[2023-03-08 08:43:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 08:43:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 100 transitions and 393 arcs took 2 ms.
Total runtime 34117 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2159/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2159/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2159/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2159/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d0m04-LTLFireability-05
Could not compute solution for formula : DBSingleClientW-PT-d0m04-LTLFireability-07
Could not compute solution for formula : DBSingleClientW-PT-d0m04-LTLFireability-10
Could not compute solution for formula : DBSingleClientW-PT-d0m04-LTLFireability-12

BK_STOP 1678265011873

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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