Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678265084087

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:44:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:44:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:44:45] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 08:44:45] [INFO ] Transformed 553 places.
[2023-03-08 08:44:45] [INFO ] Transformed 150 transitions.
[2023-03-08 08:44:45] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 120
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 88 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 85 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 85 transition count 114
Applied a total of 55 rules in 21 ms. Remains 85 /109 variables (removed 24) and now considering 114/150 (removed 36) transitions.
// Phase 1: matrix 114 rows 85 cols
[2023-03-08 08:44:46] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-08 08:44:46] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-08 08:44:46] [INFO ] Invariant cache hit.
[2023-03-08 08:44:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 08:44:46] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 08:44:46] [INFO ] Invariant cache hit.
[2023-03-08 08:44:46] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/109 places, 114/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 85/109 places, 114/150 transitions.
Support contains 23 out of 85 places after structural reductions.
[2023-03-08 08:44:46] [INFO ] Flatten gal took : 42 ms
[2023-03-08 08:44:46] [INFO ] Flatten gal took : 13 ms
[2023-03-08 08:44:46] [INFO ] Input system was already deterministic with 114 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1065 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 1050 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
[2023-03-08 08:44:48] [INFO ] Invariant cache hit.
[2023-03-08 08:44:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:44:48] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 08:44:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:44:48] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 08:44:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 08:44:48] [INFO ] After 128ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-08 08:44:49] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-08 08:44:49] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 49 ms.
Support contains 13 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 114/114 transitions.
Graph (complete) has 252 edges and 85 vertex of which 84 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 84 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 79 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 79 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 77 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 77 transition count 98
Applied a total of 16 rules in 18 ms. Remains 77 /85 variables (removed 8) and now considering 98/114 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 77/85 places, 98/114 transitions.
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 973 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 993 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1081 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 512 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Finished probabilistic random walk after 8871 steps, run visited all 10 properties in 93 ms. (steps per millisecond=95 )
Probabilistic random walk after 8871 steps, saw 3892 distinct states, run finished after 93 ms. (steps per millisecond=95 ) properties seen :10
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 281 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X((G(p1)&&p0)))||p2) U p2)))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 66 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 63 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 63 transition count 77
Applied a total of 47 rules in 13 ms. Remains 63 /85 variables (removed 22) and now considering 77/114 (removed 37) transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 08:44:50] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:44:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 08:44:50] [INFO ] Invariant cache hit.
[2023-03-08 08:44:50] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:44:50] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-08 08:44:50] [INFO ] Invariant cache hit.
[2023-03-08 08:44:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 77/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 63/85 places, 77/114 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-01 finished in 711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)||p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 73 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 65 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 64 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 63 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 49 place count 63 transition count 72
Applied a total of 49 rules in 22 ms. Remains 63 /85 variables (removed 22) and now considering 72/114 (removed 42) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 08:44:51] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 08:44:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:44:51] [INFO ] Invariant cache hit.
[2023-03-08 08:44:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:44:51] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:44:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:51] [INFO ] Invariant cache hit.
[2023-03-08 08:44:51] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 72/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 63/85 places, 72/114 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s33 1)), p1:(OR (LT s1 1) (LT s61 1)), p2:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23892 reset in 334 ms.
Product exploration explored 100000 steps with 23934 reset in 162 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:44:52] [INFO ] Invariant cache hit.
[2023-03-08 08:44:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:44:52] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 08:44:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:44:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 08:44:52] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 08:44:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:44:52] [INFO ] After 12ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 08:44:52] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 08:44:52] [INFO ] After 101ms 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 1 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 72/72 transitions.
Graph (complete) has 185 edges and 63 vertex of which 62 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 62 transition count 71
Applied a total of 2 rules in 19 ms. Remains 62 /63 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 62/63 places, 71/72 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8368 steps, run visited all 1 properties in 12 ms. (steps per millisecond=697 )
Probabilistic random walk after 8368 steps, saw 3654 distinct states, run finished after 12 ms. (steps per millisecond=697 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 483 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:44:53] [INFO ] Invariant cache hit.
[2023-03-08 08:44:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:44:53] [INFO ] Invariant cache hit.
[2023-03-08 08:44:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:44:53] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 08:44:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:53] [INFO ] Invariant cache hit.
[2023-03-08 08:44:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 63/63 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:44:54] [INFO ] Invariant cache hit.
[2023-03-08 08:44:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-08 08:44:54] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:44:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:44:54] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:44:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:44:54] [INFO ] After 11ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:44:54] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 08:44:54] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 72/72 transitions.
Graph (complete) has 185 edges and 63 vertex of which 62 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 62 transition count 71
Applied a total of 2 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 62/63 places, 71/72 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8368 steps, run visited all 1 properties in 14 ms. (steps per millisecond=597 )
Probabilistic random walk after 8368 steps, saw 3654 distinct states, run finished after 14 ms. (steps per millisecond=597 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 23902 reset in 104 ms.
Product exploration explored 100000 steps with 23801 reset in 128 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:44:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 08:44:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 63/63 places, 72/72 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-02 finished in 4100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 73 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 66 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 64 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 61 transition count 73
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 61 transition count 71
Applied a total of 53 rules in 14 ms. Remains 61 /85 variables (removed 24) and now considering 71/114 (removed 43) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:44:55] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 08:44:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:44:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 08:44:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/85 places, 71/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 61/85 places, 71/114 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-03 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 69 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 67 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 64 transition count 78
Applied a total of 46 rules in 17 ms. Remains 64 /85 variables (removed 21) and now considering 78/114 (removed 36) transitions.
// Phase 1: matrix 78 rows 64 cols
[2023-03-08 08:44:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:44:55] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:44:55] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 08:44:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:55] [INFO ] Invariant cache hit.
[2023-03-08 08:44:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/85 places, 78/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 64/85 places, 78/114 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s60 1)), p1:(OR (LT s1 1) (LT s44 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 22846 reset in 138 ms.
Product exploration explored 100000 steps with 22813 reset in 143 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:44:56] [INFO ] Invariant cache hit.
[2023-03-08 08:44:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:44:56] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:44:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:44:56] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:44:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:44:56] [INFO ] After 10ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:44:56] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 08:44:56] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 08:44:57] [INFO ] Invariant cache hit.
[2023-03-08 08:44:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:44:57] [INFO ] Invariant cache hit.
[2023-03-08 08:44:57] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:44:57] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-08 08:44:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:57] [INFO ] Invariant cache hit.
[2023-03-08 08:44:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:44:58] [INFO ] Invariant cache hit.
[2023-03-08 08:44:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:44:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:44:58] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:44:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:44:58] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:44:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:44:58] [INFO ] After 11ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:44:58] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 08:44:58] [INFO ] After 84ms 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 REACHABILITY mode, iteration 0 : 64/64 places, 78/78 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 77
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 6 ms. Remains 62 /64 variables (removed 2) and now considering 72/78 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/64 places, 72/78 transitions.
Incomplete random walk after 10000 steps, including 2293 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 530 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7030 steps, run visited all 1 properties in 13 ms. (steps per millisecond=540 )
Probabilistic random walk after 7030 steps, saw 3129 distinct states, run finished after 13 ms. (steps per millisecond=540 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 293 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22860 reset in 99 ms.
Product exploration explored 100000 steps with 22980 reset in 204 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 08:44:59] [INFO ] Invariant cache hit.
[2023-03-08 08:44:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:44:59] [INFO ] Invariant cache hit.
[2023-03-08 08:44:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:44:59] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 08:44:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:59] [INFO ] Invariant cache hit.
[2023-03-08 08:44:59] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 64/64 places, 78/78 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-05 finished in 3760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 66 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 63 transition count 73
Applied a total of 49 rules in 15 ms. Remains 63 /85 variables (removed 22) and now considering 73/114 (removed 41) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 08:44:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:44:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:44:59] [INFO ] Invariant cache hit.
[2023-03-08 08:44:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:44:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 08:44:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:44:59] [INFO ] Invariant cache hit.
[2023-03-08 08:44:59] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 73/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 63/85 places, 73/114 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22837 reset in 87 ms.
Product exploration explored 100000 steps with 22912 reset in 92 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5690 steps, run visited all 1 properties in 11 ms. (steps per millisecond=517 )
Probabilistic random walk after 5690 steps, saw 2478 distinct states, run finished after 11 ms. (steps per millisecond=517 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-08 08:45:00] [INFO ] Invariant cache hit.
[2023-03-08 08:45:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:45:00] [INFO ] Invariant cache hit.
[2023-03-08 08:45:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:45:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 08:45:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:45:00] [INFO ] Invariant cache hit.
[2023-03-08 08:45:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 63/63 places, 73/73 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2334 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5690 steps, run visited all 1 properties in 10 ms. (steps per millisecond=569 )
Probabilistic random walk after 5690 steps, saw 2478 distinct states, run finished after 10 ms. (steps per millisecond=569 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22883 reset in 94 ms.
Product exploration explored 100000 steps with 23041 reset in 96 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-08 08:45:01] [INFO ] Invariant cache hit.
[2023-03-08 08:45:01] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:45:01] [INFO ] Invariant cache hit.
[2023-03-08 08:45:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:45:01] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 08:45:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:45:01] [INFO ] Invariant cache hit.
[2023-03-08 08:45:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 63/63 places, 73/73 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-06 finished in 1888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||(p2 U !p3)||X(p4)))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 69 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 68 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 67 transition count 81
Applied a total of 38 rules in 6 ms. Remains 67 /85 variables (removed 18) and now considering 81/114 (removed 33) transitions.
// Phase 1: matrix 81 rows 67 cols
[2023-03-08 08:45:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:45:01] [INFO ] Invariant cache hit.
[2023-03-08 08:45:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:01] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:45:01] [INFO ] Invariant cache hit.
[2023-03-08 08:45:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 81/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 67/85 places, 81/114 transitions.
Stuttering acceptance computed with spot in 399 ms :[true, (NOT p4), (AND p3 (NOT p4)), (OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p1) p3 (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p1) p3 (NOT p4))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), p3]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p4), acceptance={} source=1 dest: 0}], [{ cond=(AND p3 (NOT p2) (NOT p4)), acceptance={} source=2 dest: 0}, { cond=(AND p3 p2 (NOT p4)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p3 p2), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p4) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p4) p1), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2) (NOT p4)) (AND p3 (NOT p2) (NOT p4) (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND p0 p3 (NOT p2) (NOT p4) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3 p2 (NOT p4) p1), acceptance={} source=5 dest: 7}, { cond=(OR (AND (NOT p0) p3 p2 (NOT p4)) (AND p3 p2 (NOT p4) (NOT p1))), acceptance={} source=5 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=7 dest: 0}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 p3 p2 p1), acceptance={} source=7 dest: 7}, { cond=(OR (AND (NOT p0) p3 p2) (AND p3 p2 (NOT p1))), acceptance={} source=7 dest: 8}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p3 p2), acceptance={0} source=8 dest: 8}]], initial=3, aps=[p4:(AND (GEQ s1 1) (GEQ s59 1)), p3:(OR (LT s1 1) (LT s62 1)), p2:(AND (GEQ s3 1) (GEQ s25 1)), p0:(AND (GEQ s3 1) (GEQ s25 1)), p1:(AND (GEQ s24 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-07 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||X(p1)))||X(X(G(p2)))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 71 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 71 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 69 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 69 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 68 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 67 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 67 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 67 transition count 78
Applied a total of 41 rules in 4 ms. Remains 67 /85 variables (removed 18) and now considering 78/114 (removed 36) transitions.
// Phase 1: matrix 78 rows 67 cols
[2023-03-08 08:45:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:45:02] [INFO ] Invariant cache hit.
[2023-03-08 08:45:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 08:45:02] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-08 08:45:02] [INFO ] Invariant cache hit.
[2023-03-08 08:45:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 78/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 67/85 places, 78/114 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s65 1)), p2:(AND (GEQ s6 1) (GEQ s25 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 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-08 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((!p0 U X((p1&&X((p1 U (!p2||G(p1))))))))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 99
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 99
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 70 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 70 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 31 place count 70 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 68 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 67 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 66 transition count 82
Applied a total of 42 rules in 8 ms. Remains 66 /85 variables (removed 19) and now considering 82/114 (removed 32) transitions.
// Phase 1: matrix 82 rows 66 cols
[2023-03-08 08:45:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:02] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 08:45:02] [INFO ] Invariant cache hit.
[2023-03-08 08:45:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:45:02] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-08 08:45:02] [INFO ] Invariant cache hit.
[2023-03-08 08:45:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/85 places, 82/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 66/85 places, 82/114 transitions.
Stuttering acceptance computed with spot in 695 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 9}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={1} source=8 dest: 8}, { cond=p0, acceptance={0, 1} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=9 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1} source=10 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=10 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 12}, { cond=(AND p0 p1), acceptance={0, 1} source=10 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=11 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=11 dest: 9}, { cond=(AND p1 p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=12 dest: 9}, { cond=(AND p1 p2), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=13 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=13 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=13 dest: 10}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=13 dest: 12}, { cond=(AND p0 p1 p2), acceptance={0} source=13 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s20 1) (GEQ s24 1)), p1:(OR (LT s1 1) (LT s45 1)), p2:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25539 reset in 131 ms.
Product exploration explored 100000 steps with 25415 reset in 145 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 216 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 408 ms. Reduced automaton from 14 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 994 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 536 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 516 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 08:45:04] [INFO ] Invariant cache hit.
[2023-03-08 08:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:04] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-08 08:45:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:45:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:45:05] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-08 08:45:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:45:05] [INFO ] After 74ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-08 08:45:05] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 08:45:05] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 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 65 transition count 81
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/66 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1066 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 529 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Finished probabilistic random walk after 20336 steps, run visited all 6 properties in 96 ms. (steps per millisecond=211 )
Probabilistic random walk after 20336 steps, saw 9063 distinct states, run finished after 96 ms. (steps per millisecond=211 ) properties seen :6
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 11 factoid took 804 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 363 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 08:45:07] [INFO ] Invariant cache hit.
[2023-03-08 08:45:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:45:07] [INFO ] Invariant cache hit.
[2023-03-08 08:45:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:45:07] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 08:45:07] [INFO ] Invariant cache hit.
[2023-03-08 08:45:07] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 66/66 places, 82/82 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 216 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1049 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 08:45:08] [INFO ] Invariant cache hit.
[2023-03-08 08:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:08] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-08 08:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:45:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:08] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-08 08:45:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:45:08] [INFO ] After 33ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-08 08:45:08] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 08:45:08] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 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 65 transition count 81
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/66 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1002 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Finished probabilistic random walk after 20336 steps, run visited all 4 properties in 43 ms. (steps per millisecond=472 )
Probabilistic random walk after 20336 steps, saw 9063 distinct states, run finished after 43 ms. (steps per millisecond=472 ) properties seen :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 5 factoid took 432 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 25486 reset in 97 ms.
Product exploration explored 100000 steps with 25435 reset in 103 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 08:45:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:45:11] [INFO ] Invariant cache hit.
[2023-03-08 08:45:11] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 66/66 places, 82/82 transitions.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 08:45:11] [INFO ] Invariant cache hit.
[2023-03-08 08:45:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 08:45:11] [INFO ] Invariant cache hit.
[2023-03-08 08:45:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:45:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 08:45:11] [INFO ] Invariant cache hit.
[2023-03-08 08:45:11] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 66/66 places, 82/82 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-09 finished in 9067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 69 transition count 88
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 68 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 68 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 37 place count 68 transition count 83
Applied a total of 37 rules in 5 ms. Remains 68 /85 variables (removed 17) and now considering 83/114 (removed 31) transitions.
// Phase 1: matrix 83 rows 68 cols
[2023-03-08 08:45:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:45:11] [INFO ] Invariant cache hit.
[2023-03-08 08:45:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 08:45:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 08:45:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 08:45:11] [INFO ] Invariant cache hit.
[2023-03-08 08:45:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/85 places, 83/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 68/85 places, 83/114 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s24 1) (GEQ s43 1)), p0:(OR (LT s1 1) (LT s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22845 reset in 96 ms.
Product exploration explored 100000 steps with 22875 reset in 100 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 222 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18849 steps, run visited all 1 properties in 29 ms. (steps per millisecond=649 )
Probabilistic random walk after 18849 steps, saw 8426 distinct states, run finished after 29 ms. (steps per millisecond=649 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 68 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 : 68/68 places, 83/83 transitions.
Applied a total of 0 rules in 12 ms. Remains 68 /68 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-08 08:45:12] [INFO ] Invariant cache hit.
[2023-03-08 08:45:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:45:12] [INFO ] Invariant cache hit.
[2023-03-08 08:45:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 08:45:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-08 08:45:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:12] [INFO ] Invariant cache hit.
[2023-03-08 08:45:12] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 68/68 places, 83/83 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 222 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18849 steps, run visited all 1 properties in 22 ms. (steps per millisecond=856 )
Probabilistic random walk after 18849 steps, saw 8426 distinct states, run finished after 22 ms. (steps per millisecond=856 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22887 reset in 98 ms.
Product exploration explored 100000 steps with 22881 reset in 101 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 83/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 64 transition count 75
Applied a total of 10 rules in 6 ms. Remains 64 /68 variables (removed 4) and now considering 75/83 (removed 8) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 08:45:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:45:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 75/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 64/68 places, 75/83 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-10 finished in 2278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 73 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 66 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 63 transition count 75
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 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 59 transition count 69
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 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 58 transition count 64
Applied a total of 61 rules in 6 ms. Remains 58 /85 variables (removed 27) and now considering 64/114 (removed 50) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 08:45:13] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/85 places, 64/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 58/85 places, 64/114 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s31 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-11 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 65 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
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 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 60 transition count 68
Applied a total of 57 rules in 10 ms. Remains 60 /85 variables (removed 25) and now considering 68/114 (removed 46) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 08:45:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:45:14] [INFO ] Invariant cache hit.
[2023-03-08 08:45:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 08:45:14] [INFO ] Invariant cache hit.
[2023-03-08 08:45:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/85 places, 68/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 60/85 places, 68/114 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-13 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 (LT s1 1) (LT s57 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]]
Product exploration explored 100000 steps with 22904 reset in 85 ms.
Product exploration explored 100000 steps with 22880 reset in 95 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:15] [INFO ] Invariant cache hit.
[2023-03-08 08:45:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 08:45:15] [INFO ] Invariant cache hit.
[2023-03-08 08:45:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:15] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-08 08:45:15] [INFO ] Invariant cache hit.
[2023-03-08 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 60/60 places, 68/68 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2267 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 530 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22921 reset in 94 ms.
Product exploration explored 100000 steps with 22818 reset in 95 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 60/60 places, 68/68 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-13 finished in 2565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 91
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 67 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 62 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 59 transition count 67
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 59 transition count 65
Applied a total of 59 rules in 17 ms. Remains 59 /85 variables (removed 26) and now considering 65/114 (removed 49) transitions.
// Phase 1: matrix 65 rows 59 cols
[2023-03-08 08:45:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:45:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 08:45:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/85 places, 65/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 59/85 places, 65/114 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s22 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 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-14 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 65 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
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 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 60 transition count 68
Applied a total of 57 rules in 10 ms. Remains 60 /85 variables (removed 25) and now considering 68/114 (removed 46) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 08:45:16] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:45:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:45:16] [INFO ] Invariant cache hit.
[2023-03-08 08:45:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 08:45:17] [INFO ] Invariant cache hit.
[2023-03-08 08:45:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/85 places, 68/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 60/85 places, 68/114 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s31 1)), p1:(OR (LT s1 1) (LT s57 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 28531 reset in 88 ms.
Product exploration explored 100000 steps with 28589 reset in 89 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:45:17] [INFO ] Invariant cache hit.
[2023-03-08 08:45:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:17] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:45:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:45:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:17] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:45:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:17] [INFO ] After 10ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:45:17] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 08:45:18] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 67
Applied a total of 2 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/60 places, 67/68 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 537 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 5 ms. (steps per millisecond=215 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 60/60 places, 68/68 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:45:19] [INFO ] Invariant cache hit.
[2023-03-08 08:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:19] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:45:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:19] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:45:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:19] [INFO ] After 10ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:45:19] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 08:45:19] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 67
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/60 places, 67/68 transitions.
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 6 ms. (steps per millisecond=179 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 6 ms. (steps per millisecond=179 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28559 reset in 78 ms.
Product exploration explored 100000 steps with 28627 reset in 79 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:20] [INFO ] Invariant cache hit.
[2023-03-08 08:45:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 60/60 places, 68/68 transitions.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:20] [INFO ] Invariant cache hit.
[2023-03-08 08:45:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:45:20] [INFO ] Invariant cache hit.
[2023-03-08 08:45:20] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:20] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 08:45:20] [INFO ] Invariant cache hit.
[2023-03-08 08:45:20] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-15 finished in 3787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((!p0 U X((p1&&X((p1 U (!p2||G(p1))))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m05-LTLFireability-13
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 65 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
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 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 60 transition count 68
Applied a total of 57 rules in 14 ms. Remains 60 /85 variables (removed 25) and now considering 68/114 (removed 46) transitions.
[2023-03-08 08:45:21] [INFO ] Invariant cache hit.
[2023-03-08 08:45:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:45:21] [INFO ] Invariant cache hit.
[2023-03-08 08:45:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-08 08:45:21] [INFO ] Invariant cache hit.
[2023-03-08 08:45:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/85 places, 68/114 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 179 ms. Remains : 60/85 places, 68/114 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-13 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 (LT s1 1) (LT s57 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23010 reset in 77 ms.
Product exploration explored 100000 steps with 22937 reset in 84 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2301 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 503 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:22] [INFO ] Invariant cache hit.
[2023-03-08 08:45:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:45:22] [INFO ] Invariant cache hit.
[2023-03-08 08:45:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:22] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 08:45:22] [INFO ] Invariant cache hit.
[2023-03-08 08:45:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 60/60 places, 68/68 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22886 reset in 96 ms.
Product exploration explored 100000 steps with 22970 reset in 93 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:23] [INFO ] Invariant cache hit.
[2023-03-08 08:45:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 60/60 places, 68/68 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 08:45:23] [INFO ] Invariant cache hit.
[2023-03-08 08:45:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 08:45:23] [INFO ] Invariant cache hit.
[2023-03-08 08:45:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:23] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:45:23] [INFO ] Invariant cache hit.
[2023-03-08 08:45:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-13 finished in 2534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(p1)))))'
[2023-03-08 08:45:23] [INFO ] Flatten gal took : 8 ms
[2023-03-08 08:45:23] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 08:45:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 114 transitions and 447 arcs took 2 ms.
Total runtime 38164 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2520/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-02
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-05
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-06
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-09
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-10
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-13
Could not compute solution for formula : DBSingleClientW-PT-d0m05-LTLFireability-15

BK_STOP 1678265125510

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name DBSingleClientW-PT-d0m05-LTLFireability-10
ltl formula formula --ltl=/tmp/2520/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 85 places, 114 transitions and 447 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DBSingleClientW-PT-d0m05-LTLFireability-13
ltl formula formula --ltl=/tmp/2520/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 85 places, 114 transitions and 447 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d0m05-LTLFireability-15
ltl formula formula --ltl=/tmp/2520/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 85 places, 114 transitions and 447 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_6_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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