Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716324548892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:49:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:49:11] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-21 20:49:11] [INFO ] Transformed 553 places.
[2024-05-21 20:49:11] [INFO ] Transformed 150 transitions.
[2024-05-21 20:49:11] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 34 place count 86 transition count 114
Iterating global reduction 1 with 16 rules applied. Total rules applied 50 place count 86 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 86 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 81 transition count 108
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 81 transition count 108
Applied a total of 61 rules in 22 ms. Remains 81 /109 variables (removed 28) and now considering 108/150 (removed 42) transitions.
// Phase 1: matrix 108 rows 81 cols
[2024-05-21 20:49:11] [INFO ] Computed 2 invariants in 11 ms
[2024-05-21 20:49:11] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 20:49:11] [INFO ] Invariant cache hit.
[2024-05-21 20:49:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:49:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 20:49:11] [INFO ] Invariant cache hit.
[2024-05-21 20:49:11] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/109 places, 108/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 81/109 places, 108/150 transitions.
Support contains 31 out of 81 places after structural reductions.
[2024-05-21 20:49:11] [INFO ] Flatten gal took : 28 ms
[2024-05-21 20:49:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:49:11] [INFO ] Input system was already deterministic with 108 transitions.
Support contains 29 out of 81 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 28) seen :12
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-21 20:49:12] [INFO ] Invariant cache hit.
[2024-05-21 20:49:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:49:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:49:12] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2024-05-21 20:49:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:49:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 20:49:13] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-21 20:49:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:49:13] [INFO ] After 135ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :1 sat :13
[2024-05-21 20:49:13] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 120 ms.
[2024-05-21 20:49:13] [INFO ] After 660ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 108/108 transitions.
Graph (complete) has 240 edges and 81 vertex of which 80 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 80 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 77 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 77 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 77 transition count 102
Applied a total of 9 rules in 15 ms. Remains 77 /81 variables (removed 4) and now considering 102/108 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 77/81 places, 102/108 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1018 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 966 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1039 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1051 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 102 rows 77 cols
[2024-05-21 20:49:14] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 20:49:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:49:14] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-21 20:49:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:49:14] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-21 20:49:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:49:15] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-21 20:49:15] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-21 20:49:15] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 14 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 74 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 74 transition count 95
Applied a total of 6 rules in 9 ms. Remains 74 /77 variables (removed 3) and now considering 95/102 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 74/77 places, 95/102 transitions.
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 999 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1050 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 984 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 994 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Finished probabilistic random walk after 16180 steps, run visited all 11 properties in 70 ms. (steps per millisecond=231 )
Probabilistic random walk after 16180 steps, saw 7422 distinct states, run finished after 70 ms. (steps per millisecond=231 ) properties seen :11
Parikh walk visited 0 properties in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 267 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 64 transition count 75
Applied a total of 39 rules in 11 ms. Remains 64 /81 variables (removed 17) and now considering 75/108 (removed 33) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 20:49:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:49:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:49:16] [INFO ] Invariant cache hit.
[2024-05-21 20:49:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:49:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-21 20:49:17] [INFO ] Invariant cache hit.
[2024-05-21 20:49:17] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/81 places, 75/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 64/81 places, 75/108 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22856 reset in 240 ms.
Entered a terminal (fully accepting) state of product in 99546 steps with 22755 reset in 145 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-01 finished in 884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((G(p1) U p2)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 87
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 67 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 63 transition count 73
Applied a total of 41 rules in 20 ms. Remains 63 /81 variables (removed 18) and now considering 73/108 (removed 35) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 20:49:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:49:17] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:49:17] [INFO ] Invariant cache hit.
[2024-05-21 20:49:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:49:17] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:49:17] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/81 places, 73/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 63/81 places, 73/108 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s43 1)), p2:(AND (GEQ s19 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][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-03 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 67 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 65 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 60 transition count 71
Applied a total of 48 rules in 14 ms. Remains 60 /81 variables (removed 21) and now considering 71/108 (removed 37) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 20:49:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:49:18] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 20:49:18] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:49:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-21 20:49:18] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/81 places, 71/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 60/81 places, 71/108 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s15 1) (LT s22 1)) (GEQ s1 1) (GEQ s43 1)), p0:(AND (GEQ s15 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-04 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 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 44 place count 61 transition count 71
Applied a total of 44 rules in 20 ms. Remains 61 /81 variables (removed 20) and now considering 71/108 (removed 37) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 20:49:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:49:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:49:18] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:49:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 20:49:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:49:18] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/81 places, 71/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 61/81 places, 71/108 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-05 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)&&F(!p1))||X(G(!p0))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 86
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 65 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 63 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 62 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 61 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 61 transition count 70
Applied a total of 45 rules in 10 ms. Remains 61 /81 variables (removed 20) and now considering 70/108 (removed 38) transitions.
// Phase 1: matrix 70 rows 61 cols
[2024-05-21 20:49:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:49:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:49:18] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:49:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 20:49:18] [INFO ] Invariant cache hit.
[2024-05-21 20:49:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 70/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 61/81 places, 70/108 transitions.
Stuttering acceptance computed with spot in 178 ms :[p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s32 1)), p0:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 197 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-06 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 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 44 place count 61 transition count 71
Applied a total of 44 rules in 18 ms. Remains 61 /81 variables (removed 20) and now considering 71/108 (removed 37) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 20:49:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:49:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:49:19] [INFO ] Invariant cache hit.
[2024-05-21 20:49:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:49:19] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 20:49:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:49:19] [INFO ] Invariant cache hit.
[2024-05-21 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/81 places, 71/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 61/81 places, 71/108 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-07 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 (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-07 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(F((X(!(!p0 U p2))||p1))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 72 transition count 87
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 68 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 67 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 66 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 64 transition count 74
Applied a total of 39 rules in 12 ms. Remains 64 /81 variables (removed 17) and now considering 74/108 (removed 34) transitions.
// Phase 1: matrix 74 rows 64 cols
[2024-05-21 20:49:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:49:19] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:49:19] [INFO ] Invariant cache hit.
[2024-05-21 20:49:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:49:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 20:49:19] [INFO ] Invariant cache hit.
[2024-05-21 20:49:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/81 places, 74/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 64/81 places, 74/108 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s42 1)), p1:(OR (LT s20 1) (LT s42 1)), p2:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, 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 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-08 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((F(p1) U X((p2 U G(p3))))))&&p0)))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 89
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 67 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 65 transition count 79
Applied a total of 34 rules in 3 ms. Remains 65 /81 variables (removed 16) and now considering 79/108 (removed 29) transitions.
// Phase 1: matrix 79 rows 65 cols
[2024-05-21 20:49:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:49:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:49:20] [INFO ] Invariant cache hit.
[2024-05-21 20:49:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:49:20] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 20:49:20] [INFO ] Invariant cache hit.
[2024-05-21 20:49:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/81 places, 79/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 65/81 places, 79/108 transitions.
Stuttering acceptance computed with spot in 634 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 7}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 9}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=4 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 9}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=10 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=10 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=10 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=12 dest: 10}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=12 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p3:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s22 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-10 finished in 819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(F(p1)) U (G(p3)&&p2)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 66 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 63 transition count 75
Applied a total of 41 rules in 8 ms. Remains 63 /81 variables (removed 18) and now considering 75/108 (removed 33) transitions.
// Phase 1: matrix 75 rows 63 cols
[2024-05-21 20:49:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:49:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:49:21] [INFO ] Invariant cache hit.
[2024-05-21 20:49:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:49:21] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:49:21] [INFO ] Invariant cache hit.
[2024-05-21 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/81 places, 75/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 63/81 places, 75/108 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 5}, { cond=(AND p0 p2 p3), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=5 dest: 3}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p3), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={0} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s58 1)), p2:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s51 1)), p3:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-12 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 65 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 60 transition count 70
Applied a total of 47 rules in 16 ms. Remains 60 /81 variables (removed 21) and now considering 70/108 (removed 38) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 20:49:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:49:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:49:21] [INFO ] Invariant cache hit.
[2024-05-21 20:49:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:49:21] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 20:49:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:49:21] [INFO ] Invariant cache hit.
[2024-05-21 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/81 places, 70/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 60/81 places, 70/108 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-13 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:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-13 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((((X((X(p1)||p2)) U p2)&&p0)||p3))||G(p2)))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 108/108 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 86
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 65 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 63 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 60 transition count 68
Applied a total of 47 rules in 7 ms. Remains 60 /81 variables (removed 21) and now considering 68/108 (removed 40) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 20:49:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:49:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 20:49:21] [INFO ] Invariant cache hit.
[2024-05-21 20:49:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:49:22] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-21 20:49:22] [INFO ] Invariant cache hit.
[2024-05-21 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/81 places, 68/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 60/81 places, 68/108 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s55 1)), p3:(AND (GEQ s12 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s51 1)), p1:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-14 finished in 437 ms.
All properties solved by simple procedures.
Total runtime 11295 ms.

BK_STOP 1716324563886

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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