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.r325-tall-167889197500636.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 itstools
Input is RefineWMG-PT-050051, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197500636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 110K 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 RefineWMG-PT-050051-LTLFireability-00
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-01
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-02
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-03
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-04
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-05
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-06
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-07
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-08
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-09
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-10
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-11
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-12
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-13
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-14
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679024914801

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-050051
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 03:48:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 03:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:48:36] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-17 03:48:36] [INFO ] Transformed 254 places.
[2023-03-17 03:48:36] [INFO ] Transformed 203 transitions.
[2023-03-17 03:48:36] [INFO ] Parsed PT model containing 254 places and 203 transitions and 608 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-050051-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 27 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:48:36] [INFO ] Computed 102 place invariants in 10 ms
[2023-03-17 03:48:36] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
[2023-03-17 03:48:36] [INFO ] Invariant cache hit.
[2023-03-17 03:48:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-17 03:48:36] [INFO ] Invariant cache hit.
[2023-03-17 03:48:37] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-17 03:48:37] [INFO ] Invariant cache hit.
[2023-03-17 03:48:37] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 720 ms. Remains : 254/254 places, 203/203 transitions.
Support contains 44 out of 254 places after structural reductions.
[2023-03-17 03:48:37] [INFO ] Flatten gal took : 40 ms
[2023-03-17 03:48:37] [INFO ] Flatten gal took : 15 ms
[2023-03-17 03:48:37] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 28) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-17 03:48:37] [INFO ] Invariant cache hit.
[2023-03-17 03:48:37] [INFO ] [Real]Absence check using 102 positive place invariants in 13 ms returned sat
[2023-03-17 03:48:38] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-17 03:48:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 12 ms returned sat
[2023-03-17 03:48:38] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-17 03:48:38] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-17 03:48:39] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Finished Parikh walk after 1166 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=129 )
Parikh walk visited 17 properties in 60 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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' '!((p0 U X(G(p1))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 16 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:48:39] [INFO ] Invariant cache hit.
[2023-03-17 03:48:39] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
[2023-03-17 03:48:39] [INFO ] Invariant cache hit.
[2023-03-17 03:48:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-17 03:48:39] [INFO ] Invariant cache hit.
[2023-03-17 03:48:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-17 03:48:39] [INFO ] Invariant cache hit.
[2023-03-17 03:48:39] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s246 1) (GEQ s247 1) (GEQ s249 1) (LT s110 1)), p0:(AND (GEQ s110 1) (GEQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-00 finished in 687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 6 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 44 rules applied. Total rules applied 239 place count 60 transition count 15
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 283 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 283 place count 16 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 287 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 13 transition count 12
Applied a total of 289 rules in 25 ms. Remains 13 /254 variables (removed 241) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 03:48:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 03:48:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 03:48:40] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/254 places, 12/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 13/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-01 finished in 268 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(G(p0))))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:48:40] [INFO ] Computed 102 place invariants in 4 ms
[2023-03-17 03:48:40] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:40] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:40] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s152 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 2 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-03 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1&&X(G(!p1))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:48:40] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, true, true, p1, p1]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s20 1), p0:(AND (GEQ s243 1) (GEQ s52 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-04 finished in 598 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(p0))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 46 rules applied. Total rules applied 242 place count 58 transition count 11
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 288 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 288 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 290 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 10 transition count 9
Applied a total of 292 rules in 21 ms. Remains 10 /254 variables (removed 244) and now considering 9/203 (removed 194) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-17 03:48:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 03:48:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 03:48:41] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 9/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 10/254 places, 9/203 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, false, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-05 finished in 223 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' '!(((p0 U X(X(X(X(!p1)))))||F(p0)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:48:41] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-17 03:48:41] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:41] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-17 03:48:41] [INFO ] Invariant cache hit.
[2023-03-17 03:48:42] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-17 03:48:42] [INFO ] Invariant cache hit.
[2023-03-17 03:48:42] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(GEQ s103 1), p1:(AND (GEQ s66 1) (GEQ s67 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20457 reset in 592 ms.
Product exploration explored 100000 steps with 20426 reset in 502 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 03:48:44] [INFO ] Invariant cache hit.
[2023-03-17 03:48:44] [INFO ] [Real]Absence check using 102 positive place invariants in 10 ms returned sat
[2023-03-17 03:48:44] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:48:44] [INFO ] [Nat]Absence check using 102 positive place invariants in 10 ms returned sat
[2023-03-17 03:48:44] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:48:44] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-17 03:48:44] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 366 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=122 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:48:44] [INFO ] Invariant cache hit.
[2023-03-17 03:48:45] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
[2023-03-17 03:48:45] [INFO ] Invariant cache hit.
[2023-03-17 03:48:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-17 03:48:45] [INFO ] Invariant cache hit.
[2023-03-17 03:48:45] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-17 03:48:45] [INFO ] Invariant cache hit.
[2023-03-17 03:48:45] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 254/254 places, 203/203 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 03:48:45] [INFO ] Invariant cache hit.
[2023-03-17 03:48:45] [INFO ] [Real]Absence check using 102 positive place invariants in 13 ms returned sat
[2023-03-17 03:48:45] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:48:45] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2023-03-17 03:48:45] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:48:45] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-17 03:48:45] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 306 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 20485 reset in 424 ms.
Product exploration explored 100000 steps with 20458 reset in 461 ms.
Applying partial POR strategy [false, true, false, false, true, false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 97 place count 158 transition count 108
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 97 rules in 12 ms. Remains 158 /254 variables (removed 96) and now considering 108/203 (removed 95) transitions.
// Phase 1: matrix 108 rows 158 cols
[2023-03-17 03:48:48] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-17 03:48:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-03-17 03:48:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-17 03:48:48] [INFO ] Invariant cache hit.
[2023-03-17 03:48:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/254 places, 108/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 158/254 places, 108/203 transitions.
Built C files in :
/tmp/ltsmin4432387138610783984
[2023-03-17 03:48:48] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4432387138610783984
Running compilation step : cd /tmp/ltsmin4432387138610783984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 371 ms.
Running link step : cd /tmp/ltsmin4432387138610783984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4432387138610783984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased879539928238274694.hoa' '--buchi-type=spotba'
LTSmin run took 2833 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-050051-LTLFireability-07 finished in 9729 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&&X(p1))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:48:51] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-17 03:48:51] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
[2023-03-17 03:48:51] [INFO ] Invariant cache hit.
[2023-03-17 03:48:51] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-17 03:48:51] [INFO ] Invariant cache hit.
[2023-03-17 03:48:51] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-17 03:48:51] [INFO ] Invariant cache hit.
[2023-03-17 03:48:51] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s180 1), p1:(LT s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 467 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050051-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLFireability-08 finished in 1555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:48:53] [INFO ] Invariant cache hit.
[2023-03-17 03:48:53] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2023-03-17 03:48:53] [INFO ] Invariant cache hit.
[2023-03-17 03:48:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-17 03:48:53] [INFO ] Invariant cache hit.
[2023-03-17 03:48:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-17 03:48:53] [INFO ] Invariant cache hit.
[2023-03-17 03:48:53] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s46 1) (GEQ s47 1) (GEQ s49 1)), p0:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24 reset in 662 ms.
Stack based approach found an accepted trace after 40 steps with 1 reset with depth 39 and stack size 39 in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-09 finished in 1177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 199 place count 56 transition count 56
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 246 place count 56 transition count 9
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 293 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 293 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 7 transition count 7
Applied a total of 297 rules in 12 ms. Remains 7 /254 variables (removed 247) and now considering 7/203 (removed 196) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 03:48:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 03:48:54] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-17 03:48:54] [INFO ] Invariant cache hit.
[2023-03-17 03:48:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 03:48:54] [INFO ] Invariant cache hit.
[2023-03-17 03:48:54] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-17 03:48:54] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 03:48:54] [INFO ] Invariant cache hit.
[2023-03-17 03:48:54] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/254 places, 7/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 7/254 places, 7/203 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-10 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:(GEQ s5 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 314 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-10 finished in 190 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' '!((p0 U X(X((p1||F(G(!p1)))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:48:54] [INFO ] Computed 102 place invariants in 3 ms
[2023-03-17 03:48:54] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
[2023-03-17 03:48:54] [INFO ] Invariant cache hit.
[2023-03-17 03:48:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-17 03:48:54] [INFO ] Invariant cache hit.
[2023-03-17 03:48:54] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-17 03:48:54] [INFO ] Invariant cache hit.
[2023-03-17 03:48:54] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 235 ms :[false, false, false, false, p1, false, false]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s61 1) (GEQ s62 1) (GEQ s64 1)), p1:(LT s120 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 400 ms.
Product exploration explored 100000 steps with 33333 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050051-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLFireability-11 finished in 1590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 241 place count 58 transition count 12
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 286 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 286 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 290 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 10 transition count 9
Applied a total of 292 rules in 15 ms. Remains 10 /254 variables (removed 244) and now considering 9/203 (removed 194) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-17 03:48:56] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 03:48:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 03:48:56] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 9/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 10/254 places, 9/203 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s9 1), p1:(LT s5 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 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-12 finished in 239 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((G(p0)||X((F(p2)&&p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2023-03-17 03:48:56] [INFO ] Computed 102 place invariants in 2 ms
[2023-03-17 03:48:56] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:56] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s246 1) (GEQ s247 1) (GEQ s249 1)), p1:(AND (GEQ s246 1) (GEQ s247 1) (GEQ s249 1)), p2:(GEQ s127 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-13 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(((X(!p1)&&F(!p2))||X(G(!p1)))) U G(p0)))))'
Support contains 9 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:48:56] [INFO ] Invariant cache hit.
[2023-03-17 03:48:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
[2023-03-17 03:48:57] [INFO ] Invariant cache hit.
[2023-03-17 03:48:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-17 03:48:57] [INFO ] Invariant cache hit.
[2023-03-17 03:48:57] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-17 03:48:57] [INFO ] Invariant cache hit.
[2023-03-17 03:48:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p0), (NOT p0), p1, (NOT p0), p1, (AND p2 p1), (AND (NOT p0) p1), true, p2, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s176 1) (GEQ s177 1) (GEQ s179 1)), p2:(AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1)), p1:(AND (GEQ s106 1) (GEQ s107 1) (GEQ s109 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, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20027 reset in 435 ms.
Stack based approach found an accepted trace after 747 steps with 144 reset with depth 4 and stack size 4 in 5 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-14 finished in 1267 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(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(p2&&(p0 U (p1||G(p0)))))))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-17 03:48:58] [INFO ] Invariant cache hit.
[2023-03-17 03:48:58] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
[2023-03-17 03:48:58] [INFO ] Invariant cache hit.
[2023-03-17 03:48:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-17 03:48:58] [INFO ] Invariant cache hit.
[2023-03-17 03:48:58] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-17 03:48:58] [INFO ] Invariant cache hit.
[2023-03-17 03:48:58] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LT s175 1), p2:(GEQ s40 1), p1:(AND (LT s175 1) (LT s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 691 ms.
Stack based approach found an accepted trace after 2801 steps with 0 reset with depth 2802 and stack size 2782 in 23 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-15 finished in 1330 ms.
All properties solved by simple procedures.
Total runtime 23339 ms.

BK_STOP 1679024940485

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="RefineWMG-PT-050051"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is RefineWMG-PT-050051, 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 r325-tall-167889197500636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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