Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K Apr 29 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 261K May 10 09:34 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 1652967860721

Running Version 202205111006
[2022-05-19 13:44:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 13:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:44:22] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-05-19 13:44:22] [INFO ] Transformed 184 places.
[2022-05-19 13:44:22] [INFO ] Transformed 466 transitions.
[2022-05-19 13:44:22] [INFO ] Parsed PT model containing 184 places and 466 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 2 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-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 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 45 places
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 116 transition count 124
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 110 transition count 118
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 110 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 110 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 107 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 107 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 105 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 105 transition count 112
Applied a total of 160 rules in 47 ms. Remains 105 /182 variables (removed 77) and now considering 112/195 (removed 83) transitions.
[2022-05-19 13:44:22] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
// Phase 1: matrix 103 rows 105 cols
[2022-05-19 13:44:22] [INFO ] Computed 6 place invariants in 41 ms
[2022-05-19 13:44:22] [INFO ] Implicit Places using invariants in 155 ms returned []
[2022-05-19 13:44:22] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
// Phase 1: matrix 103 rows 105 cols
[2022-05-19 13:44:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 13:44:22] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-19 13:44:22] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2022-05-19 13:44:22] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
// Phase 1: matrix 103 rows 105 cols
[2022-05-19 13:44:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 13:44:22] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/182 places, 112/195 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/182 places, 112/195 transitions.
Support contains 47 out of 105 places after structural reductions.
[2022-05-19 13:44:22] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 13:44:22] [INFO ] Flatten gal took : 26 ms
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 13:44:22] [INFO ] Flatten gal took : 25 ms
[2022-05-19 13:44:22] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 39 out of 105 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 26) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-19 13:44:23] [INFO ] Flow matrix only has 103 transitions (discarded 9 similar events)
// Phase 1: matrix 103 rows 105 cols
[2022-05-19 13:44:23] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-19 13:44:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 13:44:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-19 13:44:23] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 13:44:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 13:44:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 13:44:23] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-19 13:44:23] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-19 13:44:23] [INFO ] After 39ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2022-05-19 13:44:24] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-19 13:44:24] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 112/112 transitions.
Graph (complete) has 202 edges and 105 vertex of which 97 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 96 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 11 place count 96 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 94 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 89 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 89 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 89 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 87 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 85 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 84 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 83 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 82 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 82 transition count 88
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 79 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 78 transition count 84
Applied a total of 47 rules in 35 ms. Remains 78 /105 variables (removed 27) and now considering 84/112 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/105 places, 84/112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 13:44:24] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
// Phase 1: matrix 75 rows 78 cols
[2022-05-19 13:44:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 13:44:24] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:44:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 13:44:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 13:44:24] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:44:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-19 13:44:24] [INFO ] After 5ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:44:24] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-19 13:44:24] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 84/84 transitions.
Graph (complete) has 93 edges and 78 vertex of which 9 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.0 ms
Discarding 69 places :
Also discarding 62 output transitions
Drop transitions removed 62 transitions
Drop transitions removed 13 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 8 transition count 8
Applied a total of 16 rules in 1 ms. Remains 8 /78 variables (removed 70) and now considering 8/84 (removed 76) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/78 places, 8/84 transitions.
Finished random walk after 179 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=179 )
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 90 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 84 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 84 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 80 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 76 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 72 transition count 82
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 72 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 69 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 69 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 66 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 66 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 65 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 65 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 65 transition count 74
Applied a total of 78 rules in 11 ms. Remains 65 /105 variables (removed 40) and now considering 74/112 (removed 38) transitions.
[2022-05-19 13:44:24] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
// Phase 1: matrix 66 rows 65 cols
[2022-05-19 13:44:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-19 13:44:24] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
// Phase 1: matrix 66 rows 65 cols
[2022-05-19 13:44:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:44:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-19 13:44:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-19 13:44:24] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
// Phase 1: matrix 66 rows 65 cols
[2022-05-19 13:44:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:24] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/105 places, 74/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/105 places, 74/112 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-03 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 s9)], 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 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-03 finished in 472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 90 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 84 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 84 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 80 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 76 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 72 transition count 82
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 72 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 69 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 69 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 66 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 66 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 64 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 64 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 64 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 63 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 63 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 63 transition count 71
Applied a total of 83 rules in 11 ms. Remains 63 /105 variables (removed 42) and now considering 71/112 (removed 41) transitions.
[2022-05-19 13:44:25] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 63 cols
[2022-05-19 13:44:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 13:44:25] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 63 cols
[2022-05-19 13:44:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-19 13:44:25] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-19 13:44:25] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 63 cols
[2022-05-19 13:44:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:44:25] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/105 places, 71/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/105 places, 71/112 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
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={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2 s35)], 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]]
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-04 finished in 911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(X(F(p1)))&&G(!p0)))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 91 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 85 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 85 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 85 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 82 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 79 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 79 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 75 transition count 85
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 75 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 72 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 72 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 69 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 69 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 67 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 67 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 66 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 66 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 66 transition count 74
Applied a total of 77 rules in 25 ms. Remains 66 /105 variables (removed 39) and now considering 74/112 (removed 38) transitions.
[2022-05-19 13:44:26] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-19 13:44:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-19 13:44:26] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-19 13:44:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-19 13:44:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-19 13:44:26] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-19 13:44:26] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:44:26] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/105 places, 74/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/105 places, 74/112 transitions.
Stuttering acceptance computed with spot in 138 ms :[(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-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s47 s7), p1:(LEQ s10 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 273 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2022-05-19 13:44:27] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-19 13:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-19 13:44:27] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-19 13:44:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:44:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-19 13:44:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-19 13:44:27] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2022-05-19 13:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 74/74 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4002 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=307 )
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 74/74 transitions.
Graph (complete) has 132 edges and 66 vertex of which 60 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 59 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 58 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 58 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 56 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 56 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 53 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 53 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 51 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 51 transition count 62
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 22 place count 48 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 48 transition count 59
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 46 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 46 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 45 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 45 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 45 transition count 55
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 45 transition count 53
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 87 edges and 44 vertex of which 43 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 1 with 2 rules applied. Total rules applied 36 place count 43 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 42 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 42 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 41 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 41 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 40 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 40 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 39 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 39 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 38 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 38 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 36 transition count 45
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 36 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 34 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 34 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 34 transition count 41
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 34 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 33 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 33 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 32 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 32 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 31 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 65 place count 31 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 66 place count 30 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 67 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 68 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 69 place count 28 transition count 33
Iterating global reduction 8 with 1 rules applied. Total rules applied 70 place count 28 transition count 33
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 72 place count 26 transition count 31
Iterating global reduction 8 with 2 rules applied. Total rules applied 74 place count 26 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 76 place count 26 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 77 place count 26 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 78 place count 25 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 79 place count 25 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 80 place count 24 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 81 place count 24 transition count 26
Applied a total of 81 rules in 38 ms. Remains 24 /66 variables (removed 42) and now considering 26/74 (removed 48) transitions.
[2022-05-19 13:44:28] [INFO ] Redundant transitions in 232 ms returned []
// Phase 1: matrix 26 rows 24 cols
[2022-05-19 13:44:28] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-19 13:44:29] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/66 places, 26/74 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/66 places, 26/74 transitions.
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Built C files in :
/tmp/ltsmin10674564446106705117
[2022-05-19 13:44:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10674564446106705117
Running compilation step : cd /tmp/ltsmin10674564446106705117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin10674564446106705117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10674564446106705117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1571504344509514863.hoa' '--buchi-type=spotba'
LTSmin run took 276 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-05 finished in 3853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 90 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 86 transition count 97
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 86 transition count 97
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 82 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 82 transition count 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 78 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 78 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 75 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 75 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 72 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 72 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 69 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 69 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 67 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 67 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 67 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 66 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 66 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 66 transition count 75
Applied a total of 76 rules in 6 ms. Remains 66 /105 variables (removed 39) and now considering 75/112 (removed 37) transitions.
[2022-05-19 13:44:29] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 66 cols
[2022-05-19 13:44:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-19 13:44:29] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 66 cols
[2022-05-19 13:44:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-19 13:44:30] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 66 cols
[2022-05-19 13:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/105 places, 75/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/105 places, 75/112 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s46 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-06 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Graph (complete) has 300 edges and 105 vertex of which 88 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 83 transition count 97
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 77 transition count 91
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 77 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 77 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 73 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 73 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 69 transition count 82
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 69 transition count 82
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 64 transition count 77
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 64 transition count 77
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 59 transition count 72
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 59 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 54 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 54 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 51 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 51 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 50 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 50 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 50 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 50 transition count 60
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 102 edges and 49 vertex of which 48 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 3 with 2 rules applied. Total rules applied 84 place count 48 transition count 59
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 47 transition count 58
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 47 transition count 58
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 88 place count 45 transition count 56
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 45 transition count 56
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 44 transition count 55
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 44 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 43 transition count 54
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 43 transition count 54
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 43 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 42 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 42 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 41 transition count 51
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 101 place count 41 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 102 place count 40 transition count 49
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 103 place count 39 transition count 48
Iterating global reduction 7 with 1 rules applied. Total rules applied 104 place count 39 transition count 48
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 106 place count 37 transition count 46
Iterating global reduction 7 with 2 rules applied. Total rules applied 108 place count 37 transition count 46
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 111 place count 34 transition count 43
Iterating global reduction 7 with 3 rules applied. Total rules applied 114 place count 34 transition count 43
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 118 place count 30 transition count 39
Iterating global reduction 7 with 4 rules applied. Total rules applied 122 place count 30 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 126 place count 30 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 128 place count 29 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 29 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 130 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 131 place count 27 transition count 32
Iterating global reduction 10 with 1 rules applied. Total rules applied 132 place count 27 transition count 32
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 134 place count 25 transition count 30
Iterating global reduction 10 with 2 rules applied. Total rules applied 136 place count 25 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 138 place count 25 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 25 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 140 place count 24 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 141 place count 24 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 142 place count 23 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 143 place count 23 transition count 25
Applied a total of 143 rules in 27 ms. Remains 23 /105 variables (removed 82) and now considering 25/112 (removed 87) transitions.
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 13:44:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 13:44:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:44:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-19 13:44:30] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 13:44:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/105 places, 25/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/105 places, 25/112 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s12 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-07 finished in 149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((F(G(X(F(p0))))||X(p1)))&&p2)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 90 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 85 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 85 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 85 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 82 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 79 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 79 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 78 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 78 transition count 88
Applied a total of 51 rules in 8 ms. Remains 78 /105 variables (removed 27) and now considering 88/112 (removed 24) transitions.
[2022-05-19 13:44:30] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 78 cols
[2022-05-19 13:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 13:44:30] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 78 cols
[2022-05-19 13:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-19 13:44:30] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 78 cols
[2022-05-19 13:44:30] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:44:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/105 places, 88/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/105 places, 88/112 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s45 s58), p1:(LEQ 1 s59), p0:(GT 3 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-09 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&F(p1)&&p1)))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Graph (complete) has 300 edges and 105 vertex of which 90 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 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 85 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 17 place count 78 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 78 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 78 transition count 91
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 73 transition count 86
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 73 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 69 transition count 82
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 63 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 63 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 59 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 59 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 54 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 54 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 50 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 50 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 50 transition count 62
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 49 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 49 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 49 transition count 60
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 49 transition count 58
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 96 edges and 48 vertex of which 47 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 4 with 2 rules applied. Total rules applied 89 place count 47 transition count 57
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 46 transition count 56
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 46 transition count 56
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 93 place count 44 transition count 54
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 44 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 43 transition count 53
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 43 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 42 transition count 52
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 42 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 100 place count 41 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 101 place count 41 transition count 51
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 40 transition count 50
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 40 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 39 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 39 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 106 place count 39 transition count 48
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 39 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 108 place count 38 transition count 47
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 110 place count 38 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 111 place count 37 transition count 45
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 112 place count 36 transition count 44
Iterating global reduction 8 with 1 rules applied. Total rules applied 113 place count 36 transition count 44
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 115 place count 34 transition count 42
Iterating global reduction 8 with 2 rules applied. Total rules applied 117 place count 34 transition count 42
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 119 place count 32 transition count 40
Iterating global reduction 8 with 2 rules applied. Total rules applied 121 place count 32 transition count 40
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 123 place count 30 transition count 38
Iterating global reduction 8 with 2 rules applied. Total rules applied 125 place count 30 transition count 38
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 128 place count 27 transition count 35
Iterating global reduction 8 with 3 rules applied. Total rules applied 131 place count 27 transition count 35
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 134 place count 27 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 135 place count 27 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 136 place count 26 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 137 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 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 11 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 11 with 1 rules applied. Total rules applied 140 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 141 place count 23 transition count 28
Iterating global reduction 12 with 1 rules applied. Total rules applied 142 place count 23 transition count 28
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 144 place count 21 transition count 26
Iterating global reduction 12 with 2 rules applied. Total rules applied 146 place count 21 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 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 13 with 1 rules applied. Total rules applied 149 place count 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 150 place count 20 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 151 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 152 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 153 place count 19 transition count 21
Applied a total of 153 rules in 30 ms. Remains 19 /105 variables (removed 86) and now considering 21/112 (removed 91) transitions.
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:44:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:44:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:44:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-19 13:44:30] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:44:30] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:44:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/105 places, 21/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/105 places, 21/112 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s4), p0:(GT s9 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-10 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((p0 U G((F(G(p1)) U X(p2))))))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 90 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 84 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 84 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 80 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 76 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 72 transition count 82
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 72 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 70 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 70 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 68 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 68 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 67 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 67 transition count 76
Applied a total of 74 rules in 5 ms. Remains 67 /105 variables (removed 38) and now considering 76/112 (removed 36) transitions.
[2022-05-19 13:44:30] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2022-05-19 13:44:30] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:44:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-19 13:44:30] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2022-05-19 13:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-19 13:44:31] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-19 13:44:31] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2022-05-19 13:44:31] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:44:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/105 places, 76/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/105 places, 76/112 transitions.
Stuttering acceptance computed with spot in 507 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-13 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=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=p1, acceptance={1} source=5 dest: 5}, { cond=(NOT p1), acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=8 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ s30 s22), p2:(LEQ 3 s62), p1:(LEQ 1 s31)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, 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-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-13 finished in 720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 91 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 86 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 86 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 86 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 83 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 83 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 80 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 80 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 78 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 78 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 76 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 76 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 74 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 73 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 72 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 72 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 72 transition count 81
Applied a total of 64 rules in 13 ms. Remains 72 /105 variables (removed 33) and now considering 81/112 (removed 31) transitions.
[2022-05-19 13:44:31] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
// Phase 1: matrix 73 rows 72 cols
[2022-05-19 13:44:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-19 13:44:31] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
// Phase 1: matrix 73 rows 72 cols
[2022-05-19 13:44:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:31] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-05-19 13:44:31] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-05-19 13:44:31] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
// Phase 1: matrix 73 rows 72 cols
[2022-05-19 13:44:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:44:31] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/105 places, 81/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 72/105 places, 81/112 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-14 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 s8 s24)], 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]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-14 finished in 554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||F(p2)) U X(!(F(p4)||p3))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 112/112 transitions.
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 91 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 85 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 85 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 85 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 82 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 80 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 77 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 77 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 75 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 75 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 73 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 73 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 71 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 71 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 71 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 70 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 70 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 70 transition count 78
Applied a total of 69 rules in 10 ms. Remains 70 /105 variables (removed 35) and now considering 78/112 (removed 34) transitions.
[2022-05-19 13:44:32] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 70 cols
[2022-05-19 13:44:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-19 13:44:32] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 70 cols
[2022-05-19 13:44:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:44:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-05-19 13:44:32] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-19 13:44:32] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 70 cols
[2022-05-19 13:44:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:44:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/105 places, 78/112 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/105 places, 78/112 transitions.
Stuttering acceptance computed with spot in 616 ms :[(OR p3 p4), (OR (AND (NOT p2) p4) (AND (NOT p2) p3)), (OR p4 p3), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4)), (NOT p2), (AND (NOT p2) p4), p4, (AND (NOT p1) (NOT p2) p4), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) p3) (AND (NOT p2) p4)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p3) (NOT p4))), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p0) (NOT p2) p4)), acceptance={} source=2 dest: 1}, { cond=(OR p3 p4), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0 (NOT p2) p3) (AND (NOT p1) p0 (NOT p2) p4)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p0) (NOT p2) p4)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p0 (NOT p2) p3) (AND (NOT p1) p0 (NOT p2) p4)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p4), acceptance={} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p2) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) p4), acceptance={} source=6 dest: 1}, { cond=p4, acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) p4), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=6 dest: 5}, { cond=(NOT p4), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p4)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) p4), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) p4), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ s4 s52), p0:(LEQ s22 s56), p2:(LEQ 3 s8), p3:(OR (LEQ s22 s56) (LEQ 2 s53)), p4:(LEQ 2 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-15 finished in 776 ms.
All properties solved by simple procedures.
Total runtime 11120 ms.

BK_STOP 1652967873178

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r204-oct2-165281599200411"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;