Execution Chart

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

Trace from the execution

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

--------------------
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 1679233894160

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 13:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:51:37] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-19 13:51:37] [INFO ] Transformed 154 places.
[2023-03-19 13:51:37] [INFO ] Transformed 236 transitions.
[2023-03-19 13:51:37] [INFO ] Parsed PT model containing 154 places and 236 transitions and 1265 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 2 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 47 ms. Remains 108 /152 variables (removed 44) and now considering 99/112 (removed 13) transitions.
[2023-03-19 13:51:37] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
// Phase 1: matrix 90 rows 108 cols
[2023-03-19 13:51:37] [INFO ] Computed 21 place invariants in 9 ms
[2023-03-19 13:51:37] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-19 13:51:37] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-19 13:51:37] [INFO ] Invariant cache hit.
[2023-03-19 13:51:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-19 13:51:37] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-19 13:51:37] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-19 13:51:37] [INFO ] Invariant cache hit.
[2023-03-19 13:51:38] [INFO ] Dead Transitions using invariants and state equation in 139 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 625 ms. Remains : 108/152 places, 99/112 transitions.
Support contains 45 out of 108 places after structural reductions.
[2023-03-19 13:51:38] [INFO ] Flatten gal took : 46 ms
[2023-03-19 13:51:38] [INFO ] Flatten gal took : 26 ms
[2023-03-19 13:51:38] [INFO ] Input system was already deterministic with 99 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:51:38] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-19 13:51:38] [INFO ] Invariant cache hit.
[2023-03-19 13:51:38] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-19 13:51:39] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 13:51:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-19 13:51:39] [INFO ] After 27ms SMT Verify possible using 80 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-19 13:51:39] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 13:51:39] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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.1 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 9 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 9 ms. Remains : 11/108 places, 10/99 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 409 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=204 )
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.2 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 27 ms. Remains 71 /108 variables (removed 37) and now considering 79/99 (removed 20) transitions.
[2023-03-19 13:51:39] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 71 cols
[2023-03-19 13:51:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 13:51:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 13:51:39] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-19 13:51:39] [INFO ] Invariant cache hit.
[2023-03-19 13:51:39] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-19 13:51:39] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-19 13:51:39] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-19 13:51:39] [INFO ] Invariant cache hit.
[2023-03-19 13:51:39] [INFO ] Dead Transitions using invariants and state equation in 86 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 420 ms. Remains : 71/108 places, 79/99 transitions.
Stuttering acceptance computed with spot in 395 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 0 reset in 535 ms.
Product exploration explored 100000 steps with 1 reset in 481 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.2 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 114 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 214 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :2
Finished Best-First random walk after 6020 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=501 )
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 170 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 207 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 202 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-19 13:51:42] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-19 13:51:42] [INFO ] Invariant cache hit.
[2023-03-19 13:51:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 13:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 13:51:42] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-19 13:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 13:51:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 13:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 13:51:42] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-19 13:51:42] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-19 13:51:42] [INFO ] [Nat]Added 62 Read/Feed constraints in 9 ms returned unsat
Proved EG (NOT p1)
[2023-03-19 13:51:42] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-19 13:51:42] [INFO ] Invariant cache hit.
[2023-03-19 13:51:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 13:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 13:51:42] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-19 13:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 13:51:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 13:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 13:51:43] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-19 13:51:43] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-19 13:51:43] [INFO ] [Nat]Added 62 Read/Feed constraints in 8 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 240 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 3752 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 20 ms. Remains 71 /108 variables (removed 37) and now considering 77/99 (removed 22) transitions.
[2023-03-19 13:51:43] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
// Phase 1: matrix 69 rows 71 cols
[2023-03-19 13:51:43] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 13:51:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 13:51:43] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
[2023-03-19 13:51:43] [INFO ] Invariant cache hit.
[2023-03-19 13:51:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-19 13:51:43] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-19 13:51:43] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
[2023-03-19 13:51:43] [INFO ] Invariant cache hit.
[2023-03-19 13:51:43] [INFO ] Dead Transitions using invariants and state equation in 84 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 266 ms. Remains : 71/108 places, 77/99 transitions.
Stuttering acceptance computed with spot in 454 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 747 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 16 ms. Remains 74 /108 variables (removed 34) and now considering 82/99 (removed 17) transitions.
[2023-03-19 13:51:44] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 74 cols
[2023-03-19 13:51:44] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-19 13:51:44] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-19 13:51:44] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-19 13:51:44] [INFO ] Invariant cache hit.
[2023-03-19 13:51:44] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-19 13:51:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-19 13:51:44] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-19 13:51:44] [INFO ] Invariant cache hit.
[2023-03-19 13:51:44] [INFO ] Dead Transitions using invariants and state equation in 70 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 344 ms. Remains : 74/108 places, 82/99 transitions.
Stuttering acceptance computed with spot in 133 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 494 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.1 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 40 ms. Remains 57 /108 variables (removed 51) and now considering 68/99 (removed 31) transitions.
[2023-03-19 13:51:44] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
// Phase 1: matrix 58 rows 57 cols
[2023-03-19 13:51:44] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-19 13:51:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 13:51:44] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
[2023-03-19 13:51:44] [INFO ] Invariant cache hit.
[2023-03-19 13:51:44] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-19 13:51:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-19 13:51:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:51:44] [INFO ] Flow matrix only has 58 transitions (discarded 10 similar events)
[2023-03-19 13:51:44] [INFO ] Invariant cache hit.
[2023-03-19 13:51:44] [INFO ] Dead Transitions using invariants and state equation in 110 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 289 ms. Remains : 57/108 places, 68/99 transitions.
Stuttering acceptance computed with spot in 231 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]]
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-05 finished in 553 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 13 ms. Remains 66 /108 variables (removed 42) and now considering 73/99 (removed 26) transitions.
[2023-03-19 13:51:45] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
// Phase 1: matrix 65 rows 66 cols
[2023-03-19 13:51:45] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 13:51:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 13:51:45] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:45] [INFO ] Invariant cache hit.
[2023-03-19 13:51:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-19 13:51:45] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-19 13:51:45] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:45] [INFO ] Invariant cache hit.
[2023-03-19 13:51:45] [INFO ] Dead Transitions using invariants and state equation in 77 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 232 ms. Remains : 66/108 places, 73/99 transitions.
Stuttering acceptance computed with spot in 197 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 1 reset in 464 ms.
Product exploration explored 100000 steps with 0 reset in 596 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.2 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 p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 385 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 197 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 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
Finished Best-First random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 506 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 195 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 316 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 0 ms. Remains 66 /66 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-19 13:51:48] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:48] [INFO ] Invariant cache hit.
[2023-03-19 13:51:48] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 13:51:48] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:48] [INFO ] Invariant cache hit.
[2023-03-19 13:51:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-19 13:51:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-19 13:51:48] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:48] [INFO ] Invariant cache hit.
[2023-03-19 13:51:48] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 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 p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 388 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 201 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 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :4
Finished Best-First random walk after 3472 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=578 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 513 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 191 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 193 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 191 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Product exploration explored 100000 steps with 1 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 350 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 191 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.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 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 22 ms. Remains 54 /66 variables (removed 12) and now considering 64/73 (removed 9) transitions.
[2023-03-19 13:51:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 54 cols
[2023-03-19 13:51:51] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 13:51:51] [INFO ] Dead Transitions using invariants and state equation in 66 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 100 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 1 ms. Remains 66 /66 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
// Phase 1: matrix 65 rows 66 cols
[2023-03-19 13:51:51] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 13:51:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:51] [INFO ] Invariant cache hit.
[2023-03-19 13:51:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-19 13:51:51] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2023-03-19 13:51:51] [INFO ] Invariant cache hit.
[2023-03-19 13:51:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 66/66 places, 73/73 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-07 finished in 6412 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 23 ms. Remains 51 /108 variables (removed 57) and now considering 62/99 (removed 37) transitions.
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 51 cols
[2023-03-19 13:51:51] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-19 13:51:51] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2023-03-19 13:51:51] [INFO ] Invariant cache hit.
[2023-03-19 13:51:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-19 13:51:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-19 13:51:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2023-03-19 13:51:51] [INFO ] Invariant cache hit.
[2023-03-19 13:51:51] [INFO ] Dead Transitions using invariants and state equation in 57 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 357 ms. Remains : 51/108 places, 62/99 transitions.
Stuttering acceptance computed with spot in 73 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]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-08 finished in 444 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.1 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 35 ms. Remains 61 /108 variables (removed 47) and now considering 71/99 (removed 28) transitions.
[2023-03-19 13:51:51] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 61 cols
[2023-03-19 13:51:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 13:51:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 13:51:52] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-19 13:51:52] [INFO ] Invariant cache hit.
[2023-03-19 13:51:52] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-19 13:51:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-19 13:51:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:52] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-19 13:51:52] [INFO ] Invariant cache hit.
[2023-03-19 13:51:52] [INFO ] Dead Transitions using invariants and state equation in 64 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 313 ms. Remains : 61/108 places, 71/99 transitions.
Stuttering acceptance computed with spot in 42 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]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-10 finished in 379 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 13 ms. Remains 68 /108 variables (removed 40) and now considering 77/99 (removed 22) transitions.
[2023-03-19 13:51:52] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 68 cols
[2023-03-19 13:51:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 13:51:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 13:51:52] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 13:51:52] [INFO ] Invariant cache hit.
[2023-03-19 13:51:52] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:52] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-19 13:51:52] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 13:51:52] [INFO ] Invariant cache hit.
[2023-03-19 13:51:52] [INFO ] Dead Transitions using invariants and state equation in 74 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 262 ms. Remains : 68/108 places, 77/99 transitions.
Stuttering acceptance computed with spot in 198 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 165 ms.
Product exploration explored 100000 steps with 33333 reset in 137 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.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 169 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 949 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.1 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 17 ms. Remains 53 /108 variables (removed 55) and now considering 64/99 (removed 35) transitions.
[2023-03-19 13:51:53] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 53 cols
[2023-03-19 13:51:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 13:51:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 13:51:53] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:53] [INFO ] Invariant cache hit.
[2023-03-19 13:51:53] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 13:51:53] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-19 13:51:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:53] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:53] [INFO ] Invariant cache hit.
[2023-03-19 13:51:53] [INFO ] Dead Transitions using invariants and state equation in 58 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 217 ms. Remains : 53/108 places, 64/99 transitions.
Stuttering acceptance computed with spot in 76 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 205 ms.
Product exploration explored 100000 steps with 0 reset in 445 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished Best-First random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-19 13:51:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:54] [INFO ] Invariant cache hit.
[2023-03-19 13:51:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 13:51:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:54] [INFO ] Invariant cache hit.
[2023-03-19 13:51:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 13:51:54] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-19 13:51:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:54] [INFO ] Invariant cache hit.
[2023-03-19 13:51:54] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 53/53 places, 64/64 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished Best-First random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 321 ms.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:56] [INFO ] Invariant cache hit.
[2023-03-19 13:51:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:56] [INFO ] Invariant cache hit.
[2023-03-19 13:51:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 13:51:56] [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-19 13:51:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:56] [INFO ] Invariant cache hit.
[2023-03-19 13:51:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 53/53 places, 64/64 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-12 finished in 3132 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 19 ms. Remains 53 /108 variables (removed 55) and now considering 64/99 (removed 35) transitions.
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 53 cols
[2023-03-19 13:51:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 13:51:56] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:56] [INFO ] Invariant cache hit.
[2023-03-19 13:51:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-19 13:51:56] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-19 13:51:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2023-03-19 13:51:56] [INFO ] Invariant cache hit.
[2023-03-19 13:51:56] [INFO ] Dead Transitions using invariants and state equation in 58 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 415 ms. Remains : 53/108 places, 64/99 transitions.
Stuttering acceptance computed with spot in 111 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 123 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 544 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 10 ms. Remains 69 /108 variables (removed 39) and now considering 76/99 (removed 23) transitions.
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 69 cols
[2023-03-19 13:51:56] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 13:51:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 13:51:56] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:56] [INFO ] Invariant cache hit.
[2023-03-19 13:51:57] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-19 13:51:57] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:57] [INFO ] Invariant cache hit.
[2023-03-19 13:51:57] [INFO ] Dead Transitions using invariants and state equation in 68 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 182 ms. Remains : 69/108 places, 76/99 transitions.
Stuttering acceptance computed with spot in 239 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 111 ms.
Product exploration explored 100000 steps with 25000 reset in 118 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 95 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 193 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 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:51:57] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:57] [INFO ] Invariant cache hit.
[2023-03-19 13:51:57] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 13:51:58] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 13:51:58] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:58] [INFO ] After 18ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-19 13:51:58] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 13:51:58] [INFO ] After 119ms 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 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.1 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 11 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 11 ms. Remains : 10/69 places, 8/76 transitions.
Finished random walk after 3353 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=479 )
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 275 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 223 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 206 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-19 13:51:58] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:58] [INFO ] Invariant cache hit.
[2023-03-19 13:51:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 13:51:58] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:58] [INFO ] Invariant cache hit.
[2023-03-19 13:51:58] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 13:51:58] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:58] [INFO ] Invariant cache hit.
[2023-03-19 13:51:58] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 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.1 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 89 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 194 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 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:51:59] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:51:59] [INFO ] Invariant cache hit.
[2023-03-19 13:51:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 13:51:59] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 13:51:59] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:59] [INFO ] After 27ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-19 13:51:59] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 13:51:59] [INFO ] After 129ms 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 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 2 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 2 ms. Remains : 10/69 places, 8/76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished Best-First random walk after 214 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=214 )
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 335 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 211 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 204 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 195 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 111 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 192 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.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 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 12 ms. Remains 56 /69 variables (removed 13) and now considering 66/76 (removed 10) transitions.
[2023-03-19 13:52:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:52:01] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 56 cols
[2023-03-19 13:52:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 13:52:01] [INFO ] Dead Transitions using invariants and state equation in 63 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 84 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-19 13:52:01] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 69 cols
[2023-03-19 13:52:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 13:52:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 13:52:01] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:52:01] [INFO ] Invariant cache hit.
[2023-03-19 13:52:01] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:52:01] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-19 13:52:01] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2023-03-19 13:52:01] [INFO ] Invariant cache hit.
[2023-03-19 13:52:01] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 69/69 places, 76/76 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-14 finished in 4365 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 4 ms. Remains 72 /108 variables (removed 36) and now considering 79/99 (removed 20) transitions.
[2023-03-19 13:52:01] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 72 cols
[2023-03-19 13:52:01] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 13:52:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 13:52:01] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-19 13:52:01] [INFO ] Invariant cache hit.
[2023-03-19 13:52:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-19 13:52:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 13:52:01] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-19 13:52:01] [INFO ] Invariant cache hit.
[2023-03-19 13:52:01] [INFO ] Dead Transitions using invariants and state equation in 63 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 182 ms. Remains : 72/108 places, 79/99 transitions.
Stuttering acceptance computed with spot in 260 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 122 steps with 44 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-15 finished in 467 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 185 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 10 ms. Remains 53 /108 variables (removed 55) and now considering 63/99 (removed 36) transitions.
[2023-03-19 13:52:02] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
// Phase 1: matrix 54 rows 53 cols
[2023-03-19 13:52:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 13:52:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 13:52:02] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2023-03-19 13:52:02] [INFO ] Invariant cache hit.
[2023-03-19 13:52:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-19 13:52:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 13:52:02] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2023-03-19 13:52:02] [INFO ] Invariant cache hit.
[2023-03-19 13:52:02] [INFO ] Dead Transitions using invariants and state equation in 51 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 146 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 76 steps with 0 reset in 0 ms.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-07 finished in 442 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' '!(G(F(p0)))'
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-19 13:52:02] [INFO ] Flatten gal took : 9 ms
[2023-03-19 13:52:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 13:52:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 99 transitions and 363 arcs took 2 ms.
Total runtime 25501 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1744/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1744/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1744/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SemanticWebServices-PT-S064P18-LTLFireability-07
Could not compute solution for formula : SemanticWebServices-PT-S064P18-LTLFireability-12
Could not compute solution for formula : SemanticWebServices-PT-S064P18-LTLFireability-14

BK_STOP 1679233923790

--------------------
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
mcc2023
ltl formula name SemanticWebServices-PT-S064P18-LTLFireability-07
ltl formula formula --ltl=/tmp/1744/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 99 transitions and 363 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1744/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1744/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1744/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1744/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name SemanticWebServices-PT-S064P18-LTLFireability-12
ltl formula formula --ltl=/tmp/1744/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 99 transitions and 363 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1744/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1744/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1744/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1744/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name SemanticWebServices-PT-S064P18-LTLFireability-14
ltl formula formula --ltl=/tmp/1744/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 99 transitions and 363 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1744/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1744/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1744/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1744/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e1768693f4]
1: pnml2lts-mc(+0xa2496) [0x55e176869496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f6b24b10140]
3: pnml2lts-mc(+0x405be5) [0x55e176bccbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55e1769323f9]
5: pnml2lts-mc(+0x164ac4) [0x55e17692bac4]
6: pnml2lts-mc(+0x272e0a) [0x55e176a39e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e17687d1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f6b249634d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f6b2496367a]
10: pnml2lts-mc(+0xa1581) [0x55e176868581]
11: pnml2lts-mc(+0xa1910) [0x55e176868910]
12: pnml2lts-mc(+0xa32a2) [0x55e17686a2a2]
13: pnml2lts-mc(+0xa50f4) [0x55e17686c0f4]
14: pnml2lts-mc(+0xa516b) [0x55e17686c16b]
15: pnml2lts-mc(+0x3f34b3) [0x55e176bba4b3]
16: pnml2lts-mc(+0x7c63d) [0x55e17684363d]
17: pnml2lts-mc(+0x67d86) [0x55e17682ed86]
18: pnml2lts-mc(+0x60a8a) [0x55e176827a8a]
19: pnml2lts-mc(+0x5eb15) [0x55e176825b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f6b2494bd0a]
21: pnml2lts-mc(+0x6075e) [0x55e17682775e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-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 r361-smll-167891811400372"
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 ;