Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 10:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:17 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 96K 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-S064P06-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679071985024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 16:53:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 16:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 16:53:08] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-17 16:53:08] [INFO ] Transformed 97 places.
[2023-03-17 16:53:08] [INFO ] Transformed 164 transitions.
[2023-03-17 16:53:08] [INFO ] Parsed PT model containing 97 places and 164 transitions and 661 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 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-S064P06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 82/82 transitions.
Ensure Unique test removed 13 places
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 48 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 43 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 43 transition count 55
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 41 transition count 53
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 41 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 41 transition count 51
Applied a total of 85 rules in 35 ms. Remains 41 /95 variables (removed 54) and now considering 51/82 (removed 31) transitions.
[2023-03-17 16:53:09] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
// Phase 1: matrix 44 rows 41 cols
[2023-03-17 16:53:09] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-17 16:53:09] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-17 16:53:09] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
[2023-03-17 16:53:09] [INFO ] Invariant cache hit.
[2023-03-17 16:53:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 16:53:09] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-17 16:53:09] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
[2023-03-17 16:53:09] [INFO ] Invariant cache hit.
[2023-03-17 16:53:09] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/95 places, 51/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 41/95 places, 51/82 transitions.
Support contains 29 out of 41 places after structural reductions.
[2023-03-17 16:53:09] [INFO ] Flatten gal took : 26 ms
[2023-03-17 16:53:09] [INFO ] Flatten gal took : 9 ms
[2023-03-17 16:53:09] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 28 out of 41 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 16:53:10] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
[2023-03-17 16:53:10] [INFO ] Invariant cache hit.
[2023-03-17 16:53:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 16:53:10] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)) U !p0))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Graph (complete) has 62 edges and 41 vertex of which 23 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 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 22 transition count 35
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 15 transition count 28
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 15 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 15 transition count 25
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 11 transition count 21
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 11 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 42 place count 11 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 17 edges and 10 vertex of which 9 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 46 place count 9 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 49 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 8 transition count 11
Applied a total of 50 rules in 17 ms. Remains 8 /41 variables (removed 33) and now considering 11/51 (removed 40) transitions.
// Phase 1: matrix 11 rows 8 cols
[2023-03-17 16:53:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 16:53:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 16:53:10] [INFO ] Invariant cache hit.
[2023-03-17 16:53:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 16:53:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-17 16:53:11] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-17 16:53:11] [INFO ] Invariant cache hit.
[2023-03-17 16:53:11] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/41 places, 11/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 8/41 places, 11/51 transitions.
Stuttering acceptance computed with spot in 430 ms :[p0, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-01 finished in 710 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((F(p0)&&X(p1))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 29 transition count 39
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 24 transition count 34
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 24 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 24 transition count 32
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 21 transition count 29
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 21 transition count 29
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 21 transition count 26
Applied a total of 45 rules in 6 ms. Remains 21 /41 variables (removed 20) and now considering 26/51 (removed 25) transitions.
[2023-03-17 16:53:11] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 21 cols
[2023-03-17 16:53:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 16:53:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-17 16:53:11] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2023-03-17 16:53:11] [INFO ] Invariant cache hit.
[2023-03-17 16:53:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 16:53:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-17 16:53:11] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2023-03-17 16:53:11] [INFO ] Invariant cache hit.
[2023-03-17 16:53:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/41 places, 26/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 21/41 places, 26/51 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s20), p1:(LEQ 3 s14)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-03 finished in 558 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((G(p0)||G(!p0)||(!p0&&F(p1))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Graph (complete) has 62 edges and 41 vertex of which 22 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 21 transition count 34
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 16 transition count 29
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 16 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 16 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 15 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 15 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 15 transition count 24
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 25 edges and 14 vertex of which 13 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 3 with 2 rules applied. Total rules applied 36 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 12 transition count 18
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 39 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 41 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 42 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 43 place count 11 transition count 14
Applied a total of 43 rules in 30 ms. Remains 11 /41 variables (removed 30) and now considering 14/51 (removed 37) transitions.
// Phase 1: matrix 14 rows 11 cols
[2023-03-17 16:53:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 16:53:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-17 16:53:12] [INFO ] Invariant cache hit.
[2023-03-17 16:53:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-17 16:53:12] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-17 16:53:12] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-17 16:53:12] [INFO ] Invariant cache hit.
[2023-03-17 16:53:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/41 places, 14/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 11/41 places, 14/51 transitions.
Stuttering acceptance computed with spot in 113 ms :[false, false]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s3), p0:(LEQ s1 s4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 465 ms.
Product exploration explored 100000 steps with 0 reset in 342 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[false, false]
Finished random walk after 43 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 391 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[false, false]
Stuttering acceptance computed with spot in 140 ms :[false, false]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-17 16:53:14] [INFO ] Invariant cache hit.
[2023-03-17 16:53:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 16:53:14] [INFO ] Invariant cache hit.
[2023-03-17 16:53:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-17 16:53:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-17 16:53:14] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-17 16:53:14] [INFO ] Invariant cache hit.
[2023-03-17 16:53:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 11/11 places, 14/14 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[false, false]
Finished random walk after 6736 steps, including 2 resets, run visited all 3 properties in 300 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[false, false]
Stuttering acceptance computed with spot in 72 ms :[false, false]
Stuttering acceptance computed with spot in 85 ms :[false, false]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-17 16:53:16] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-17 16:53:16] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 11/11 places, 14/14 transitions.
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-04 finished in 4091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 29 transition count 39
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 23 transition count 33
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 23 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 23 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 20 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 20 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 20 transition count 24
Applied a total of 48 rules in 5 ms. Remains 20 /41 variables (removed 21) and now considering 24/51 (removed 27) transitions.
[2023-03-17 16:53:16] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 20 cols
[2023-03-17 16:53:16] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 16:53:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 16:53:16] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-17 16:53:16] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-17 16:53:16] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/41 places, 24/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 20/41 places, 24/51 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s14 s8), p1:(GT 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-06 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' '!(X((p0||G(p1)||X((p2||X(!p0)||G(!p2))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 28 transition count 38
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 24 transition count 34
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 24 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 23 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 23 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 23 transition count 29
Applied a total of 40 rules in 5 ms. Remains 23 /41 variables (removed 18) and now considering 29/51 (removed 22) transitions.
[2023-03-17 16:53:16] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 23 cols
[2023-03-17 16:53:16] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 16:53:16] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 16:53:16] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-17 16:53:16] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-17 16:53:16] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-17 16:53:16] [INFO ] Invariant cache hit.
[2023-03-17 16:53:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/41 places, 29/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 23/41 places, 29/51 transitions.
Stuttering acceptance computed with spot in 399 ms :[true, false, false, p2, (AND p2 p0), (AND p2 (NOT p1)), (AND p2 (NOT p1) p0), (NOT p1), false, false]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 9}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 6}]], initial=1, aps=[p0:(LEQ 2 s15), p1:(LEQ 2 s9), p2:(GT 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Product exploration explored 100000 steps with 33333 reset in 209 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-07 finished in 1169 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||(p1 U p2)))))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Graph (complete) has 62 edges and 41 vertex of which 25 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
Reduce places removed 1 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 24 transition count 37
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 18 transition count 31
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 18 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 18 transition count 29
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 13 transition count 24
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 13 transition count 24
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 40 place count 13 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 17 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 3 with 2 rules applied. Total rules applied 44 place count 11 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 10 transition count 13
Applied a total of 48 rules in 16 ms. Remains 10 /41 variables (removed 31) and now considering 13/51 (removed 38) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-17 16:53:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 16:53:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 16:53:17] [INFO ] Invariant cache hit.
[2023-03-17 16:53:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 16:53:17] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-17 16:53:17] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-17 16:53:17] [INFO ] Invariant cache hit.
[2023-03-17 16:53:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/41 places, 13/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 10/41 places, 13/51 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s9 s6) (LEQ 3 s5)), p2:(LEQ 3 s1), p1:(LEQ s9 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-08 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 28 transition count 38
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 23 transition count 33
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 23 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 22 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 22 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 22 transition count 28
Applied a total of 42 rules in 7 ms. Remains 22 /41 variables (removed 19) and now considering 28/51 (removed 23) transitions.
[2023-03-17 16:53:17] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 22 cols
[2023-03-17 16:53:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 16:53:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 16:53:17] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2023-03-17 16:53:17] [INFO ] Invariant cache hit.
[2023-03-17 16:53:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-17 16:53:18] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-17 16:53:18] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2023-03-17 16:53:18] [INFO ] Invariant cache hit.
[2023-03-17 16:53:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/41 places, 28/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 22/41 places, 28/51 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GT 2 s15) (GT 1 s6)), p0:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 6 factoid took 202 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-S064P06-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-11 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 29 transition count 39
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 23 transition count 33
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 23 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 23 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 20 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 20 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 20 transition count 24
Applied a total of 48 rules in 4 ms. Remains 20 /41 variables (removed 21) and now considering 24/51 (removed 27) transitions.
[2023-03-17 16:53:18] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 20 cols
[2023-03-17 16:53:18] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 16:53:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 16:53:18] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2023-03-17 16:53:18] [INFO ] Invariant cache hit.
[2023-03-17 16:53:18] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-17 16:53:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-17 16:53:18] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2023-03-17 16:53:18] [INFO ] Invariant cache hit.
[2023-03-17 16:53:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/41 places, 24/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 20/41 places, 24/51 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s17 s3)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-12 finished in 390 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 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Graph (complete) has 62 edges and 41 vertex of which 22 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 21 transition count 34
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 15 transition count 28
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 15 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 15 transition count 26
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 10 transition count 21
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 10 transition count 21
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 10 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 17 edges and 9 vertex of which 8 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 47 place count 8 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 7 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 7 transition count 10
Applied a total of 51 rules in 8 ms. Remains 7 /41 variables (removed 34) and now considering 10/51 (removed 41) transitions.
// Phase 1: matrix 10 rows 7 cols
[2023-03-17 16:53:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 16:53:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 16:53:18] [INFO ] Invariant cache hit.
[2023-03-17 16:53:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 16:53:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 16:53:19] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 16:53:19] [INFO ] Invariant cache hit.
[2023-03-17 16:53:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/41 places, 10/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 7/41 places, 10/51 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-13 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 s1), p1:(LEQ 2 s4)], 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 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-13 finished in 160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Graph (complete) has 62 edges and 41 vertex of which 24 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
Reduce places removed 1 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 23 transition count 36
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 16 transition count 29
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 16 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 16 transition count 26
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 12 transition count 22
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 12 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 12 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 17 edges and 11 vertex of which 10 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 3 with 2 rules applied. Total rules applied 45 place count 10 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 9 transition count 12
Applied a total of 49 rules in 16 ms. Remains 9 /41 variables (removed 32) and now considering 12/51 (removed 39) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-17 16:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 16:53:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 16:53:19] [INFO ] Invariant cache hit.
[2023-03-17 16:53:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 16:53:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 16:53:19] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 16:53:19] [INFO ] Invariant cache hit.
[2023-03-17 16:53:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/41 places, 12/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 9/41 places, 12/51 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s6 s2), p1:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-14 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 51/51 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 32 transition count 42
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 27 transition count 37
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 27 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 27 transition count 35
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 25 transition count 33
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 25 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 25 transition count 31
Applied a total of 36 rules in 6 ms. Remains 25 /41 variables (removed 16) and now considering 31/51 (removed 20) transitions.
[2023-03-17 16:53:19] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 25 cols
[2023-03-17 16:53:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 16:53:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-17 16:53:19] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2023-03-17 16:53:19] [INFO ] Invariant cache hit.
[2023-03-17 16:53:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 16:53:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-17 16:53:19] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2023-03-17 16:53:19] [INFO ] Invariant cache hit.
[2023-03-17 16:53:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/41 places, 31/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 25/41 places, 31/51 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-15 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=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GT s15 s18) (GT 3 s11) (LEQ 2 s17)), p0:(LEQ s9 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-15 finished in 325 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((G(p0)||G(!p0)||(!p0&&F(p1))))))'
[2023-03-17 16:53:19] [INFO ] Flatten gal took : 10 ms
[2023-03-17 16:53:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-17 16:53:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 51 transitions and 125 arcs took 1 ms.
Total runtime 11659 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SemanticWebServices-PT-S064P06
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality

BK_STOP 1679072015884

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SemanticWebServices-PT-S064P06-LTLCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P06-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 14/32 SemanticWebServices-PT-S064P06-LTLCardinality-04 1982013 m, 396402 m/sec, 3964024 t fired, .

Time elapsed: 5 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P06-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 27/32 SemanticWebServices-PT-S064P06-LTLCardinality-04 3876781 m, 378953 m/sec, 7753561 t fired, .

Time elapsed: 10 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for SemanticWebServices-PT-S064P06-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P06-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SemanticWebServices-PT-S064P06-LTLCardinality-04: LTL unknown AGGR


Time elapsed: 15 secs. Pages in use: 32

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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