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.r101-tall-167814475100228.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 itstools
Input is DBSingleClientW-PT-d0m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475100228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678238999891

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 01:30:01] [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]
[2023-03-08 01:30:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:30:01] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 01:30:01] [INFO ] Transformed 553 places.
[2023-03-08 01:30:01] [INFO ] Transformed 150 transitions.
[2023-03-08 01:30:01] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 118
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 118
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 83 transition count 113
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 83 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 82 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 82 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 82 transition count 109
Applied a total of 60 rules in 26 ms. Remains 82 /109 variables (removed 27) and now considering 109/150 (removed 41) transitions.
// Phase 1: matrix 109 rows 82 cols
[2023-03-08 01:30:01] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 01:30:01] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 01:30:01] [INFO ] Invariant cache hit.
[2023-03-08 01:30:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 01:30:02] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 01:30:02] [INFO ] Invariant cache hit.
[2023-03-08 01:30:02] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 109/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 82/109 places, 109/150 transitions.
Support contains 27 out of 82 places after structural reductions.
[2023-03-08 01:30:02] [INFO ] Flatten gal took : 32 ms
[2023-03-08 01:30:02] [INFO ] Flatten gal took : 12 ms
[2023-03-08 01:30:02] [INFO ] Input system was already deterministic with 109 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 25) seen :13
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 980 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1005 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 478 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 531 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 974 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 973 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 01:30:03] [INFO ] Invariant cache hit.
[2023-03-08 01:30:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:30:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:30:03] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-08 01:30:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:30:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:30:03] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-08 01:30:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 01:30:04] [INFO ] After 88ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-08 01:30:04] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-08 01:30:04] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 44 ms.
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 90
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 71 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 71 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 70 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 70 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 69 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 68 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 67 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 67 transition count 82
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 67 transition count 80
Applied a total of 32 rules in 28 ms. Remains 67 /82 variables (removed 15) and now considering 80/109 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 67/82 places, 80/109 transitions.
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1006 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Finished probabilistic random walk after 7779 steps, run visited all 6 properties in 55 ms. (steps per millisecond=141 )
Probabilistic random walk after 7779 steps, saw 3405 distinct states, run finished after 55 ms. (steps per millisecond=141 ) properties seen :6
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 274 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 72 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 65 transition count 77
Applied a total of 37 rules in 10 ms. Remains 65 /82 variables (removed 17) and now considering 77/109 (removed 32) transitions.
// Phase 1: matrix 77 rows 65 cols
[2023-03-08 01:30:05] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:30:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:30:05] [INFO ] Invariant cache hit.
[2023-03-08 01:30:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:30:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-08 01:30:05] [INFO ] Invariant cache hit.
[2023-03-08 01:30:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/82 places, 77/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 65/82 places, 77/109 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s20 1) (GEQ s24 1)), p1:(OR (AND (GEQ s20 1) (GEQ s24 1)) (LT s1 1) (LT s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26928 reset in 329 ms.
Product exploration explored 100000 steps with 26859 reset in 135 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 978 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6112 steps, run visited all 2 properties in 24 ms. (steps per millisecond=254 )
Probabilistic random walk after 6112 steps, saw 2759 distinct states, run finished after 24 ms. (steps per millisecond=254 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-03-08 01:30:07] [INFO ] Invariant cache hit.
[2023-03-08 01:30:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:30:07] [INFO ] Invariant cache hit.
[2023-03-08 01:30:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:30:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 01:30:07] [INFO ] Invariant cache hit.
[2023-03-08 01:30:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 65/65 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 994 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 501 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6112 steps, run visited all 2 properties in 35 ms. (steps per millisecond=174 )
Probabilistic random walk after 6112 steps, saw 2759 distinct states, run finished after 35 ms. (steps per millisecond=174 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 26891 reset in 89 ms.
Product exploration explored 100000 steps with 26964 reset in 126 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-03-08 01:30:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:09] [INFO ] Invariant cache hit.
[2023-03-08 01:30: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 67 ms. Remains : 65/65 places, 77/77 transitions.
Built C files in :
/tmp/ltsmin3119198208728429064
[2023-03-08 01:30:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3119198208728429064
Running compilation step : cd /tmp/ltsmin3119198208728429064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 238 ms.
Running link step : cd /tmp/ltsmin3119198208728429064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3119198208728429064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3882714673323488412.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-00 finished in 4826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1) U p2))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 72 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 70 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 69 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 84
Applied a total of 29 rules in 8 ms. Remains 69 /82 variables (removed 13) and now considering 84/109 (removed 25) transitions.
// Phase 1: matrix 84 rows 69 cols
[2023-03-08 01:30:09] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:30:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:30:09] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/82 places, 84/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 69/82 places, 84/109 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s44 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(OR (AND (GEQ s1 1) (GEQ s61 1)) (AND (GEQ s1 1) (GEQ s64 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-01 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p0 U p1))||F(p0)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 58 transition count 64
Applied a total of 54 rules in 28 ms. Remains 58 /82 variables (removed 24) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:30:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 01:30:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/82 places, 64/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 58/82 places, 64/109 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-03 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((G((p2||X(p2)))||p1))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 86
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 71 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 66 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 66 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 61 transition count 70
Applied a total of 45 rules in 14 ms. Remains 61 /82 variables (removed 21) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 61 cols
[2023-03-08 01:30:10] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 61/82 places, 70/109 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s19 1) (LT s23 1)), p2:(AND (GEQ s1 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-04 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((F(p0)&&p1)))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 60 transition count 68
Applied a total of 48 rules in 9 ms. Remains 60 /82 variables (removed 22) and now considering 68/109 (removed 41) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 01:30:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:30:10] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 01:30:10] [INFO ] Invariant cache hit.
[2023-03-08 01:30:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 68/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 60/82 places, 68/109 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-06 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 58 transition count 64
Applied a total of 54 rules in 20 ms. Remains 58 /82 variables (removed 24) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:30:11] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 01:30:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:30:11] [INFO ] Invariant cache hit.
[2023-03-08 01:30:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:30:11] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 01:30:11] [INFO ] Invariant cache hit.
[2023-03-08 01:30:11] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 58/82 places, 64/109 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-07 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1&&X(G((G(p3)||p2))))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 73 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 70 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 69 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 68 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 66 transition count 82
Applied a total of 35 rules in 16 ms. Remains 66 /82 variables (removed 16) and now considering 82/109 (removed 27) transitions.
// Phase 1: matrix 82 rows 66 cols
[2023-03-08 01:30:11] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:30:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:30:11] [INFO ] Invariant cache hit.
[2023-03-08 01:30:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:30:11] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 01:30:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:11] [INFO ] Invariant cache hit.
[2023-03-08 01:30:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/82 places, 82/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 66/82 places, 82/109 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p3), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=3 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p3), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=5 dest: 4}, { cond=(AND p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s63 1)), p0:(OR (LT s1 1) (LT s44 1)), p2:(OR (LT s1 1) (LT s63 1)), p3:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22954 reset in 141 ms.
Product exploration explored 100000 steps with 22924 reset in 148 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 218 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR p2 p3)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (X (OR p2 p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1090 ms. Reduced automaton from 6 states, 23 edges and 4 AP (stutter insensitive) to 6 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 518 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 540 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 514 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 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 514 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 484 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 719942 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{0=1, 1=1, 2=1, 4=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Probabilistic random walk after 719942 steps, saw 280937 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :10
Running SMT prover for 2 properties.
[2023-03-08 01:30:17] [INFO ] Invariant cache hit.
[2023-03-08 01:30:17] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR p2 p3)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (X (OR p2 p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3)), (F (NOT (OR p2 p3))), (F (AND p2 p3)), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (AND p2 (NOT p3)))), (F (AND p1 p3))]
Knowledge based reduction with 23 factoid took 1417 ms. Reduced automaton from 6 states, 23 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 01:30:19] [INFO ] Invariant cache hit.
[2023-03-08 01:30:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:30:19] [INFO ] Invariant cache hit.
[2023-03-08 01:30:19] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:30:19] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 01:30:19] [INFO ] Invariant cache hit.
[2023-03-08 01:30:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 66/66 places, 82/82 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 218 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X (OR p2 p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR (NOT p1) p2)), (X p1), (X (AND p1 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p2) p3))), (X (OR (AND (NOT p1) p0) (AND p2 p0))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (OR (NOT p1) p2))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (OR (AND (NOT p1) p0) (AND p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1179 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 529 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 526 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-08 01:30:21] [INFO ] Invariant cache hit.
[2023-03-08 01:30:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:30:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:30:21] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-08 01:30:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:30:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:30:22] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-08 01:30:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:30:22] [INFO ] After 93ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-08 01:30:22] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-08 01:30:22] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 77
Applied a total of 2 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 77/82 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/66 places, 77/82 transitions.
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 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 490 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 536 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 512 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Finished probabilistic random walk after 19461 steps, run visited all 11 properties in 88 ms. (steps per millisecond=221 )
Probabilistic random walk after 19461 steps, saw 8760 distinct states, run finished after 88 ms. (steps per millisecond=221 ) properties seen :11
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X (OR p2 p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR (NOT p1) p2)), (X p1), (X (AND p1 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p2) p3))), (X (OR (AND (NOT p1) p0) (AND p2 p0))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (OR (NOT p1) p2))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (OR (AND (NOT p1) p0) (AND p2 p0)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3))), (F (AND (NOT p2) p3)), (F (NOT (AND p1 (NOT p3)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (F (AND p2 p3)), (F (NOT (OR p2 p3))), (F (NOT (AND p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (AND p1 p3)), (F (AND (NOT p1) p3))]
Knowledge based reduction with 22 factoid took 1378 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 739 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 22863 reset in 97 ms.
Product exploration explored 100000 steps with 22979 reset in 201 ms.
Built C files in :
/tmp/ltsmin9806340064792156454
[2023-03-08 01:30:26] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2023-03-08 01:30:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:26] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2023-03-08 01:30:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:26] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2023-03-08 01:30:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:26] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9806340064792156454
Running compilation step : cd /tmp/ltsmin9806340064792156454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin9806340064792156454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9806340064792156454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4442043448106787713.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-09 finished in 15225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((F((!p0&&F(p1)))||G(!p0))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 67 transition count 82
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 60 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 60 transition count 69
Applied a total of 49 rules in 6 ms. Remains 60 /82 variables (removed 22) and now considering 69/109 (removed 40) transitions.
// Phase 1: matrix 69 rows 60 cols
[2023-03-08 01:30:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:30:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:30:26] [INFO ] Invariant cache hit.
[2023-03-08 01:30:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:30:26] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 01:30:26] [INFO ] Invariant cache hit.
[2023-03-08 01:30:26] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 69/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 60/82 places, 69/109 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s16 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22902 reset in 88 ms.
Product exploration explored 100000 steps with 23027 reset in 92 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 128 steps, including 26 resets, run visited all 2 properties in 4 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:30:27] [INFO ] Invariant cache hit.
[2023-03-08 01:30:28] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:30:28] [INFO ] Invariant cache hit.
[2023-03-08 01:30:28] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:30:28] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 01:30:28] [INFO ] Invariant cache hit.
[2023-03-08 01:30:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 105 steps, including 26 resets, run visited all 2 properties in 5 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22983 reset in 84 ms.
Product exploration explored 100000 steps with 22901 reset in 93 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:30:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:29] [INFO ] Invariant cache hit.
[2023-03-08 01:30:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 60/60 places, 69/69 transitions.
Built C files in :
/tmp/ltsmin10907185591418225727
[2023-03-08 01:30:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10907185591418225727
Running compilation step : cd /tmp/ltsmin10907185591418225727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin10907185591418225727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10907185591418225727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15717597492612979766.hoa' '--buchi-type=spotba'
LTSmin run took 251 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-10 finished in 3330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 67 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 60 transition count 70
Applied a total of 50 rules in 4 ms. Remains 60 /82 variables (removed 22) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:30:30] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:30:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:30:30] [INFO ] Invariant cache hit.
[2023-03-08 01:30:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:30:30] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 01:30:30] [INFO ] Invariant cache hit.
[2023-03-08 01:30:31] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 60/82 places, 70/109 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s5 1) (LT s22 1)), p0:(OR (LT s1 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-12 finished in 1556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 85
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Applied a total of 46 rules in 10 ms. Remains 61 /82 variables (removed 21) and now considering 71/109 (removed 38) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:30:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:30:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:30:31] [INFO ] Invariant cache hit.
[2023-03-08 01:30:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:30:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 01:30:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:31] [INFO ] Invariant cache hit.
[2023-03-08 01:30:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 71/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 61/82 places, 71/109 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s60 1)), p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23010 reset in 152 ms.
Product exploration explored 100000 steps with 22866 reset in 152 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Finished Best-First random walk after 983 steps, including 49 resets, run visited all 2 properties in 4 ms. (steps per millisecond=245 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-08 01:30:32] [INFO ] Invariant cache hit.
[2023-03-08 01:30:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:30:32] [INFO ] Invariant cache hit.
[2023-03-08 01:30:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:30:32] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 01:30:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:32] [INFO ] Invariant cache hit.
[2023-03-08 01:30:32] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 61/61 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Finished random walk after 8757 steps, including 1989 resets, run visited all 2 properties in 100 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Product exploration explored 100000 steps with 22905 reset in 83 ms.
Product exploration explored 100000 steps with 22801 reset in 87 ms.
Built C files in :
/tmp/ltsmin6671004296276639481
[2023-03-08 01:30:33] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2023-03-08 01:30:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:33] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2023-03-08 01:30:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:33] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2023-03-08 01:30:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6671004296276639481
Running compilation step : cd /tmp/ltsmin6671004296276639481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 168 ms.
Running link step : cd /tmp/ltsmin6671004296276639481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6671004296276639481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8550833919202579479.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-08 01:30:49] [INFO ] Invariant cache hit.
[2023-03-08 01:30:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:30:49] [INFO ] Invariant cache hit.
[2023-03-08 01:30:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:30:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-08 01:30:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:30:49] [INFO ] Invariant cache hit.
[2023-03-08 01:30:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 61/61 places, 71/71 transitions.
Built C files in :
/tmp/ltsmin14085405028316032993
[2023-03-08 01:30:49] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2023-03-08 01:30:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:49] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2023-03-08 01:30:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:49] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2023-03-08 01:30:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:30:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14085405028316032993
Running compilation step : cd /tmp/ltsmin14085405028316032993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 938 ms.
Running link step : cd /tmp/ltsmin14085405028316032993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14085405028316032993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11469474360156304998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 01:31:04] [INFO ] Flatten gal took : 5 ms
[2023-03-08 01:31:04] [INFO ] Flatten gal took : 5 ms
[2023-03-08 01:31:04] [INFO ] Time to serialize gal into /tmp/LTL6848936762811989431.gal : 1 ms
[2023-03-08 01:31:04] [INFO ] Time to serialize properties into /tmp/LTL15141493648250220727.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6848936762811989431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6335048579862594330.hoa' '-atoms' '/tmp/LTL15141493648250220727.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15141493648250220727.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6335048579862594330.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t60, t78, t80, t81, t82, t84, t85, t86, t87, t88, t89, t90, t91, t9...295
Detected timeout of ITS tools.
[2023-03-08 01:31:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 01:31:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 01:31:19] [INFO ] Time to serialize gal into /tmp/LTL7127978422360671043.gal : 2 ms
[2023-03-08 01:31:19] [INFO ] Time to serialize properties into /tmp/LTL15229843576353182369.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7127978422360671043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15229843576353182369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((s1<1)||(l510<1))")))||(("((s1>=1)&&(l510>=1))")&&(F("((s1<1)||(l510<1))"))))))
Formula 0 simplified : G(FG!"((s1<1)||(l510<1))" & (!"((s1>=1)&&(l510>=1))" | G!"((s1<1)||(l510<1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t60, t78, t80, t81, t82, t84, t85, t86, t87, t88, t89, t90, t91, t9...295
Detected timeout of ITS tools.
[2023-03-08 01:31:34] [INFO ] Flatten gal took : 4 ms
[2023-03-08 01:31:34] [INFO ] Applying decomposition
[2023-03-08 01:31:34] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5997582655252522500.txt' '-o' '/tmp/graph5997582655252522500.bin' '-w' '/tmp/graph5997582655252522500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5997582655252522500.bin' '-l' '-1' '-v' '-w' '/tmp/graph5997582655252522500.weights' '-q' '0' '-e' '0.001'
[2023-03-08 01:31:34] [INFO ] Decomposing Gal with order
[2023-03-08 01:31:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 01:31:34] [INFO ] Removed a total of 53 redundant transitions.
[2023-03-08 01:31:34] [INFO ] Flatten gal took : 27 ms
[2023-03-08 01:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 4 ms.
[2023-03-08 01:31:34] [INFO ] Time to serialize gal into /tmp/LTL5630028078755696144.gal : 2 ms
[2023-03-08 01:31:34] [INFO ] Time to serialize properties into /tmp/LTL2479565621513863450.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5630028078755696144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2479565621513863450.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((u0.s1<1)||(u0.l510<1))")))||(("((u0.s1>=1)&&(u0.l510>=1))")&&(F("((u0.s1<1)||(u0.l510<1))"))))))
Formula 0 simplified : G(FG!"((u0.s1<1)||(u0.l510<1))" & (!"((u0.s1>=1)&&(u0.l510>=1))" | G!"((u0.s1<1)||(u0.l510<1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t28, t60, t78, t80, t82, t84, t85, t86, t87, t88, t89, t90, t91, t92, t95, t98, t...288
Computing Next relation with stutter on 3.79408e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4601964546212910168
[2023-03-08 01:31:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4601964546212910168
Running compilation step : cd /tmp/ltsmin4601964546212910168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin4601964546212910168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4601964546212910168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-13 finished in 93253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
[2023-03-08 01:32:04] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2403599342052564474
[2023-03-08 01:32:04] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2023-03-08 01:32:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:32:04] [INFO ] Applying decomposition
[2023-03-08 01:32:04] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2023-03-08 01:32:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:32:04] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2023-03-08 01:32:04] [INFO ] Flatten gal took : 5 ms
[2023-03-08 01:32:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:32:04] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2403599342052564474
Running compilation step : cd /tmp/ltsmin2403599342052564474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13973126557287202356.txt' '-o' '/tmp/graph13973126557287202356.bin' '-w' '/tmp/graph13973126557287202356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13973126557287202356.bin' '-l' '-1' '-v' '-w' '/tmp/graph13973126557287202356.weights' '-q' '0' '-e' '0.001'
[2023-03-08 01:32:04] [INFO ] Decomposing Gal with order
[2023-03-08 01:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 01:32:04] [INFO ] Removed a total of 107 redundant transitions.
[2023-03-08 01:32:04] [INFO ] Flatten gal took : 33 ms
[2023-03-08 01:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 8 ms.
[2023-03-08 01:32:04] [INFO ] Time to serialize gal into /tmp/LTLFireability15343880399465232791.gal : 6 ms
[2023-03-08 01:32:04] [INFO ] Time to serialize properties into /tmp/LTLFireability15816145095127091029.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15343880399465232791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15816145095127091029.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F((G(F(!("((i0.u0.s1>=1)&&(i5.u18.l510>=1))"))))||(("((i0.u0.s1>=1)&&(i5.u18.l510>=1))")&&(F(!("((i0.u0.s1>=1)&&(i5.u18.l510>=1))")...161
Formula 0 simplified : G(FG"((i0.u0.s1>=1)&&(i5.u18.l510>=1))" & (!"((i0.u0.s1>=1)&&(i5.u18.l510>=1))" | G"((i0.u0.s1>=1)&&(i5.u18.l510>=1))"))
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin2403599342052564474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2403599342052564474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t9, t25, t26, t27, t28, t29, t30, t33, t51, t61, t62, t63, t64, t65, t68, t69, t7...466
Computing Next relation with stutter on 6.45837e+08 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 111, guards 109
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: LTL layer: formula: <>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true))))
pins2lts-mc-linux64( 5/ 8), 0.016: "<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.066: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.080: There are 113 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.080: State length is 83, there are 112 groups
pins2lts-mc-linux64( 0/ 8), 0.080: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.080: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.080: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.080: Visible groups: 0 / 112, labels: 2 / 113
pins2lts-mc-linux64( 0/ 8), 0.080: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.080: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.090: [Blue] ~32 levels ~960 states ~2184 transitions
pins2lts-mc-linux64( 4/ 8), 0.106: [Blue] ~84 levels ~1920 states ~4456 transitions
pins2lts-mc-linux64( 0/ 8), 0.127: [Blue] ~43 levels ~3840 states ~7944 transitions
pins2lts-mc-linux64( 6/ 8), 0.154: [Blue] ~91 levels ~7680 states ~14392 transitions
pins2lts-mc-linux64( 6/ 8), 0.230: [Blue] ~91 levels ~15360 states ~28808 transitions
pins2lts-mc-linux64( 3/ 8), 0.369: [Blue] ~46 levels ~30720 states ~63168 transitions
pins2lts-mc-linux64( 3/ 8), 0.627: [Blue] ~46 levels ~61440 states ~129928 transitions
pins2lts-mc-linux64( 3/ 8), 1.060: [Blue] ~46 levels ~122880 states ~260680 transitions
pins2lts-mc-linux64( 3/ 8), 1.914: [Blue] ~46 levels ~245760 states ~523584 transitions
pins2lts-mc-linux64( 3/ 8), 3.360: [Blue] ~96 levels ~491520 states ~1061856 transitions
pins2lts-mc-linux64( 3/ 8), 5.817: [Blue] ~110 levels ~983040 states ~2176072 transitions
pins2lts-mc-linux64( 3/ 8), 10.578: [Blue] ~136 levels ~1966080 states ~4537008 transitions
pins2lts-mc-linux64( 3/ 8), 20.583: [Blue] ~1844 levels ~3932160 states ~9423056 transitions
pins2lts-mc-linux64( 6/ 8), 42.382: [Blue] ~18252 levels ~7864320 states ~18353800 transitions
pins2lts-mc-linux64( 2/ 8), 78.676: [Blue] ~62800 levels ~15728640 states ~31888568 transitions
pins2lts-mc-linux64( 2/ 8), 160.050: [Blue] ~62800 levels ~31457280 states ~63878696 transitions
pins2lts-mc-linux64( 2/ 8), 348.773: [Blue] ~123982 levels ~62914560 states ~140425832 transitions
pins2lts-mc-linux64( 2/ 8), 709.097: [Blue] ~377009 levels ~125829120 states ~293965464 transitions
pins2lts-mc-linux64( 4/ 8), 827.907: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 827.939:
pins2lts-mc-linux64( 0/ 8), 827.939: Explored 134604984 states 340585437 transitions, fanout: 2.530
pins2lts-mc-linux64( 0/ 8), 827.939: Total exploration time 827.840 sec (827.800 sec minimum, 827.827 sec on average)
pins2lts-mc-linux64( 0/ 8), 827.939: States per second: 162598, Transitions per second: 411415
pins2lts-mc-linux64( 0/ 8), 827.939:
pins2lts-mc-linux64( 0/ 8), 827.939: State space has 134214655 states, 56495596 are accepting
pins2lts-mc-linux64( 0/ 8), 827.939: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 827.939: blue states: 134604984 (100.29%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 827.939: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 827.939: all-red states: 60995616 (45.45%), bogus 1612 (0.00%)
pins2lts-mc-linux64( 0/ 8), 827.940:
pins2lts-mc-linux64( 0/ 8), 827.940: Total memory used for local state coloring: 30.8MB
pins2lts-mc-linux64( 0/ 8), 827.940:
pins2lts-mc-linux64( 0/ 8), 827.940: Queue width: 8B, total height: 2017919, memory: 15.40MB
pins2lts-mc-linux64( 0/ 8), 827.940: Tree memory: 1240.2MB, 9.7 B/state, compr.: 2.9%
pins2lts-mc-linux64( 0/ 8), 827.940: Tree fill ratio (roots/leafs): 99.0%/84.0%
pins2lts-mc-linux64( 0/ 8), 827.940: Stored 109 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 827.940: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 827.940: Est. total memory use: 1255.6MB (~1039.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2403599342052564474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2403599342052564474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 01:52:46] [INFO ] Flatten gal took : 6 ms
[2023-03-08 01:52:46] [INFO ] Time to serialize gal into /tmp/LTLFireability17247433713832715260.gal : 2 ms
[2023-03-08 01:52:46] [INFO ] Time to serialize properties into /tmp/LTLFireability4488684594684513466.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17247433713832715260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4488684594684513466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F((G(F(!("((s1>=1)&&(l510>=1))"))))||(("((s1>=1)&&(l510>=1))")&&(F(!("((s1>=1)&&(l510>=1))")))))))
Formula 0 simplified : G(FG"((s1>=1)&&(l510>=1))" & (!"((s1>=1)&&(l510>=1))" | G"((s1>=1)&&(l510>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t50, t51, t52,...459
Computing Next relation with stutter on 6.45837e+08 deadlock states
33 unique states visited
0 strongly connected components in search stack
64 transitions explored
32 items max in DFS search stack
17662 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,176.652,2244552,1,0,458,1.04924e+07,21,303,1401,1.39917e+07,660
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1555128 ms.

BK_STOP 1678240564270

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d0m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d0m10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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