About the Execution of LoLa+red for SemanticWebServices-PT-S128P18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 326.508 | 18495.00 | 35764.00 | 345.20 | FFFTFFFFFFFTFFTF | normal |
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.r359-smll-167891808900411.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 lolaxred
Input is SemanticWebServices-PT-S128P18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808900411
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 261K Mar 5 18:23 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 SemanticWebServices-PT-S128P18-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679099159038
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 00:26:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 00:26:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 00:26:02] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-18 00:26:02] [INFO ] Transformed 184 places.
[2023-03-18 00:26:02] [INFO ] Transformed 466 transitions.
[2023-03-18 00:26:02] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 269 transitions
Reduce redundant transitions removed 269 transitions.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 195/195 transitions.
Ensure Unique test removed 46 places
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 111 transition count 123
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 149 place count 105 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 155 place count 105 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 157 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 103 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 103 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 102 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 102 transition count 112
Applied a total of 163 rules in 57 ms. Remains 102 /182 variables (removed 80) and now considering 112/195 (removed 83) transitions.
[2023-03-18 00:26:03] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
// Phase 1: matrix 103 rows 102 cols
[2023-03-18 00:26:03] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-18 00:26:03] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-18 00:26:03] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
[2023-03-18 00:26:03] [INFO ] Invariant cache hit.
[2023-03-18 00:26:03] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-18 00:26:03] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-18 00:26:03] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
[2023-03-18 00:26:03] [INFO ] Invariant cache hit.
[2023-03-18 00:26:04] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/182 places, 112/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 102/182 places, 112/195 transitions.
Support contains 46 out of 102 places after structural reductions.
[2023-03-18 00:26:04] [INFO ] Flatten gal took : 53 ms
[2023-03-18 00:26:04] [INFO ] Flatten gal took : 22 ms
[2023-03-18 00:26:04] [INFO ] Input system was already deterministic with 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=10 ) properties (out of 33) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-18 00:26:05] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
[2023-03-18 00:26:05] [INFO ] Invariant cache hit.
[2023-03-18 00:26:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-18 00:26:05] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 00:26:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-18 00:26:05] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-18 00:26:05] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-18 00:26:06] [INFO ] After 121ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-18 00:26:06] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-18 00:26:06] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 17 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 112/112 transitions.
Graph (complete) has 109 edges and 102 vertex of which 55 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Ensure Unique test removed 1 places
Drop transitions removed 17 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 54 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 53 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 52 transition count 52
Applied a total of 24 rules in 23 ms. Remains 52 /102 variables (removed 50) and now considering 52/112 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 52/102 places, 52/112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 52 cols
[2023-03-18 00:26:06] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 00:26:06] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:26:06] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-18 00:26:06] [INFO ] After 17ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:06] [INFO ] After 34ms 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-18 00:26:06] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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||G(p1)))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Graph (complete) has 203 edges and 102 vertex of which 89 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 98
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 78 transition count 91
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 78 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 72 transition count 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 72 transition count 85
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 66 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 66 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 61 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 61 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 58 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 58 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 55 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 55 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 53 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 53 transition count 66
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 53 transition count 64
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 110 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 51 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 50 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 50 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 48 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 48 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 46 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 46 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 45 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 45 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 45 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 44 transition count 56
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 44 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 43 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 42 transition count 54
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 42 transition count 54
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 40 transition count 52
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 40 transition count 52
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 37 transition count 49
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 37 transition count 49
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 35 transition count 47
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 35 transition count 47
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 114 place count 32 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 32 transition count 44
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 120 place count 32 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 32 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 31 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 125 place count 31 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 126 place count 30 transition count 37
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 127 place count 29 transition count 36
Iterating global reduction 7 with 1 rules applied. Total rules applied 128 place count 29 transition count 36
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 130 place count 27 transition count 34
Iterating global reduction 7 with 2 rules applied. Total rules applied 132 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 134 place count 25 transition count 32
Iterating global reduction 7 with 2 rules applied. Total rules applied 136 place count 25 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 138 place count 25 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 140 place count 24 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 142 place count 24 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 143 place count 23 transition count 27
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 144 place count 22 transition count 26
Iterating global reduction 10 with 1 rules applied. Total rules applied 145 place count 22 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 146 place count 22 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 147 place count 22 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 148 place count 21 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 149 place count 21 transition count 23
Applied a total of 149 rules in 145 ms. Remains 21 /102 variables (removed 81) and now considering 23/112 (removed 89) transitions.
// Phase 1: matrix 23 rows 21 cols
[2023-03-18 00:26:07] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 00:26:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 00:26:07] [INFO ] Invariant cache hit.
[2023-03-18 00:26:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 00:26:07] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-18 00:26:07] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-18 00:26:07] [INFO ] Invariant cache hit.
[2023-03-18 00:26:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/102 places, 23/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 21/102 places, 23/112 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s12 s3), p0:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-00 finished in 759 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 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Graph (complete) has 203 edges and 102 vertex of which 89 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 98
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 79 transition count 92
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 79 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 72 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 72 transition count 85
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 66 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 66 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 61 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 61 transition count 74
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 57 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 57 transition count 70
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 54 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 54 transition count 67
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 50 transition count 63
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 50 transition count 63
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 48 transition count 61
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 48 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 48 transition count 59
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 48 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 97 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 46 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 46 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 45 transition count 54
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 44 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 44 transition count 53
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 43 transition count 52
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 43 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 42 transition count 51
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 42 transition count 51
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 41 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 41 transition count 50
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 41 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 40 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 39 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 39 transition count 48
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 108 place count 37 transition count 46
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 37 transition count 46
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 112 place count 35 transition count 44
Iterating global reduction 5 with 2 rules applied. Total rules applied 114 place count 35 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 33 transition count 42
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 33 transition count 42
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 121 place count 30 transition count 39
Iterating global reduction 5 with 3 rules applied. Total rules applied 124 place count 30 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 127 place count 30 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 30 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 129 place count 29 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 130 place count 29 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 131 place count 28 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 133 place count 28 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 134 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 135 place count 26 transition count 31
Iterating global reduction 9 with 1 rules applied. Total rules applied 136 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 137 place count 25 transition count 30
Iterating global reduction 9 with 1 rules applied. Total rules applied 138 place count 25 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 139 place count 25 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 140 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 141 place count 24 transition count 28
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 142 place count 23 transition count 27
Iterating global reduction 11 with 1 rules applied. Total rules applied 143 place count 23 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 144 place count 23 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 145 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 146 place count 22 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 147 place count 22 transition count 24
Applied a total of 147 rules in 97 ms. Remains 22 /102 variables (removed 80) and now considering 24/112 (removed 88) transitions.
// Phase 1: matrix 24 rows 22 cols
[2023-03-18 00:26:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 00:26:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 00:26:08] [INFO ] Invariant cache hit.
[2023-03-18 00:26:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-18 00:26:08] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-18 00:26:08] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-18 00:26:08] [INFO ] Invariant cache hit.
[2023-03-18 00:26:08] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/102 places, 24/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 22/102 places, 24/112 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-01 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:(GT s13 s4)], 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 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-01 finished in 410 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((F(G((p1 U p2)))&&p0)))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 92 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 89 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 89 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 86 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 86 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 84 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 84 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 83 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 83 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 82 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 82 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 81 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 81 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 80 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 80 transition count 90
Applied a total of 44 rules in 26 ms. Remains 80 /102 variables (removed 22) and now considering 90/112 (removed 22) transitions.
[2023-03-18 00:26:08] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 80 cols
[2023-03-18 00:26:08] [INFO ] Computed 1 place invariants in 12 ms
[2023-03-18 00:26:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 00:26:08] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2023-03-18 00:26:08] [INFO ] Invariant cache hit.
[2023-03-18 00:26:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-18 00:26:08] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-18 00:26:08] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2023-03-18 00:26:08] [INFO ] Invariant cache hit.
[2023-03-18 00:26:09] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/102 places, 90/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 80/102 places, 90/112 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GT s21 s79) (GT 3 s15)), p2:(LEQ s21 s79), p1:(LEQ s70 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-04 finished in 732 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)&&F(G(p1))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Graph (complete) has 203 edges and 102 vertex of which 90 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 86 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 81 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 81 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 76 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 76 transition count 89
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 72 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 72 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 69 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 69 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 67 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 66 transition count 79
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 66 transition count 75
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 130 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 64 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 63 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 57 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 57 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 55 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 55 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 53 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 53 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 51 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 51 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 51 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 51 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 50 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 50 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 49 transition count 57
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 48 transition count 56
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 48 transition count 56
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 92 place count 46 transition count 54
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 46 transition count 54
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 96 place count 44 transition count 52
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 44 transition count 52
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 101 place count 41 transition count 49
Iterating global reduction 5 with 3 rules applied. Total rules applied 104 place count 41 transition count 49
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 107 place count 38 transition count 46
Iterating global reduction 5 with 3 rules applied. Total rules applied 110 place count 38 transition count 46
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 113 place count 38 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 38 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 115 place count 37 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 116 place count 37 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 117 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 118 place count 35 transition count 40
Iterating global reduction 8 with 1 rules applied. Total rules applied 119 place count 35 transition count 40
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 121 place count 33 transition count 38
Iterating global reduction 8 with 2 rules applied. Total rules applied 123 place count 33 transition count 38
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 124 place count 32 transition count 37
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 32 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 126 place count 32 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 127 place count 32 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 128 place count 31 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 129 place count 31 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 130 place count 30 transition count 34
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 131 place count 29 transition count 33
Iterating global reduction 11 with 1 rules applied. Total rules applied 132 place count 29 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 133 place count 29 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 134 place count 29 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 135 place count 28 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 136 place count 28 transition count 30
Applied a total of 136 rules in 93 ms. Remains 28 /102 variables (removed 74) and now considering 30/112 (removed 82) transitions.
// Phase 1: matrix 30 rows 28 cols
[2023-03-18 00:26:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 00:26:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 00:26:09] [INFO ] Invariant cache hit.
[2023-03-18 00:26:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 00:26:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-18 00:26:09] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-18 00:26:09] [INFO ] Invariant cache hit.
[2023-03-18 00:26:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/102 places, 30/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 28/102 places, 30/112 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, 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 (LEQ 1 s12) (LEQ s3 s15)), p1:(GT s3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-05 finished in 440 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(p0)&&(p1||F(p2)||(p3&&G(p0)))))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 93 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 88 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 88 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 84 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 80 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 80 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 79 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 79 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 78 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 78 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 77 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 77 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 76 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 76 transition count 86
Applied a total of 52 rules in 19 ms. Remains 76 /102 variables (removed 26) and now considering 86/112 (removed 26) transitions.
[2023-03-18 00:26:09] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 76 cols
[2023-03-18 00:26:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 00:26:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 00:26:09] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2023-03-18 00:26:09] [INFO ] Invariant cache hit.
[2023-03-18 00:26:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-18 00:26:10] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-18 00:26:10] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2023-03-18 00:26:10] [INFO ] Invariant cache hit.
[2023-03-18 00:26:10] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/102 places, 86/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 76/102 places, 86/112 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0)), true]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p0))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s18 s48), p2:(LEQ s9 s8), p3:(GT 3 s74), p0:(LEQ 2 s64)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-06 finished in 736 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((G((X(p0)&&(p1 U (p2||G(p1)))))||(p3 U (p4||G(p3)))))))'
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 94 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 88 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 88 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 83 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 83 transition count 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 79 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 79 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 76 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 76 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 75 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 75 transition count 85
Applied a total of 54 rules in 10 ms. Remains 75 /102 variables (removed 27) and now considering 85/112 (removed 27) transitions.
[2023-03-18 00:26:10] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
// Phase 1: matrix 76 rows 75 cols
[2023-03-18 00:26:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 00:26:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 00:26:10] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-18 00:26:10] [INFO ] Invariant cache hit.
[2023-03-18 00:26:10] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-18 00:26:10] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-18 00:26:10] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-18 00:26:10] [INFO ] Invariant cache hit.
[2023-03-18 00:26:10] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/102 places, 85/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 75/102 places, 85/112 transitions.
Stuttering acceptance computed with spot in 423 ms :[true, (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=p4, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) p3), acceptance={} source=2 dest: 3}, { cond=(OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p4) p3) (AND p1 (NOT p4) p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=p4, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p0))), acceptance={} source=5 dest: 0}, { cond=p4, acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p4) p3) (AND (NOT p4) p3 (NOT p0))), acceptance={} source=5 dest: 3}, { cond=(OR (AND p2 (NOT p4) (NOT p3) p0) (AND p1 (NOT p4) (NOT p3) p0)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p4) p3 p0) (AND p1 (NOT p4) p3 p0)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GT s10 s51) (GT 2 s48)), p1:(GT 2 s48), p4:(AND (GT s6 s22) (GT s11 s65)), p3:(GT s11 s65), p0:(GT 2 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-07 finished in 767 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 p1)||G((G(p0)||F(p2)))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Graph (complete) has 203 edges and 102 vertex of which 91 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 87 transition count 100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 80 transition count 93
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 80 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 73 transition count 86
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 73 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 67 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 67 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 62 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 62 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 58 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 58 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 55 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 55 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 52 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 52 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 51 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 51 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 51 transition count 63
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 51 transition count 61
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 101 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 49 transition count 60
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 48 transition count 59
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 48 transition count 59
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 46 transition count 57
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 46 transition count 57
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 44 transition count 55
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 44 transition count 55
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 42 transition count 53
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 42 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 41 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 41 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 41 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 40 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 40 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 39 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 38 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 38 transition count 49
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 110 place count 36 transition count 47
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 36 transition count 47
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 115 place count 33 transition count 44
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 33 transition count 44
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 121 place count 30 transition count 41
Iterating global reduction 5 with 3 rules applied. Total rules applied 124 place count 30 transition count 41
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 127 place count 27 transition count 38
Iterating global reduction 5 with 3 rules applied. Total rules applied 130 place count 27 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 133 place count 27 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 134 place count 27 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 135 place count 26 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 136 place count 26 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 137 place count 25 transition count 33
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 138 place count 24 transition count 32
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 141 place count 22 transition count 30
Iterating global reduction 8 with 2 rules applied. Total rules applied 143 place count 22 transition count 30
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 145 place count 20 transition count 28
Iterating global reduction 8 with 2 rules applied. Total rules applied 147 place count 20 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 149 place count 20 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 150 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 151 place count 19 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 153 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 154 place count 18 transition count 23
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 155 place count 17 transition count 22
Iterating global reduction 11 with 1 rules applied. Total rules applied 156 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 157 place count 17 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 159 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 160 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 161 place count 16 transition count 18
Applied a total of 161 rules in 70 ms. Remains 16 /102 variables (removed 86) and now considering 18/112 (removed 94) transitions.
// Phase 1: matrix 18 rows 16 cols
[2023-03-18 00:26:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 00:26:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 00:26:11] [INFO ] Invariant cache hit.
[2023-03-18 00:26:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-18 00:26:11] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 00:26:11] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 00:26:11] [INFO ] Invariant cache hit.
[2023-03-18 00:26:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/102 places, 18/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 16/102 places, 18/112 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s2 s7), p1:(LEQ 1 s8), p2:(LEQ 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-09 finished in 411 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((p0||X((p1||F(G(p2))))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 93 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 87 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 87 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 82 transition count 92
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 82 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 77 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 74 transition count 84
Applied a total of 56 rules in 11 ms. Remains 74 /102 variables (removed 28) and now considering 84/112 (removed 28) transitions.
[2023-03-18 00:26:11] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
// Phase 1: matrix 75 rows 74 cols
[2023-03-18 00:26:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 00:26:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 00:26:11] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2023-03-18 00:26:11] [INFO ] Invariant cache hit.
[2023-03-18 00:26:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-18 00:26:11] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-18 00:26:11] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2023-03-18 00:26:11] [INFO ] Invariant cache hit.
[2023-03-18 00:26:12] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/102 places, 84/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 74/102 places, 84/112 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s19), p1:(LEQ 1 s17), p2:(LEQ 2 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 3 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-10 finished in 784 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((F(!(p0 U p1))&&!p0)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 92 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 86 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 80 transition count 90
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 76 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 76 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 73 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 73 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 71 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 69 transition count 79
Applied a total of 66 rules in 14 ms. Remains 69 /102 variables (removed 33) and now considering 79/112 (removed 33) transitions.
[2023-03-18 00:26:12] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 69 cols
[2023-03-18 00:26:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 00:26:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 00:26:12] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-18 00:26:12] [INFO ] Invariant cache hit.
[2023-03-18 00:26:12] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 00:26:12] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 00:26:12] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-18 00:26:12] [INFO ] Invariant cache hit.
[2023-03-18 00:26:12] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/102 places, 79/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 69/102 places, 79/112 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR p1 p0), (OR p1 p0), true, p1]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s32), p1:(GT s18 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 574 ms.
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-11 finished in 1676 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(F(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 92 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 86 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 80 transition count 90
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 80 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 75 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 75 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 72 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 72 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 70 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 68 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 68 transition count 78
Applied a total of 68 rules in 8 ms. Remains 68 /102 variables (removed 34) and now considering 78/112 (removed 34) transitions.
[2023-03-18 00:26:14] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 68 cols
[2023-03-18 00:26:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 00:26:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-18 00:26:14] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2023-03-18 00:26:14] [INFO ] Invariant cache hit.
[2023-03-18 00:26:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-18 00:26:14] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-18 00:26:14] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2023-03-18 00:26:14] [INFO ] Invariant cache hit.
[2023-03-18 00:26:14] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/102 places, 78/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 68/102 places, 78/112 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-12 finished in 388 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(F(p0))||((p1||(p1 U p2)) U p3)))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 92 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 86 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 80 transition count 90
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 77 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 77 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 75 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 75 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 74 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 74 transition count 84
Applied a total of 56 rules in 23 ms. Remains 74 /102 variables (removed 28) and now considering 84/112 (removed 28) transitions.
[2023-03-18 00:26:14] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
// Phase 1: matrix 75 rows 74 cols
[2023-03-18 00:26:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 00:26:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 00:26:14] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2023-03-18 00:26:14] [INFO ] Invariant cache hit.
[2023-03-18 00:26:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-18 00:26:14] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-18 00:26:14] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2023-03-18 00:26:14] [INFO ] Invariant cache hit.
[2023-03-18 00:26:14] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/102 places, 84/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 74/102 places, 84/112 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) p2 (NOT p0))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ 3 s7), p1:(LEQ 3 s65), p2:(LEQ s67 s16), p0:(GT 3 s38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) p2 (NOT p0))))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)))), (X p0), (X (X (NOT (OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) p2 (NOT p0)))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-14 finished in 1364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(X(F(p0))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 112/112 transitions.
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 93 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 87 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 87 transition count 97
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 81 transition count 91
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 81 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 76 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 76 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 73 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 73 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 71 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 69 transition count 79
Applied a total of 66 rules in 8 ms. Remains 69 /102 variables (removed 33) and now considering 79/112 (removed 33) transitions.
[2023-03-18 00:26:15] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 69 cols
[2023-03-18 00:26:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 00:26:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-18 00:26:16] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-18 00:26:16] [INFO ] Invariant cache hit.
[2023-03-18 00:26:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-18 00:26:16] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-18 00:26:16] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-18 00:26:16] [INFO ] Invariant cache hit.
[2023-03-18 00:26:16] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/102 places, 79/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 69/102 places, 79/112 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GT s15 s54), p1:(GT s14 s44)], 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 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-15 finished in 669 ms.
All properties solved by simple procedures.
Total runtime 14243 ms.
ITS solved all properties within timeout
BK_STOP 1679099177533
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
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="SemanticWebServices-PT-S128P18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SemanticWebServices-PT-S128P18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891808900411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P18.tgz
mv SemanticWebServices-PT-S128P18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;