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-167891811300347.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-S064P09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811300347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 10:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 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 102K 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-S064P09-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679224749253

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 11:19:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 11:19:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:19:12] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-19 11:19:12] [INFO ] Transformed 100 places.
[2023-03-19 11:19:12] [INFO ] Transformed 164 transitions.
[2023-03-19 11:19:12] [INFO ] Parsed PT model containing 100 places and 164 transitions and 719 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 82/82 transitions.
Ensure Unique test removed 18 places
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 60 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 58 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 58 transition count 69
Applied a total of 53 rules in 25 ms. Remains 58 /98 variables (removed 40) and now considering 69/82 (removed 13) transitions.
[2023-03-19 11:19:12] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
Normalized transition count is 59 out of 60 initially.
// Phase 1: matrix 59 rows 58 cols
[2023-03-19 11:19:12] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 11:19:12] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-19 11:19:12] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2023-03-19 11:19:12] [INFO ] Invariant cache hit.
[2023-03-19 11:19:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 11:19:12] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-19 11:19:12] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2023-03-19 11:19:12] [INFO ] Invariant cache hit.
[2023-03-19 11:19:12] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/98 places, 69/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 58/98 places, 69/82 transitions.
Support contains 33 out of 58 places after structural reductions.
[2023-03-19 11:19:12] [INFO ] Flatten gal took : 28 ms
[2023-03-19 11:19:13] [INFO ] Flatten gal took : 11 ms
[2023-03-19 11:19:13] [INFO ] Input system was already deterministic with 69 transitions.
Finished random walk after 281 steps, including 0 resets, run visited all 23 properties in 48 ms. (steps per millisecond=5 )
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 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 41 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 38 transition count 53
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 23 place count 28 transition count 43
Iterating global reduction 1 with 10 rules applied. Total rules applied 33 place count 28 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 28 transition count 42
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 20 transition count 34
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 20 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 20 transition count 32
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 58 place count 14 transition count 26
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 14 transition count 26
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 70 place count 14 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 13 vertex of which 12 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 4 with 2 rules applied. Total rules applied 74 place count 12 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 77 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 79 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 80 place count 10 transition count 13
Applied a total of 80 rules in 41 ms. Remains 10 /58 variables (removed 48) and now considering 13/69 (removed 56) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-19 11:19:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 11:19:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 11:19:13] [INFO ] Invariant cache hit.
[2023-03-19 11:19:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 11:19:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 11:19:13] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-19 11:19:13] [INFO ] Invariant cache hit.
[2023-03-19 11:19:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/58 places, 13/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 10/58 places, 13/69 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s6)], 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 1 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-02 finished in 437 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 U X(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 47 transition count 59
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 38 transition count 50
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 38 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 38 transition count 49
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 48 place count 30 transition count 41
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 30 transition count 39
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 25 transition count 34
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 25 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 73 place count 25 transition count 29
Applied a total of 73 rules in 12 ms. Remains 25 /58 variables (removed 33) and now considering 29/69 (removed 40) transitions.
[2023-03-19 11:19:13] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 25 cols
[2023-03-19 11:19:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 11:19:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 11:19:13] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2023-03-19 11:19:13] [INFO ] Invariant cache hit.
[2023-03-19 11:19:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-19 11:19:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-19 11:19:13] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2023-03-19 11:19:13] [INFO ] Invariant cache hit.
[2023-03-19 11:19:14] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/58 places, 29/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 25/58 places, 29/69 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s23 s20), p1:(GT 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 129 steps with 49 reset in 4 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-03 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 43 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 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 40 transition count 55
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 21 place count 30 transition count 45
Iterating global reduction 1 with 10 rules applied. Total rules applied 31 place count 30 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 30 transition count 44
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 22 transition count 36
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 22 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 22 transition count 34
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 56 place count 16 transition count 28
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 16 transition count 28
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 68 place count 16 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 15 vertex of which 14 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 72 place count 14 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 76 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 77 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 78 place count 12 transition count 15
Applied a total of 78 rules in 13 ms. Remains 12 /58 variables (removed 46) and now considering 15/69 (removed 54) transitions.
// Phase 1: matrix 15 rows 12 cols
[2023-03-19 11:19:14] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 11:19:14] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 11:19:14] [INFO ] Invariant cache hit.
[2023-03-19 11:19:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 11:19:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 11:19:14] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-19 11:19:14] [INFO ] Invariant cache hit.
[2023-03-19 11:19:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/58 places, 15/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 12/58 places, 15/69 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s9), p1:(GT s1 s2)], nbAcceptance=2, 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 1 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-04 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F(p1)&&(p2 U p3))))'
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 47 transition count 59
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 41 transition count 53
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 41 transition count 53
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 35 transition count 47
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 35 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 35 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 32 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 32 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 32 transition count 39
Applied a total of 56 rules in 8 ms. Remains 32 /58 variables (removed 26) and now considering 39/69 (removed 30) transitions.
[2023-03-19 11:19:14] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
// Phase 1: matrix 35 rows 32 cols
[2023-03-19 11:19:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 11:19:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 11:19:14] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2023-03-19 11:19:14] [INFO ] Invariant cache hit.
[2023-03-19 11:19:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-19 11:19:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 11:19:14] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2023-03-19 11:19:14] [INFO ] Invariant cache hit.
[2023-03-19 11:19:14] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/58 places, 39/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 32/58 places, 39/69 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ s28 s13), p2:(LEQ 3 s25), p1:(LEQ 1 s31), p0:(LEQ s15 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-05 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 45 transition count 57
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 37 transition count 49
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 37 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 37 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 31 transition count 42
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 31 transition count 42
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 31 transition count 40
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 28 transition count 37
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 28 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 28 transition count 34
Applied a total of 65 rules in 5 ms. Remains 28 /58 variables (removed 30) and now considering 34/69 (removed 35) transitions.
[2023-03-19 11:19:14] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 11:19:14] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-19 11:19:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 11:19:14] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2023-03-19 11:19:14] [INFO ] Invariant cache hit.
[2023-03-19 11:19:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-19 11:19:14] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-19 11:19:14] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2023-03-19 11:19:14] [INFO ] Invariant cache hit.
[2023-03-19 11:19:15] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/58 places, 34/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 28/58 places, 34/69 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s7 s26), p1:(LEQ s8 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-07 finished in 1042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 42 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 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 39 transition count 54
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 22 place count 29 transition count 44
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 29 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 29 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 42 place count 20 transition count 34
Iterating global reduction 2 with 9 rules applied. Total rules applied 51 place count 20 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 20 transition count 32
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 60 place count 13 transition count 25
Iterating global reduction 3 with 7 rules applied. Total rules applied 67 place count 13 transition count 25
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 74 place count 13 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 21 edges and 12 vertex of which 11 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 78 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 9 transition count 12
Applied a total of 83 rules in 17 ms. Remains 9 /58 variables (removed 49) and now considering 12/69 (removed 57) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-19 11:19:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 11:19:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 11:19:15] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 11:19:16] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/58 places, 12/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 9/58 places, 12/69 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s4)], 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-S064P09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-08 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(p2)&&p1)))))'
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 43 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 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 40 transition count 55
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 33 transition count 48
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 33 transition count 48
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 33 transition count 47
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 28 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 28 transition count 42
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 25 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 25 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 25 transition count 36
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 44 edges and 24 vertex of which 23 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 50 place count 23 transition count 32
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 54 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 55 place count 22 transition count 28
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 58 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 21 transition count 25
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 21 transition count 24
Applied a total of 60 rules in 18 ms. Remains 21 /58 variables (removed 37) and now considering 24/69 (removed 45) transitions.
// Phase 1: matrix 24 rows 21 cols
[2023-03-19 11:19:16] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-19 11:19:16] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/58 places, 24/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 21/58 places, 24/69 transitions.
Stuttering acceptance computed with spot in 138 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))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s5 s8) (OR (LEQ 3 s2) (LEQ s3 s19))), p0:(AND (LEQ s5 s8) (OR (LEQ 3 s2) (LEQ s3 s19)) (OR (LEQ s9 s1) (LEQ 3 s2))), p2:(GT s13 s4)], 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 397 steps with 0 reset in 3 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-09 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 41 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 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 38 transition count 53
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 31 transition count 46
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 31 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 31 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 25 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 25 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 25 transition count 38
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 46 place count 20 transition count 33
Iterating global reduction 3 with 5 rules applied. Total rules applied 51 place count 20 transition count 33
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 56 place count 20 transition count 28
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 35 edges and 19 vertex of which 18 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 62 place count 18 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 65 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 67 place count 16 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 68 place count 16 transition count 19
Applied a total of 68 rules in 11 ms. Remains 16 /58 variables (removed 42) and now considering 19/69 (removed 50) transitions.
// Phase 1: matrix 19 rows 16 cols
[2023-03-19 11:19:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 11:19:16] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/58 places, 19/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 16/58 places, 19/69 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s13 s6), p1:(GT 1 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-10 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F((!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 46 transition count 58
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 38 transition count 50
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 38 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 38 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 31 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 31 transition count 42
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 31 transition count 40
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 28 transition count 37
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 28 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 28 transition count 34
Applied a total of 65 rules in 4 ms. Remains 28 /58 variables (removed 30) and now considering 34/69 (removed 35) transitions.
[2023-03-19 11:19:16] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 11:19:16] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 11:19:16] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-19 11:19:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-19 11:19:16] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2023-03-19 11:19:16] [INFO ] Invariant cache hit.
[2023-03-19 11:19:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/58 places, 34/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 28/58 places, 34/69 transitions.
Stuttering acceptance computed with spot in 184 ms :[p0, p0, true, (AND p0 (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 3 s15) (LEQ s27 s6)), p2:(AND (GT 3 s15) (NOT (OR (LEQ 3 s15) (LEQ 3 s16)))), p1:(OR (LEQ 3 s15) (LEQ 3 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-11 finished in 658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 42 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 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 39 transition count 54
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 22 place count 29 transition count 44
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 29 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 29 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 42 place count 20 transition count 34
Iterating global reduction 2 with 9 rules applied. Total rules applied 51 place count 20 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 20 transition count 32
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 60 place count 13 transition count 25
Iterating global reduction 3 with 7 rules applied. Total rules applied 67 place count 13 transition count 25
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 74 place count 13 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 21 edges and 12 vertex of which 11 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 78 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 9 transition count 12
Applied a total of 83 rules in 16 ms. Remains 9 /58 variables (removed 49) and now considering 12/69 (removed 57) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-19 11:19:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 11:19:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 11:19:17] [INFO ] Invariant cache hit.
[2023-03-19 11:19:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 11:19:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 11:19:17] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 11:19:17] [INFO ] Invariant cache hit.
[2023-03-19 11:19:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/58 places, 12/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 9/58 places, 12/69 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-12 finished in 210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 69/69 transitions.
Graph (complete) has 108 edges and 58 vertex of which 42 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 39 transition count 55
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 20 place count 30 transition count 46
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 30 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 30 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 37 place count 23 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 23 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 23 transition count 36
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 51 place count 18 transition count 31
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 18 transition count 31
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 61 place count 18 transition count 26
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 30 edges and 17 vertex of which 16 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 66 place count 16 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 15 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 71 place count 14 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 72 place count 14 transition count 18
Applied a total of 72 rules in 9 ms. Remains 14 /58 variables (removed 44) and now considering 18/69 (removed 51) transitions.
Normalized transition count is 17 out of 18 initially.
// Phase 1: matrix 17 rows 14 cols
[2023-03-19 11:19:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 11:19:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 11:19:17] [INFO ] Invariant cache hit.
[2023-03-19 11:19:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 11:19:17] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 11:19:17] [INFO ] Redundant transitions in 20 ms returned [4]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 17 rows 14 cols
[2023-03-19 11:19:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 11:19:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/58 places, 17/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 14/58 places, 17/69 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s10 s5), p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-13 finished in 231 ms.
All properties solved by simple procedures.
Total runtime 6080 ms.
ITS solved all properties within timeout

BK_STOP 1679224758713

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S064P09"
export BK_EXAMINATION="LTLCardinality"
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-S064P09, 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 r361-smll-167891811300347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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