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-167891808900372.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-S064P18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808900372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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.9K 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 173K 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-S064P18-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679083707579

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 20:08:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 20:08:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 20:08:31] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2023-03-17 20:08:31] [INFO ] Transformed 154 places.
[2023-03-17 20:08:31] [INFO ] Transformed 236 transitions.
[2023-03-17 20:08:31] [INFO ] Parsed PT model containing 154 places and 236 transitions and 1265 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 112/112 transitions.
Ensure Unique test removed 29 places
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 121 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 116 transition count 107
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 116 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 112 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 112 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 109 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 109 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 108 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 108 transition count 99
Applied a total of 57 rules in 68 ms. Remains 108 /152 variables (removed 44) and now considering 99/112 (removed 13) transitions.
[2023-03-17 20:08:31] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
// Phase 1: matrix 90 rows 108 cols
[2023-03-17 20:08:31] [INFO ] Computed 21 place invariants in 6 ms
[2023-03-17 20:08:31] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-17 20:08:31] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-17 20:08:31] [INFO ] Invariant cache hit.
[2023-03-17 20:08:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-17 20:08:32] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-17 20:08:32] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-17 20:08:32] [INFO ] Invariant cache hit.
[2023-03-17 20:08:32] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/152 places, 99/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 838 ms. Remains : 108/152 places, 99/112 transitions.
Support contains 45 out of 108 places after structural reductions.
[2023-03-17 20:08:32] [INFO ] Flatten gal took : 53 ms
[2023-03-17 20:08:32] [INFO ] Flatten gal took : 27 ms
[2023-03-17 20:08:32] [INFO ] Input system was already deterministic with 99 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=9 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2023-03-17 20:08:33] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-17 20:08:33] [INFO ] Invariant cache hit.
[2023-03-17 20:08:33] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-17 20:08:34] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 20:08:34] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-17 20:08:34] [INFO ] After 40ms SMT Verify possible using 80 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 20:08:34] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-17 20:08:34] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 146 edges and 108 vertex of which 13 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.2 ms
Discarding 95 places :
Also discarding 78 output transitions
Drop transitions removed 78 transitions
Ensure Unique test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 11 transition count 10
Applied a total of 14 rules in 12 ms. Remains 11 /108 variables (removed 97) and now considering 10/99 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 11/108 places, 10/99 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished Best-First random walk after 107 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=107 )
Computed a total of 9 stabilizing places and 11 stable transitions
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p1)&&p0))))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 19 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 89 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 83 transition count 93
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 83 transition count 93
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 83 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 79 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 79 transition count 88
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 75 transition count 84
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 75 transition count 84
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 72 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 72 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 71 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 71 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 71 transition count 79
Applied a total of 57 rules in 41 ms. Remains 71 /108 variables (removed 37) and now considering 79/99 (removed 20) transitions.
[2023-03-17 20:08:34] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 71 cols
[2023-03-17 20:08:34] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-17 20:08:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-17 20:08:34] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-17 20:08:34] [INFO ] Invariant cache hit.
[2023-03-17 20:08:34] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-17 20:08:34] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-17 20:08:34] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-17 20:08:34] [INFO ] Invariant cache hit.
[2023-03-17 20:08:34] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/108 places, 79/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 71/108 places, 79/99 transitions.
Stuttering acceptance computed with spot in 515 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s6 1) (GEQ s60 1)), p1:(GEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 574 ms.
Product exploration explored 100000 steps with 0 reset in 478 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 150 edges and 71 vertex of which 65 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
[2023-03-17 20:08:37] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-17 20:08:37] [INFO ] Invariant cache hit.
[2023-03-17 20:08:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 20:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:08:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-17 20:08:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:08:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-17 20:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:08:38] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-17 20:08:38] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-17 20:08:38] [INFO ] [Nat]Added 62 Read/Feed constraints in 12 ms returned unsat
Proved EG (NOT p1)
[2023-03-17 20:08:38] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-17 20:08:38] [INFO ] Invariant cache hit.
[2023-03-17 20:08:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 20:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:08:38] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-17 20:08:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:08:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 20:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:08:38] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-17 20:08:38] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-17 20:08:38] [INFO ] [Nat]Added 62 Read/Feed constraints in 19 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-01 finished in 4054 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 X(((G(p2) U p3)&&p1)))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 91 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 84 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 84 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 84 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 80 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 80 transition count 87
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 76 transition count 83
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 76 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 73 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 73 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 71 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 71 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 71 transition count 77
Applied a total of 59 rules in 24 ms. Remains 71 /108 variables (removed 37) and now considering 77/99 (removed 22) transitions.
[2023-03-17 20:08:38] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
// Phase 1: matrix 69 rows 71 cols
[2023-03-17 20:08:38] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 20:08:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-17 20:08:38] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
[2023-03-17 20:08:38] [INFO ] Invariant cache hit.
[2023-03-17 20:08:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 20:08:38] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-17 20:08:38] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
[2023-03-17 20:08:38] [INFO ] Invariant cache hit.
[2023-03-17 20:08:38] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/108 places, 77/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 71/108 places, 77/99 transitions.
Stuttering acceptance computed with spot in 617 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-03 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=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p3) p2)), acceptance={} source=7 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=8 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=8 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=8 dest: 7}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p3) p2)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s67 1)), p1:(AND (GEQ s8 1) (GEQ s67 1)), p3:(AND (GEQ s6 1) (GEQ s57 1)), p2:(AND (GEQ s7 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-03 finished in 947 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(p1)&&p0)))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 90 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 84 transition count 93
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 84 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 84 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 80 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 80 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 77 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 77 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 75 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 75 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 74 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 74 transition count 82
Applied a total of 51 rules in 20 ms. Remains 74 /108 variables (removed 34) and now considering 82/99 (removed 17) transitions.
[2023-03-17 20:08:39] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 74 cols
[2023-03-17 20:08:39] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-17 20:08:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 20:08:39] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-17 20:08:39] [INFO ] Invariant cache hit.
[2023-03-17 20:08:39] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-17 20:08:39] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-17 20:08:39] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-17 20:08:39] [INFO ] Invariant cache hit.
[2023-03-17 20:08:39] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/108 places, 82/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 74/108 places, 82/99 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s7 1) (GEQ s55 1)), p0:(AND (GEQ s6 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-04 finished in 430 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)&&X(G(!p1))))||(F(!p0)&&X(G(!p1))&&F(p2)))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 18 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 75 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 75 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 75 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 69 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 69 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 64 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 64 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 61 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 59 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 58 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 57 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 57 transition count 68
Applied a total of 56 rules in 33 ms. Remains 57 /108 variables (removed 51) and now considering 68/99 (removed 31) transitions.
[2023-03-17 20:08:40] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
// Phase 1: matrix 58 rows 57 cols
[2023-03-17 20:08:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 20:08:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 20:08:40] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
[2023-03-17 20:08:40] [INFO ] Invariant cache hit.
[2023-03-17 20:08:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-17 20:08:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-17 20:08:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 20:08:40] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
[2023-03-17 20:08:40] [INFO ] Invariant cache hit.
[2023-03-17 20:08:40] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/108 places, 68/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 57/108 places, 68/99 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR p0 p1), p1, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s17 1), p0:(AND (GEQ s3 1) (GEQ s44 1)), p1:(AND (GEQ s2 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 253 ms.
Stuttering criterion allowed to conclude after 205 steps with 2 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-05 finished in 701 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(F(p0)) U G((!p1&&F(!p0))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 90 transition count 99
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 82 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 82 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 82 transition count 90
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 77 transition count 85
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 77 transition count 85
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 72 transition count 80
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 72 transition count 80
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 68 transition count 76
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 68 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 66 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 73
Applied a total of 68 rules in 11 ms. Remains 66 /108 variables (removed 42) and now considering 73/99 (removed 26) transitions.
[2023-03-17 20:08:40] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
// Phase 1: matrix 65 rows 66 cols
[2023-03-17 20:08:40] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-17 20:08:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 20:08:40] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:40] [INFO ] Invariant cache hit.
[2023-03-17 20:08:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-17 20:08:40] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:40] [INFO ] Invariant cache hit.
[2023-03-17 20:08:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/108 places, 73/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 66/108 places, 73/99 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s49 1)), p0:(AND (GEQ s7 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 379 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 143 edges and 66 vertex of which 60 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 5) seen :4
Finished Best-First random walk after 104 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 502 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 255 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-17 20:08:43] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:43] [INFO ] Invariant cache hit.
[2023-03-17 20:08:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-17 20:08:43] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:43] [INFO ] Invariant cache hit.
[2023-03-17 20:08:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-17 20:08:44] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:44] [INFO ] Invariant cache hit.
[2023-03-17 20:08:44] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 66/66 places, 73/73 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 143 edges and 66 vertex of which 60 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 526 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:08:45] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:45] [INFO ] Invariant cache hit.
[2023-03-17 20:08:45] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 20:08:45] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 20:08:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:45] [INFO ] After 16ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 20:08:45] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-17 20:08:45] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 73/73 transitions.
Graph (complete) has 80 edges and 66 vertex of which 8 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 6 transition count 4
Applied a total of 14 rules in 7 ms. Remains 6 /66 variables (removed 60) and now considering 4/73 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 6/66 places, 4/73 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 690 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 272 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 343 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 2 reset in 636 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 268 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 73/73 transitions.
Graph (complete) has 143 edges and 66 vertex of which 60 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 59 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 58 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 58 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 57 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 57 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 56 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 56 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 55 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 54 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 54 transition count 64
Applied a total of 13 rules in 25 ms. Remains 54 /66 variables (removed 12) and now considering 64/73 (removed 9) transitions.
[2023-03-17 20:08:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 20:08:48] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 54 cols
[2023-03-17 20:08:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 20:08:48] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/66 places, 64/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 54/66 places, 64/73 transitions.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-17 20:08:48] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
// Phase 1: matrix 65 rows 66 cols
[2023-03-17 20:08:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 20:08:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-17 20:08:48] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:48] [INFO ] Invariant cache hit.
[2023-03-17 20:08:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:48] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-17 20:08:48] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-17 20:08:48] [INFO ] Invariant cache hit.
[2023-03-17 20:08:48] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 66/66 places, 73/73 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-07 finished in 8367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 19 places
Reduce places removed 20 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 73 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 73 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 73 transition count 85
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 67 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 67 transition count 79
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 61 transition count 73
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 61 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 56 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 56 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 53 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 53 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 53 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 52 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 52 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 51 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 51 transition count 62
Applied a total of 65 rules in 17 ms. Remains 51 /108 variables (removed 57) and now considering 62/99 (removed 37) transitions.
[2023-03-17 20:08:49] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 51 cols
[2023-03-17 20:08:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 20:08:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-17 20:08:49] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2023-03-17 20:08:49] [INFO ] Invariant cache hit.
[2023-03-17 20:08:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-17 20:08:49] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-17 20:08:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 20:08:49] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2023-03-17 20:08:49] [INFO ] Invariant cache hit.
[2023-03-17 20:08:49] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/108 places, 62/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 51/108 places, 62/99 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-08 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:(OR (LT s1 1) (LT s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 571 ms.
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-08 finished in 873 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)||G(p2))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 18 places
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 76 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 76 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 76 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 71 transition count 82
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 71 transition count 82
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 66 transition count 77
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 66 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 63 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 61 transition count 71
Applied a total of 49 rules in 25 ms. Remains 61 /108 variables (removed 47) and now considering 71/99 (removed 28) transitions.
[2023-03-17 20:08:49] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 61 cols
[2023-03-17 20:08:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 20:08:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 20:08:50] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-17 20:08:50] [INFO ] Invariant cache hit.
[2023-03-17 20:08:50] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:50] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-17 20:08:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 20:08:50] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-17 20:08:50] [INFO ] Invariant cache hit.
[2023-03-17 20:08:50] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/108 places, 71/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 61/108 places, 71/99 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s39 1) (GEQ s19 1)), p1:(AND (GEQ s3 1) (GEQ s39 1)), p2:(AND (GEQ s2 1) (GEQ s54 1))], nbAcceptance=3, 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 812 ms.
Product exploration explored 100000 steps with 0 reset in 862 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 679 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 20:08:53] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-17 20:08:53] [INFO ] Invariant cache hit.
[2023-03-17 20:08:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-17 20:08:53] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2023-03-17 20:08:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:53] [INFO ] After 15ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-17 20:08:53] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-17 20:08:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 20:08:53] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-17 20:08:53] [INFO ] After 27ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-17 20:08:53] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-17 20:08:53] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 71/71 transitions.
Graph (complete) has 70 edges and 61 vertex of which 16 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 16 transition count 14
Applied a total of 11 rules in 5 ms. Remains 16 /61 variables (removed 45) and now considering 14/71 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 16/61 places, 14/71 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Finished Best-First random walk after 314 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=314 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 19 factoid took 996 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p2))]
[2023-03-17 20:08:54] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-17 20:08:54] [INFO ] Invariant cache hit.
[2023-03-17 20:08:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 20:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:08:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-17 20:08:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:08:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 20:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:08:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-17 20:08:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 20:08:54] [INFO ] [Nat]Added 56 Read/Feed constraints in 7 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 19 factoid took 467 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-10 finished in 5368 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)||X(p1))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 19 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 89 transition count 99
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 81 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 81 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 81 transition count 90
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 76 transition count 85
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 76 transition count 85
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 72 transition count 81
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 72 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 69 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 69 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 68 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 68 transition count 77
Applied a total of 62 rules in 7 ms. Remains 68 /108 variables (removed 40) and now considering 77/99 (removed 22) transitions.
[2023-03-17 20:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 68 cols
[2023-03-17 20:08:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 20:08:55] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-17 20:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-17 20:08:55] [INFO ] Invariant cache hit.
[2023-03-17 20:08:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-17 20:08:55] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-17 20:08:55] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-17 20:08:55] [INFO ] Invariant cache hit.
[2023-03-17 20:08:55] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/108 places, 77/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 68/108 places, 77/99 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (LT s6 1) (LT s57 1)), p0:(LT s35 1)], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 145 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-11 finished in 1229 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 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 19 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 74 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 74 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 74 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 68 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 68 transition count 80
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 62 transition count 74
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 62 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 57 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 57 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 54 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 54 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 54 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 53 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 53 transition count 64
Applied a total of 63 rules in 18 ms. Remains 53 /108 variables (removed 55) and now considering 64/99 (removed 35) transitions.
[2023-03-17 20:08:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 53 cols
[2023-03-17 20:08:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 20:08:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 20:08:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-17 20:08:56] [INFO ] Invariant cache hit.
[2023-03-17 20:08:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-17 20:08:56] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-17 20:08:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 20:08:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-17 20:08:56] [INFO ] Invariant cache hit.
[2023-03-17 20:08:56] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/108 places, 64/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 53/108 places, 64/99 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-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:(OR (LT s16 1) (LT s2 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-12 finished in 573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 18 places
Reduce places removed 19 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 75 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 75 transition count 87
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 69 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 69 transition count 81
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 35 place count 63 transition count 75
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 63 transition count 75
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 46 place count 58 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 51 place count 58 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 54 place count 55 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 55 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 54 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 54 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 53 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 53 transition count 64
Applied a total of 62 rules in 27 ms. Remains 53 /108 variables (removed 55) and now considering 64/99 (removed 35) transitions.
[2023-03-17 20:08:57] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 53 cols
[2023-03-17 20:08:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 20:08:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 20:08:57] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-17 20:08:57] [INFO ] Invariant cache hit.
[2023-03-17 20:08:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-17 20:08:57] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-17 20:08:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 20:08:57] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-17 20:08:57] [INFO ] Invariant cache hit.
[2023-03-17 20:08:57] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/108 places, 64/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 53/108 places, 64/99 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s45 1)), p1:(OR (LT s2 1) (LT s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-13 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||G(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 90 transition count 99
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 82 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 82 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 82 transition count 90
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 77 transition count 85
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 77 transition count 85
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 73 transition count 81
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 73 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 70 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 70 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 69 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 69 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 69 transition count 76
Applied a total of 62 rules in 11 ms. Remains 69 /108 variables (removed 39) and now considering 76/99 (removed 23) transitions.
[2023-03-17 20:08:57] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 69 cols
[2023-03-17 20:08:57] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-17 20:08:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-17 20:08:57] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:08:57] [INFO ] Invariant cache hit.
[2023-03-17 20:08:57] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-17 20:08:57] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-17 20:08:57] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:08:57] [INFO ] Invariant cache hit.
[2023-03-17 20:08:57] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/108 places, 76/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 69/108 places, 76/99 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p0:(OR (LT s6 1) (LT s53 1)), p1:(OR (LT s7 1) (LT s63 1))], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Product exploration explored 100000 steps with 25000 reset in 230 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 149 edges and 69 vertex of which 63 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Finished Best-First random walk after 699 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=699 )
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-17 20:08:59] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:08:59] [INFO ] Invariant cache hit.
[2023-03-17 20:09:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 20:09:00] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:09:00] [INFO ] Invariant cache hit.
[2023-03-17 20:09:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-17 20:09:00] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-17 20:09:00] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:09:00] [INFO ] Invariant cache hit.
[2023-03-17 20:09:00] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 69/69 places, 76/76 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 149 edges and 69 vertex of which 63 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 20:09:00] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:09:00] [INFO ] Invariant cache hit.
[2023-03-17 20:09:00] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 20:09:00] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-17 20:09:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-17 20:09:00] [INFO ] After 16ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-17 20:09:00] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-17 20:09:00] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-17 20:09:01] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 20:09:01] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 20:09:01] [INFO ] After 24ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 20:09:01] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-17 20:09:01] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 76/76 transitions.
Graph (complete) has 83 edges and 69 vertex of which 12 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.0 ms
Discarding 57 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 12 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 10 transition count 8
Applied a total of 14 rules in 7 ms. Remains 10 /69 variables (removed 59) and now considering 8/76 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 10/69 places, 8/76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Finished Best-First random walk after 112 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 412 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 207 ms.
Product exploration explored 100000 steps with 25000 reset in 225 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 76/76 transitions.
Graph (complete) has 149 edges and 69 vertex of which 63 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 62 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 61 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 60 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 59 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 58 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 58 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 57 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 57 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 56 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 56 transition count 66
Applied a total of 15 rules in 18 ms. Remains 56 /69 variables (removed 13) and now considering 66/76 (removed 10) transitions.
[2023-03-17 20:09:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 56 cols
[2023-03-17 20:09:03] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-17 20:09:03] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/69 places, 66/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 56/69 places, 66/76 transitions.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 76/76 transitions.
Applied a total of 0 rules in 0 ms. Remains 69 /69 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 69 cols
[2023-03-17 20:09:03] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 20:09:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:09:03] [INFO ] Invariant cache hit.
[2023-03-17 20:09:03] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-17 20:09:03] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-17 20:09:03] [INFO ] Invariant cache hit.
[2023-03-17 20:09:03] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 69/69 places, 76/76 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-14 finished in 6192 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||X(!p1))) U X(p2))&&X((!p1 U (!p3||G(!p1))))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 91 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 84 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 84 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 84 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 80 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 80 transition count 87
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 76 transition count 83
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 76 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 73 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 73 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 72 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 72 transition count 79
Applied a total of 56 rules in 12 ms. Remains 72 /108 variables (removed 36) and now considering 79/99 (removed 20) transitions.
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 72 cols
[2023-03-17 20:09:03] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 20:09:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-17 20:09:03] [INFO ] Invariant cache hit.
[2023-03-17 20:09:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-17 20:09:03] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-17 20:09:03] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-17 20:09:03] [INFO ] Invariant cache hit.
[2023-03-17 20:09:03] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/108 places, 79/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 72/108 places, 79/99 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) (AND p1 p3)), (AND p1 p3), (AND p1 (NOT p3) (NOT p2)), (NOT p2), true, p1, (AND (NOT p0) p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 1}, { cond=(AND p1 p3), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(NOT p2), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s41 1), p1:(AND (GEQ s8 1) (GEQ s44 1)), p3:(AND (GEQ s6 1) (GEQ s57 1)), p2:(AND (GEQ s7 1) (GEQ s54 1))], 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 2265 steps with 792 reset in 5 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-15 finished in 689 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(F(p0)) U G((!p1&&F(!p0))))))'
Found a Lengthening insensitive property : SemanticWebServices-PT-S064P18-LTLFireability-07
Stuttering acceptance computed with spot in 271 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 291 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 18 places
Reduce places removed 19 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 74 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 74 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 74 transition count 85
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 68 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 68 transition count 79
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 62 transition count 73
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 62 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 57 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 57 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 54 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 54 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 54 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 53 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 53 transition count 63
Applied a total of 63 rules in 22 ms. Remains 53 /108 variables (removed 55) and now considering 63/99 (removed 36) transitions.
[2023-03-17 20:09:04] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
// Phase 1: matrix 54 rows 53 cols
[2023-03-17 20:09:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 20:09:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-17 20:09:04] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2023-03-17 20:09:04] [INFO ] Invariant cache hit.
[2023-03-17 20:09:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-17 20:09:04] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-17 20:09:04] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2023-03-17 20:09:04] [INFO ] Invariant cache hit.
[2023-03-17 20:09:05] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 53/108 places, 63/99 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 222 ms. Remains : 53/108 places, 63/99 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s38 1)), p0:(AND (GEQ s2 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 1 ms.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-07 finished in 664 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||G(p1)))))'
[2023-03-17 20:09:05] [INFO ] Flatten gal took : 14 ms
[2023-03-17 20:09:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 20:09:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 99 transitions and 363 arcs took 3 ms.
Total runtime 34538 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SemanticWebServices-PT-S064P18
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA SemanticWebServices-PT-S064P18-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679083756537

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
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-S064P18-LTLFireability-07
lola: time limit : 1800 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-S064P18-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
SemanticWebServices-PT-S064P18-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 19/32 SemanticWebServices-PT-S064P18-LTLFireability-07 2553538 m, 510707 m/sec, 2553538 t fired, .

Time elapsed: 5 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for SemanticWebServices-PT-S064P18-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P18-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
SemanticWebServices-PT-S064P18-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 SemanticWebServices-PT-S064P18-LTLFireability-14
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for SemanticWebServices-PT-S064P18-LTLFireability-14
lola: result : true
lola: markings : 160
lola: fired transitions : 267
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SemanticWebServices-PT-S064P18-LTLFireability-07: LTL unknown AGGR
SemanticWebServices-PT-S064P18-LTLFireability-14: LTL true LTL model checker


Time elapsed: 10 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-S064P18"
export BK_EXAMINATION="LTLFireability"
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-S064P18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891808900372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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