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.r329-tall-167889202300652.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 RefineWMG-PT-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202300652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:54 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.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:56 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 218K 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-100101-LTLFireability-00
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-01
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-02
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-03
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-04
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-05
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-06
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-07
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-08
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-09
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-10
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-11
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-12
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-13
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-14
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679163309940

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=RefineWMG-PT-100101
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 18:15:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 18:15:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:15:11] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-18 18:15:11] [INFO ] Transformed 504 places.
[2023-03-18 18:15:11] [INFO ] Transformed 403 transitions.
[2023-03-18 18:15:11] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 144 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-100101-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 46 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-18 18:15:11] [INFO ] Computed 202 place invariants in 14 ms
[2023-03-18 18:15:12] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
[2023-03-18 18:15:12] [INFO ] Invariant cache hit.
[2023-03-18 18:15:12] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-18 18:15:12] [INFO ] Invariant cache hit.
[2023-03-18 18:15:12] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-18 18:15:12] [INFO ] Invariant cache hit.
[2023-03-18 18:15:13] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1428 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 55 out of 504 places after structural reductions.
[2023-03-18 18:15:13] [INFO ] Flatten gal took : 63 ms
[2023-03-18 18:15:13] [INFO ] Flatten gal took : 27 ms
[2023-03-18 18:15:13] [INFO ] Input system was already deterministic with 403 transitions.
Support contains 53 out of 504 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 35) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-18 18:15:13] [INFO ] Invariant cache hit.
[2023-03-18 18:15:14] [INFO ] [Real]Absence check using 202 positive place invariants in 31 ms returned sat
[2023-03-18 18:15:14] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-18 18:15:14] [INFO ] [Nat]Absence check using 202 positive place invariants in 27 ms returned sat
[2023-03-18 18:15:15] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-18 18:15:15] [INFO ] After 1221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-18 18:15:16] [INFO ] After 2007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Finished Parikh walk after 41561 steps, including 1 resets, run visited all 16 properties in 614 ms. (steps per millisecond=67 )
Parikh walk visited 16 properties in 617 ms.
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 (p1||G(!p0))) U X(X(p2))))'
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:17] [INFO ] Invariant cache hit.
[2023-03-18 18:15:17] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-18 18:15:17] [INFO ] Invariant cache hit.
[2023-03-18 18:15:17] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-18 18:15:17] [INFO ] Invariant cache hit.
[2023-03-18 18:15:18] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-18 18:15:18] [INFO ] Invariant cache hit.
[2023-03-18 18:15:18] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 926 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 575 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p2), (NOT p2), true, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1) p0), (NOT p2), (NOT p2), (AND (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(AND (LT s163 1) (NOT (AND (NOT (AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1))) (GEQ s100 1)))), p0:(AND (NOT (AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1))) (GE...], 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1176 ms.
Product exploration explored 100000 steps with 33333 reset in 1021 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (OR p1 (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100101-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLFireability-00 finished in 4073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U p1)&&X(G(p2))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:21] [INFO ] Invariant cache hit.
[2023-03-18 18:15:21] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
[2023-03-18 18:15:21] [INFO ] Invariant cache hit.
[2023-03-18 18:15:21] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-18 18:15:21] [INFO ] Invariant cache hit.
[2023-03-18 18:15:22] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-18 18:15:22] [INFO ] Invariant cache hit.
[2023-03-18 18:15:22] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) p0), (NOT p2), (OR (NOT p2) p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s13 1), p0:(AND (GEQ s63 1) (GEQ s13 1)), p2:(GEQ s272 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 399 steps with 0 reset in 8 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-01 finished in 1183 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)))'
Support contains 6 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:22] [INFO ] Invariant cache hit.
[2023-03-18 18:15:22] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
[2023-03-18 18:15:22] [INFO ] Invariant cache hit.
[2023-03-18 18:15:23] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-18 18:15:23] [INFO ] Invariant cache hit.
[2023-03-18 18:15:23] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-18 18:15:23] [INFO ] Invariant cache hit.
[2023-03-18 18:15:23] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 934 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s181 1) (GEQ s182 1) (GEQ s184 1)), p0:(AND (GEQ s266 1) (GEQ s267 1) (GEQ s269 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]]
Entered a terminal (fully accepting) state of product in 11642 steps with 0 reset in 216 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-02 finished in 1262 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((p1 U p2))||p0))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 292 edges and 504 vertex of which 192 / 504 are part of one of the 96 SCC in 5 ms
Free SCC test removed 96 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 312 transition count 212
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 396 place count 112 transition count 112
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 1 with 91 rules applied. Total rules applied 487 place count 112 transition count 21
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 578 place count 21 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 578 place count 21 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 586 place count 17 transition count 17
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 588 place count 16 transition count 16
Applied a total of 588 rules in 35 ms. Remains 16 /504 variables (removed 488) and now considering 16/403 (removed 387) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-18 18:15:23] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 18:15:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-18 18:15:23] [INFO ] Invariant cache hit.
[2023-03-18 18:15:23] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 18:15:23] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-18 18:15:24] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/504 places, 16/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 16/504 places, 16/403 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s9 1) (GEQ s12 1)), p2:(GEQ s15 1), p1:(GEQ s6 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 1 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-03 finished in 486 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&&(p1||G(p2)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 587 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 589 place count 13 transition count 12
Applied a total of 589 rules in 30 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-18 18:15:24] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 18:15:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 18:15:24] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 13/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LT s11 1), p1:(LT s8 1), p2:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-04 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 2 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 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 593 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 595 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 597 place count 7 transition count 7
Applied a total of 597 rules in 29 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 18:15:24] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 18:15:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-18 18:15:24] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 18:15:24] [INFO ] Invariant cache hit.
[2023-03-18 18:15:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-05 finished in 298 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(G(p1)))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-18 18:15:24] [INFO ] Computed 202 place invariants in 9 ms
[2023-03-18 18:15:25] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
[2023-03-18 18:15:25] [INFO ] Invariant cache hit.
[2023-03-18 18:15:25] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-18 18:15:25] [INFO ] Invariant cache hit.
[2023-03-18 18:15:25] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-18 18:15:25] [INFO ] Invariant cache hit.
[2023-03-18 18:15:25] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 979 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s403 1), p1:(OR (LT s406 1) (LT s407 1) (LT s409 1) (LT s193 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 4 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-06 finished in 1173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:26] [INFO ] Invariant cache hit.
[2023-03-18 18:15:26] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
[2023-03-18 18:15:26] [INFO ] Invariant cache hit.
[2023-03-18 18:15:26] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-18 18:15:26] [INFO ] Invariant cache hit.
[2023-03-18 18:15:26] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-18 18:15:26] [INFO ] Invariant cache hit.
[2023-03-18 18:15:27] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s501 1) (GEQ s502 1)), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-07 finished in 1080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 2 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 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 593 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 595 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 597 place count 7 transition count 7
Applied a total of 597 rules in 21 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 18:15:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 18:15:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-18 18:15:27] [INFO ] Invariant cache hit.
[2023-03-18 18:15:27] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 18:15:27] [INFO ] Invariant cache hit.
[2023-03-18 18:15:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 18:15:27] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 18:15:27] [INFO ] Invariant cache hit.
[2023-03-18 18:15:27] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-08 finished in 173 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(X(G(p1)))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-18 18:15:27] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-18 18:15:27] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
[2023-03-18 18:15:27] [INFO ] Invariant cache hit.
[2023-03-18 18:15:27] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-18 18:15:27] [INFO ] Invariant cache hit.
[2023-03-18 18:15:28] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-18 18:15:28] [INFO ] Invariant cache hit.
[2023-03-18 18:15:28] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 934 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(GEQ s428 1), p0:(LT s345 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7198 steps with 0 reset in 154 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-09 finished in 1354 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))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 5 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 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 593 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 595 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 597 place count 7 transition count 7
Applied a total of 597 rules in 25 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 18:15:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 18:15:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-18 18:15:28] [INFO ] Invariant cache hit.
[2023-03-18 18:15:28] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 18:15:28] [INFO ] Invariant cache hit.
[2023-03-18 18:15:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 18:15:28] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 18:15:28] [INFO ] Invariant cache hit.
[2023-03-18 18:15:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-11 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 7 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 292 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 391 place count 114 transition count 112
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 1 with 91 rules applied. Total rules applied 482 place count 114 transition count 21
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 573 place count 23 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 573 place count 23 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 579 place count 20 transition count 18
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 581 place count 19 transition count 17
Applied a total of 581 rules in 23 ms. Remains 19 /504 variables (removed 485) and now considering 17/403 (removed 386) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-18 18:15:28] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-18 18:15:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-18 18:15:28] [INFO ] Invariant cache hit.
[2023-03-18 18:15:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 18:15:29] [INFO ] Invariant cache hit.
[2023-03-18 18:15:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 18:15:29] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 18:15:29] [INFO ] Invariant cache hit.
[2023-03-18 18:15:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/504 places, 17/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 19/504 places, 17/403 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s16 1) (GEQ s18 1)) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1))), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-12 finished in 383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&X(G((p1||F(p2)))))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-18 18:15:29] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-18 18:15:29] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
[2023-03-18 18:15:29] [INFO ] Invariant cache hit.
[2023-03-18 18:15:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-18 18:15:29] [INFO ] Invariant cache hit.
[2023-03-18 18:15:30] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-18 18:15:30] [INFO ] Invariant cache hit.
[2023-03-18 18:15:30] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 916 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s127 1), p1:(LT s177 1), p2:(LT s320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1426 ms.
Product exploration explored 100000 steps with 0 reset in 1764 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 (NOT p1) p2), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 227498 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227498 steps, saw 221296 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:15:37] [INFO ] Invariant cache hit.
[2023-03-18 18:15:37] [INFO ] [Real]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-18 18:15:37] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 18:15:37] [INFO ] [Nat]Absence check using 202 positive place invariants in 29 ms returned sat
[2023-03-18 18:15:37] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 18:15:37] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 18:15:37] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 5531 steps, including 0 resets, run visited all 2 properties in 80 ms. (steps per millisecond=69 )
Parikh walk visited 2 properties in 80 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:38] [INFO ] Invariant cache hit.
[2023-03-18 18:15:38] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
[2023-03-18 18:15:38] [INFO ] Invariant cache hit.
[2023-03-18 18:15:38] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-18 18:15:38] [INFO ] Invariant cache hit.
[2023-03-18 18:15:39] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-18 18:15:39] [INFO ] Invariant cache hit.
[2023-03-18 18:15:39] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 937 ms. Remains : 504/504 places, 403/403 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 256297 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256297 steps, saw 249266 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:15:42] [INFO ] Invariant cache hit.
[2023-03-18 18:15:43] [INFO ] [Real]Absence check using 202 positive place invariants in 31 ms returned sat
[2023-03-18 18:15:43] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 18:15:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 32 ms returned sat
[2023-03-18 18:15:43] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 18:15:43] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 18:15:43] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 6049 steps, including 0 resets, run visited all 2 properties in 85 ms. (steps per millisecond=71 )
Parikh walk visited 2 properties in 84 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1489 ms.
Product exploration explored 100000 steps with 0 reset in 1586 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 197 place count 308 transition count 208
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 197 rules in 39 ms. Remains 308 /504 variables (removed 196) and now considering 208/403 (removed 195) transitions.
// Phase 1: matrix 208 rows 308 cols
[2023-03-18 18:15:47] [INFO ] Computed 104 place invariants in 3 ms
[2023-03-18 18:15:47] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
[2023-03-18 18:15:47] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-18 18:15:47] [INFO ] Invariant cache hit.
[2023-03-18 18:15:47] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/504 places, 208/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 308/504 places, 208/403 transitions.
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2023-03-18 18:15:47] [INFO ] Computed 202 place invariants in 4 ms
[2023-03-18 18:15:48] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
[2023-03-18 18:15:48] [INFO ] Invariant cache hit.
[2023-03-18 18:15:48] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-18 18:15:48] [INFO ] Invariant cache hit.
[2023-03-18 18:15:48] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-18 18:15:48] [INFO ] Invariant cache hit.
[2023-03-18 18:15:48] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 504/504 places, 403/403 transitions.
Treatment of property RefineWMG-PT-100101-LTLFireability-13 finished in 19621 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&&(!p1 U (G(!p1)||(!p1&&G(p2))))&&(p3||G(p4)))))'
Support contains 7 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:48] [INFO ] Invariant cache hit.
[2023-03-18 18:15:49] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
[2023-03-18 18:15:49] [INFO ] Invariant cache hit.
[2023-03-18 18:15:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-18 18:15:49] [INFO ] Invariant cache hit.
[2023-03-18 18:15:49] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-18 18:15:49] [INFO ] Invariant cache hit.
[2023-03-18 18:15:49] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 927 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) p1 (AND (NOT p3) (NOT p4))), (OR (NOT p0) p1 (AND (NOT p3) (NOT p4))), true, (NOT p4), p1, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p4)) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p4 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p3 (NOT p2) (NOT p1)) (AND p0 p4 (NOT p2) (NOT p1))), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p3 p2 (NOT p1)) (AND p0 p4 p2 (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={} source=3 dest: 2}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s301 1) (LT s302 1) (LT s304 1)), p3:(LT s302 1), p4:(OR (LT s106 1) (LT s107 1) (LT s109 1) (LT s82 1)), p1:(AND (GEQ s106 1) (GEQ s107 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, 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 15356 steps with 0 reset in 224 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-14 finished in 1420 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(F(p0))&&(F(G(p0)) U p1)))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-18 18:15:50] [INFO ] Invariant cache hit.
[2023-03-18 18:15:50] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
[2023-03-18 18:15:50] [INFO ] Invariant cache hit.
[2023-03-18 18:15:50] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-18 18:15:50] [INFO ] Invariant cache hit.
[2023-03-18 18:15:51] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-18 18:15:51] [INFO ] Invariant cache hit.
[2023-03-18 18:15:51] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s15 1), p1:(GEQ s408 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1456 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-15 finished in 2706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&X(G((p1||F(p2)))))))))'
Found a Shortening insensitive property : RefineWMG-PT-100101-LTLFireability-13
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 587 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 589 place count 13 transition count 12
Applied a total of 589 rules in 19 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-18 18:15:53] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 18:15:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-18 18:15:53] [INFO ] Invariant cache hit.
[2023-03-18 18:15:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 18:15:53] [INFO ] Invariant cache hit.
[2023-03-18 18:15:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-18 18:15:53] [INFO ] Invariant cache hit.
[2023-03-18 18:15:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 111 ms. Remains : 13/504 places, 12/403 transitions.
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s5 1), p1:(LT s8 1), p2:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1254 steps with 0 reset in 3 ms.
Treatment of property RefineWMG-PT-100101-LTLFireability-13 finished in 403 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-18 18:15:53] [INFO ] Flatten gal took : 24 ms
[2023-03-18 18:15:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-18 18:15:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 504 places, 403 transitions and 1208 arcs took 4 ms.
Total runtime 42140 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1308/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RefineWMG-PT-100101-LTLFireability-13

BK_STOP 1679163354646

--------------------
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 RefineWMG-PT-100101-LTLFireability-13
ltl formula formula --ltl=/tmp/1308/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 504 places, 403 transitions and 1208 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.040 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1308/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1308/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1308/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1308/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-100101"
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 RefineWMG-PT-100101, 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 r329-tall-167889202300652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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