Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K Jun 6 12:11 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-d0m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654774601419

Running Version 202205111006
[2022-06-09 11:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 11:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:36:42] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-06-09 11:36:42] [INFO ] Transformed 553 places.
[2022-06-09 11:36:42] [INFO ] Transformed 150 transitions.
[2022-06-09 11:36:42] [INFO ] Parsed PT model containing 553 places and 150 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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-d0m08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 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 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 28 place count 92 transition count 124
Iterating global reduction 1 with 10 rules applied. Total rules applied 38 place count 92 transition count 124
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 88 transition count 120
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 88 transition count 120
Applied a total of 46 rules in 37 ms. Remains 88 /109 variables (removed 21) and now considering 120/150 (removed 30) transitions.
// Phase 1: matrix 120 rows 88 cols
[2022-06-09 11:36:43] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 11:36:43] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 120 rows 88 cols
[2022-06-09 11:36:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:36:43] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 11:36:43] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 88 cols
[2022-06-09 11:36:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:36:43] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/109 places, 120/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/109 places, 120/150 transitions.
Support contains 33 out of 88 places after structural reductions.
[2022-06-09 11:36:43] [INFO ] Flatten gal took : 32 ms
[2022-06-09 11:36:43] [INFO ] Flatten gal took : 13 ms
[2022-06-09 11:36:43] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 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 500 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 120 rows 88 cols
[2022-06-09 11:36:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:36:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:36:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:36:45] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2022-06-09 11:36:45] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 11:36:45] [INFO ] After 14ms SMT Verify possible using 51 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-09 11:36:45] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-09 11:36:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:36:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:36:45] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-06-09 11:36:46] [INFO ] After 133ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-06-09 11:36:46] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-06-09 11:36:46] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 83 ms.
Support contains 15 out of 88 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 120/120 transitions.
Graph (complete) has 262 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 81 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 81 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 81 transition count 106
Applied a total of 17 rules in 18 ms. Remains 81 /88 variables (removed 7) and now considering 106/120 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/88 places, 106/120 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1036 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 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 493 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 522 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 106 rows 81 cols
[2022-06-09 11:36:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 11:36:47] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2022-06-09 11:36:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 11:36:47] [INFO ] After 14ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-09 11:36:47] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-09 11:36:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:36:47] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-09 11:36:47] [INFO ] After 93ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-09 11:36:48] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-06-09 11:36:48] [INFO ] After 458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 65 ms.
Support contains 13 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 106/106 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 79 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 79 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 79 transition count 101
Applied a total of 5 rules in 17 ms. Remains 79 /81 variables (removed 2) and now considering 101/106 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/81 places, 101/106 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Finished probabilistic random walk after 14922 steps, run visited all 9 properties in 105 ms. (steps per millisecond=142 )
Probabilistic random walk after 14922 steps, saw 6844 distinct states, run finished after 105 ms. (steps per millisecond=142 ) properties seen :9
Computed a total of 6 stabilizing places and 6 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(G(p1))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 73 transition count 91
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 66 transition count 83
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 65 transition count 78
Applied a total of 50 rules in 8 ms. Remains 65 /88 variables (removed 23) and now considering 78/120 (removed 42) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:49] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:36:49] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:49] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:36:49] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/88 places, 78/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/88 places, 78/120 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (LT s13 1) (LT s36 1)), p0:(OR (LT s1 1) (LT s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22791 reset in 278 ms.
Product exploration explored 100000 steps with 22838 reset in 166 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 662 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 994 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:36:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 11:36:51] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-09 11:36:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:36:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:36:51] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-09 11:36:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:36:51] [INFO ] After 12ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-09 11:36:51] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-09 11:36:51] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 78/78 transitions.
Graph (complete) has 194 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 77
Applied a total of 2 rules in 8 ms. Remains 64 /65 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 77/78 transitions.
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18809 steps, run visited all 2 properties in 115 ms. (steps per millisecond=163 )
Probabilistic random walk after 18809 steps, saw 8326 distinct states, run finished after 116 ms. (steps per millisecond=162 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 494 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:36:53] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:36:53] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:53] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:36:53] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 291 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:36:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:36:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 11:36:53] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 11:36:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:36:53] [INFO ] After 5ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:36:53] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:36:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:36:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:36:53] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:36:53] [INFO ] After 5ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:36:53] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 11:36:53] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 78/78 transitions.
Graph (complete) has 194 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 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 10 place count 61 transition count 70
Applied a total of 10 rules in 11 ms. Remains 61 /65 variables (removed 4) and now considering 70/78 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/65 places, 70/78 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1002 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8517 steps, run visited all 1 properties in 45 ms. (steps per millisecond=189 )
Probabilistic random walk after 8517 steps, saw 3739 distinct states, run finished after 46 ms. (steps per millisecond=185 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 22913 reset in 114 ms.
Product exploration explored 100000 steps with 22860 reset in 168 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2022-06-09 11:36:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:36:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 78/78 transitions.
Product exploration explored 100000 steps with 22850 reset in 155 ms.
Product exploration explored 100000 steps with 22894 reset in 141 ms.
Built C files in :
/tmp/ltsmin18127859271624693333
[2022-06-09 11:36:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18127859271624693333
Running compilation step : cd /tmp/ltsmin18127859271624693333;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin18127859271624693333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18127859271624693333;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6163444659150694360.hoa' '--buchi-type=spotba'
LTSmin run took 1190 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-01 finished in 8021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((!p0 U (!p1||G(!p0))))&&!p0))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 92
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 74 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 68 transition count 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 66 transition count 79
Applied a total of 48 rules in 8 ms. Remains 66 /88 variables (removed 22) and now considering 79/120 (removed 41) transitions.
// Phase 1: matrix 79 rows 66 cols
[2022-06-09 11:36:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:36:57] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 79 rows 66 cols
[2022-06-09 11:36:57] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 11:36:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:36:57] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 66 cols
[2022-06-09 11:36:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/88 places, 79/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/88 places, 79/120 transitions.
Stuttering acceptance computed with spot in 196 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-02 finished in 1132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((p0 U ((G(p2)||p3)&&p1)))) U !p4))))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 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 27 place count 75 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 69 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 67 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 65 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 64 transition count 74
Applied a total of 53 rules in 5 ms. Remains 64 /88 variables (removed 24) and now considering 74/120 (removed 46) transitions.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:36:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:58] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:36:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:36:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:36:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:36:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/88 places, 74/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/88 places, 74/120 transitions.
Stuttering acceptance computed with spot in 426 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p4, acceptance={} source=1 dest: 2}], [{ cond=p4, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=6 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p3) p2 (NOT p0))), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s27 1)), p3:(AND (GEQ s6 1) (GEQ s24 1)), p2:(AND (GEQ s1 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22959 reset in 86 ms.
Product exploration explored 100000 steps with 22853 reset in 97 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p4)), true, (X (X (NOT p4)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 7 states, 16 edges and 5 AP to 7 states, 16 edges and 5 AP.
Stuttering acceptance computed with spot in 380 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 636 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:00] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 11:37:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:37:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:37:00] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-06-09 11:37:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:37:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 11:37:00] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-06-09 11:37:00] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:37:00] [INFO ] After 51ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-06-09 11:37:00] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 11:37:00] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 74/74 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 72
Applied a total of 4 rules in 8 ms. Remains 62 /64 variables (removed 2) and now considering 72/74 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/64 places, 72/74 transitions.
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5927 steps, run visited all 1 properties in 13 ms. (steps per millisecond=455 )
Probabilistic random walk after 5927 steps, saw 2661 distinct states, run finished after 13 ms. (steps per millisecond=455 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p4) (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p4)), true, (X (X (NOT p4))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1 p2 (NOT p3))), (F (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3)))), (F p2), (F p4), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3)))), (F (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (F (OR (AND p0 (NOT p1) p2) (AND p0 p2 (NOT p3))))]
Knowledge based reduction with 5 factoid took 1176 ms. Reduced automaton from 7 states, 16 edges and 5 AP to 7 states, 15 edges and 5 AP.
Stuttering acceptance computed with spot in 391 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 308 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:02] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:37:02] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:02] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:37:02] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:02] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p4)), true, (X (X (NOT p4)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 7 states, 15 edges and 5 AP to 7 states, 15 edges and 5 AP.
Stuttering acceptance computed with spot in 365 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:37:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:37:03] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:37:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:37:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:37:03] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:37:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:37:03] [INFO ] After 9ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:37:03] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-09 11:37:03] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 74/74 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 72
Applied a total of 4 rules in 11 ms. Remains 62 /64 variables (removed 2) and now considering 72/74 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/64 places, 72/74 transitions.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5927 steps, run visited all 1 properties in 14 ms. (steps per millisecond=423 )
Probabilistic random walk after 5927 steps, saw 2661 distinct states, run finished after 14 ms. (steps per millisecond=423 ) properties seen :1
Knowledge obtained : [(AND (NOT p4) (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p4)), true, (X (X (NOT p4)))]
False Knowledge obtained : [(F p2), (F (AND p0 p1 p2 (NOT p3))), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (F (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3)))), (F p4), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3)))), (F (OR (AND p0 (NOT p1) p2) (AND p0 p2 (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 437 ms. Reduced automaton from 7 states, 15 edges and 5 AP to 7 states, 15 edges and 5 AP.
Stuttering acceptance computed with spot in 330 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 316 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 317 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 23111 reset in 95 ms.
Product exploration explored 100000 steps with 22910 reset in 101 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 312 ms :[p4, p4, (OR (NOT p1) p4 (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 74/74 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2022-06-09 11:37:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 74/74 transitions.
Product exploration explored 100000 steps with 22983 reset in 88 ms.
Product exploration explored 100000 steps with 22868 reset in 102 ms.
Built C files in :
/tmp/ltsmin11431414252736381920
[2022-06-09 11:37:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11431414252736381920
Running compilation step : cd /tmp/ltsmin11431414252736381920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 179 ms.
Running link step : cd /tmp/ltsmin11431414252736381920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11431414252736381920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11786752151839516263.hoa' '--buchi-type=spotba'
LTSmin run took 54 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-03 finished in 7897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(X(G(F(!(p0 U p1)))))&&F(p2))))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 99
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 75 transition count 98
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 69 transition count 92
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 69 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 66 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 64 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 64 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 62 transition count 78
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 62 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 61 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 61 transition count 73
Applied a total of 62 rules in 17 ms. Remains 61 /88 variables (removed 27) and now considering 73/120 (removed 47) transitions.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:06] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:37:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-06-09 11:37:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/88 places, 73/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/88 places, 73/120 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s46 1)), p2:(OR (LT s1 1) (LT s57 1)), p0:(AND (GEQ s1 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22901 reset in 104 ms.
Product exploration explored 100000 steps with 22919 reset in 107 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:37:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:37:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:37:07] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:37:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:37:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:37:07] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:37:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:37:07] [INFO ] After 9ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:37:07] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-09 11:37:07] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 73/73 transitions.
Graph (complete) has 178 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 59 transition count 67
Applied a total of 4 rules in 9 ms. Remains 59 /61 variables (removed 2) and now considering 67/73 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 67/73 transitions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2964 steps, run visited all 1 properties in 6 ms. (steps per millisecond=494 )
Probabilistic random walk after 2964 steps, saw 1412 distinct states, run finished after 6 ms. (steps per millisecond=494 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 73/73 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:08] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:08] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:37:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-06-09 11:37:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 73/73 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2341 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 526 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:37:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:37:09] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:37:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:37:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:37:09] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:37:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:37:09] [INFO ] After 19ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:37:09] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-09 11:37:09] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 73/73 transitions.
Graph (complete) has 178 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 59 transition count 67
Applied a total of 4 rules in 4 ms. Remains 59 /61 variables (removed 2) and now considering 67/73 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 67/73 transitions.
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 516 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2964 steps, run visited all 1 properties in 7 ms. (steps per millisecond=423 )
Probabilistic random walk after 2964 steps, saw 1412 distinct states, run finished after 7 ms. (steps per millisecond=423 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Product exploration explored 100000 steps with 22942 reset in 96 ms.
Product exploration explored 100000 steps with 22923 reset in 103 ms.
Built C files in :
/tmp/ltsmin7711102051637339934
[2022-06-09 11:37:10] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2022-06-09 11:37:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:10] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2022-06-09 11:37:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:10] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2022-06-09 11:37:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:10] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7711102051637339934
Running compilation step : cd /tmp/ltsmin7711102051637339934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin7711102051637339934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7711102051637339934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7049032532461254887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 73/73 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:25] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:25] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:37:25] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-06-09 11:37:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:37:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:25] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 73/73 transitions.
Built C files in :
/tmp/ltsmin8157561378506998754
[2022-06-09 11:37:25] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2022-06-09 11:37:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:25] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2022-06-09 11:37:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:25] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2022-06-09 11:37:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8157561378506998754
Running compilation step : cd /tmp/ltsmin8157561378506998754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin8157561378506998754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8157561378506998754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8206932215282344140.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 11:37:40] [INFO ] Flatten gal took : 7 ms
[2022-06-09 11:37:40] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:37:40] [INFO ] Time to serialize gal into /tmp/LTL16786181628693715879.gal : 1 ms
[2022-06-09 11:37:40] [INFO ] Time to serialize properties into /tmp/LTL14195712313374015730.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16786181628693715879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14195712313374015730.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1678618...268
Read 1 LTL properties
Checking formula 0 : !((F(X(G((F(X(G(F(!(("((s1>=1)&&(l149>=1))")U("((p11>=1)&&(l154>=1))")))))))&&(F("((s1<1)||(l488<1))")))))))
Formula 0 simplified : !FXG(FXGF!("((s1>=1)&&(l149>=1))" U "((p11>=1)&&(l154>=1))") & F"((s1<1)||(l488<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t66, t67, t68, t70, t8...355
Computing Next relation with stutter on 2.81182e+06 deadlock states
18 unique states visited
0 strongly connected components in search stack
32 transitions explored
11 items max in DFS search stack
929 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,9.3254,213072,1,0,215,760248,193,108,2248,989933,398
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-04 finished in 44431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(G(!(F(p0)||p1)))))) U X(X(p2))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 97
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 75 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 70 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 70 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 68 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 68 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 67 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 66 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 66 transition count 79
Applied a total of 50 rules in 5 ms. Remains 66 /88 variables (removed 22) and now considering 79/120 (removed 41) transitions.
// Phase 1: matrix 79 rows 66 cols
[2022-06-09 11:37:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:51] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 79 rows 66 cols
[2022-06-09 11:37:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:37:51] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 66 cols
[2022-06-09 11:37:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/88 places, 79/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/88 places, 79/120 transitions.
Stuttering acceptance computed with spot in 669 ms :[(OR p1 p0), (NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p2) p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s34 1)), p1:(AND (GEQ s1 1) (GEQ s64 1)), p2:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-05 finished in 942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 99
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 99
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 69 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 69 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 66 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 64 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 64 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 62 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 62 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 62 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 61 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 61 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 61 transition count 74
Applied a total of 60 rules in 11 ms. Remains 61 /88 variables (removed 27) and now considering 74/120 (removed 46) transitions.
// Phase 1: matrix 74 rows 61 cols
[2022-06-09 11:37:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:52] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 74 rows 61 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:37:52] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 61 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:37:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/88 places, 74/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/88 places, 74/120 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s42 1)) (AND (GEQ s17 1) (GEQ s22 1)) (AND (GEQ s2 1) (GEQ s58 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-06 finished in 495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X((p0 U p1))||X(F(p0)))))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 97
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 75 transition count 96
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 68 transition count 89
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 68 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 68 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 65 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 65 transition count 82
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 65 transition count 81
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 63 transition count 78
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 63 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 61 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 61 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 60 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 63 place count 60 transition count 71
Applied a total of 63 rules in 11 ms. Remains 60 /88 variables (removed 28) and now considering 71/120 (removed 49) transitions.
// Phase 1: matrix 71 rows 60 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:52] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 71 rows 60 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:37:52] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 71 rows 60 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:52] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/88 places, 71/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/88 places, 71/120 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-07 finished in 345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 94
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 68 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 60 transition count 70
Applied a total of 62 rules in 16 ms. Remains 60 /88 variables (removed 28) and now considering 70/120 (removed 50) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:37:52] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:52] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:37:52] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-09 11:37:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:37:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:53] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/88 places, 70/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/88 places, 70/120 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-09 finished in 276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 73 transition count 91
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 66 transition count 83
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 58 transition count 64
Applied a total of 68 rules in 7 ms. Remains 58 /88 variables (removed 30) and now considering 64/120 (removed 56) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:37:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:53] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:37:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:37:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:37:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/88 places, 64/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/88 places, 64/120 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s53 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 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 488 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-10 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&p1))||(p0 U !p0)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 95
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 75 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 69 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 66 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 61 transition count 70
Applied a total of 61 rules in 7 ms. Remains 61 /88 variables (removed 27) and now considering 70/120 (removed 50) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:37:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:54] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:37:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 11:37:54] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:37:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/88 places, 70/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/88 places, 70/120 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s57 1)), p1:(OR (LT s16 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-11 finished in 641 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X((X(p1) U p2)) U G(p0)))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 94
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 75 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 69 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 67 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 65 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 64 transition count 74
Applied a total of 54 rules in 7 ms. Remains 64 /88 variables (removed 24) and now considering 74/120 (removed 46) transitions.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:54] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 11:37:54] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:37:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/88 places, 74/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/88 places, 74/120 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p2), (NOT p0), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s60 1)) (AND (GEQ s1 1) (GEQ s30 1))), p2:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-13 finished in 530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(p0))||p1))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 74 transition count 95
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 67 transition count 88
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 67 transition count 88
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 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 59 transition count 69
Applied a total of 66 rules in 11 ms. Remains 59 /88 variables (removed 29) and now considering 69/120 (removed 51) transitions.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:37:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:55] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:37:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:37:55] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:37:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:37:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/88 places, 69/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/88 places, 69/120 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((G(F(p1))&&p2))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 92
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 74 transition count 91
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 67 transition count 84
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 62 transition count 72
Applied a total of 57 rules in 7 ms. Remains 62 /88 variables (removed 26) and now considering 72/120 (removed 48) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:37:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:55] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:37:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:37:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:37:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:37:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 72/120 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/88 places, 72/120 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s56 1)), p2:(OR (LT s15 1) (LT s40 1)), p1:(OR (LT s1 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22986 reset in 98 ms.
Product exploration explored 100000 steps with 23070 reset in 109 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 349 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Finished random walk after 24 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:37:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:56] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:37:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:37:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:37:57] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-06-09 11:37:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:37:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:37:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 34 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22996 reset in 99 ms.
Product exploration explored 100000 steps with 22927 reset in 104 ms.
Built C files in :
/tmp/ltsmin18238138231204778209
[2022-06-09 11:37:57] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2022-06-09 11:37:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:57] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2022-06-09 11:37:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:57] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2022-06-09 11:37:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:37:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18238138231204778209
Running compilation step : cd /tmp/ltsmin18238138231204778209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin18238138231204778209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18238138231204778209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11911665808046395470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 58 transition count 64
Applied a total of 11 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 64/72 (removed 8) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:38:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:38:12] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:38:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:38:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:38:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-06-09 11:38:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:38:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:38:13] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/62 places, 64/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/62 places, 64/72 transitions.
Built C files in :
/tmp/ltsmin8632606817950204703
[2022-06-09 11:38:13] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-06-09 11:38:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:38:13] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-06-09 11:38:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:38:13] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-06-09 11:38:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:38:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8632606817950204703
Running compilation step : cd /tmp/ltsmin8632606817950204703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin8632606817950204703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin8632606817950204703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11565155425123644845.hoa' '--buchi-type=spotba'
LTSmin run took 13368 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-15 finished in 31131 ms.
All properties solved by simple procedures.
Total runtime 104063 ms.

BK_STOP 1654774706740

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d0m08"
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-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m08, 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 r312-tall-165472281900164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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