Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Feb 26 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 10:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 227K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679249688490

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 18:14:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 18:14:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:14:51] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-19 18:14:51] [INFO ] Transformed 188 places.
[2023-03-19 18:14:51] [INFO ] Transformed 416 transitions.
[2023-03-19 18:14:51] [INFO ] Parsed PT model containing 188 places and 416 transitions and 1593 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 220 transitions
Reduce redundant transitions removed 220 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Ensure Unique test removed 33 places
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 81 transition count 92
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 215 place count 73 transition count 84
Iterating global reduction 1 with 8 rules applied. Total rules applied 223 place count 73 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 224 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 68 transition count 78
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 68 transition count 78
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 238 place count 64 transition count 74
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 64 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 245 place count 61 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 248 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 249 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 60 transition count 70
Applied a total of 250 rules in 47 ms. Remains 60 /186 variables (removed 126) and now considering 70/194 (removed 124) transitions.
[2023-03-19 18:14:51] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 60 cols
[2023-03-19 18:14:51] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-19 18:14:51] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-19 18:14:51] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2023-03-19 18:14:51] [INFO ] Invariant cache hit.
[2023-03-19 18:14:51] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 18:14:51] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-19 18:14:51] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2023-03-19 18:14:51] [INFO ] Invariant cache hit.
[2023-03-19 18:14:51] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/186 places, 70/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 60/186 places, 70/194 transitions.
Support contains 7 out of 60 places after structural reductions.
[2023-03-19 18:14:52] [INFO ] Flatten gal took : 50 ms
[2023-03-19 18:14:52] [INFO ] Flatten gal took : 16 ms
[2023-03-19 18:14:52] [INFO ] Input system was already deterministic with 70 transitions.
Finished random walk after 163 steps, including 0 resets, run visited all 8 properties in 47 ms. (steps per millisecond=3 )
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(F(p2))&&p1)))))'
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 129 edges and 60 vertex of which 54 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 51 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 51 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 48 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 48 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 14 place count 45 transition count 58
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 45 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 43 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 43 transition count 56
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 43 transition count 53
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 93 edges and 42 vertex of which 41 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 0 with 2 rules applied. Total rules applied 26 place count 41 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 41 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 40 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 39 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 39 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 37 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 37 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 34 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 34 transition count 45
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 29 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 29 transition count 40
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 55 place count 29 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 29 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 27 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 27 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 26 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 25 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 25 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 25 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 67 place count 23 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 22 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 22 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 71 place count 22 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 73 place count 22 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 74 place count 21 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 75 place count 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 76 place count 20 transition count 23
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 20 transition count 22
Applied a total of 77 rules in 78 ms. Remains 20 /60 variables (removed 40) and now considering 22/70 (removed 48) transitions.
// Phase 1: matrix 22 rows 20 cols
[2023-03-19 18:14:52] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 18:14:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 18:14:52] [INFO ] Invariant cache hit.
[2023-03-19 18:14:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-19 18:14:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-19 18:14:52] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 18:14:52] [INFO ] Invariant cache hit.
[2023-03-19 18:14:52] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/60 places, 22/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 20/60 places, 22/70 transitions.
Stuttering acceptance computed with spot in 407 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s13 1)), p0:(AND (GEQ s5 1) (GEQ s1 1) (GEQ s13 1)), p2:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-02 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&F(G(p2)))))'
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 129 edges and 60 vertex of which 54 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 52 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 50 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 50 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 48 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 48 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 47 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 47 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 46 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 46 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 45 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 45 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 45 transition count 58
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 45 transition count 55
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 91 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 23 place count 43 transition count 54
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 43 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 42 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 41 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 41 transition count 51
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 39 transition count 49
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 39 transition count 49
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 36 transition count 46
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 36 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 42 place count 32 transition count 42
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 32 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 50 place count 32 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 32 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 52 place count 31 transition count 37
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 53 place count 30 transition count 36
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 30 transition count 36
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 55 place count 29 transition count 35
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 29 transition count 35
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 28 transition count 34
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 28 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 28 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 28 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 61 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 62 place count 26 transition count 31
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 64 place count 25 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 65 place count 25 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 66 place count 25 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 67 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 68 place count 24 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 69 place count 24 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 70 place count 23 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 71 place count 23 transition count 26
Applied a total of 71 rules in 47 ms. Remains 23 /60 variables (removed 37) and now considering 26/70 (removed 44) transitions.
// Phase 1: matrix 26 rows 23 cols
[2023-03-19 18:14:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 18:14:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 18:14:53] [INFO ] Invariant cache hit.
[2023-03-19 18:14:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-19 18:14:53] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 18:14:53] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-19 18:14:53] [INFO ] Invariant cache hit.
[2023-03-19 18:14:53] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/60 places, 26/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 23/60 places, 26/70 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s4 1), p2:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-06 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 129 edges and 60 vertex of which 54 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
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 50 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 50 transition count 63
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 46 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 46 transition count 59
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 19 place count 42 transition count 55
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 42 transition count 55
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 26 place count 39 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 39 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 38 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 38 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 37 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 37 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 37 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 37 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 82 edges and 36 vertex of which 35 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 38 place count 35 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 35 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 34 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 33 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 33 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 31 transition count 42
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 31 transition count 42
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 28 transition count 39
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 28 transition count 39
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 57 place count 23 transition count 34
Iterating global reduction 3 with 5 rules applied. Total rules applied 62 place count 23 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 67 place count 23 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 21 transition count 27
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 72 place count 20 transition count 26
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 74 place count 19 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 19 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 76 place count 19 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 77 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 78 place count 18 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 79 place count 17 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 80 place count 17 transition count 22
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 81 place count 16 transition count 21
Iterating global reduction 7 with 1 rules applied. Total rules applied 82 place count 16 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 83 place count 16 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 85 place count 16 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 86 place count 15 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 87 place count 15 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 88 place count 14 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 89 place count 14 transition count 16
Applied a total of 89 rules in 46 ms. Remains 14 /60 variables (removed 46) and now considering 16/70 (removed 54) transitions.
// Phase 1: matrix 16 rows 14 cols
[2023-03-19 18:14:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 18:14:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 18:14:53] [INFO ] Invariant cache hit.
[2023-03-19 18:14:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 18:14:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 18:14:53] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 18:14:53] [INFO ] Invariant cache hit.
[2023-03-19 18:14:53] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/60 places, 16/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 14/60 places, 16/70 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-11 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 129 edges and 60 vertex of which 54 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
Ensure Unique test removed 1 places
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 50 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 50 transition count 64
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 46 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 46 transition count 60
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 19 place count 42 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 42 transition count 56
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 26 place count 39 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 39 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 31 place count 37 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 37 transition count 51
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 35 place count 35 transition count 49
Iterating global reduction 0 with 2 rules applied. Total rules applied 37 place count 35 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 39 place count 35 transition count 47
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 35 transition count 45
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 73 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 33 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 33 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 32 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 31 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 31 transition count 42
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 29 transition count 40
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 29 transition count 40
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 26 transition count 37
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 26 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 62 place count 21 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 21 transition count 32
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 21 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 19 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 18 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 17 transition count 23
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 17 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 17 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 83 place count 16 transition count 21
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 15 transition count 20
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 86 place count 14 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 87 place count 14 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 88 place count 14 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 89 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 90 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 91 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 92 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 93 place count 12 transition count 15
Applied a total of 93 rules in 56 ms. Remains 12 /60 variables (removed 48) and now considering 15/70 (removed 55) transitions.
// Phase 1: matrix 15 rows 12 cols
[2023-03-19 18:14:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 18:14:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 18:14:54] [INFO ] Invariant cache hit.
[2023-03-19 18:14:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 18:14:54] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-19 18:14:54] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 18:14:54] [INFO ] Invariant cache hit.
[2023-03-19 18:14:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/60 places, 15/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 12/60 places, 15/70 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s0 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-14 finished in 387 ms.
All properties solved by simple procedures.
Total runtime 3525 ms.
ITS solved all properties within timeout

BK_STOP 1679249695309

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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