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.r071-smll-167814398100499.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CloudOpsManagement-PT-00080by00040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814398100499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 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 CloudOpsManagement-PT-00080by00040-LTLCardinality-00
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-01
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-02
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-03
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-04
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-05
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-06
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-07
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-08
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-09
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-10
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-11
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-12
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-13
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-14
FORMULA_NAME CloudOpsManagement-PT-00080by00040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678299757251

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudOpsManagement-PT-00080by00040
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 18:22:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 18:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:22:41] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-08 18:22:41] [INFO ] Transformed 27 places.
[2023-03-08 18:22:41] [INFO ] Transformed 29 transitions.
[2023-03-08 18:22:41] [INFO ] Parsed PT model containing 27 places and 29 transitions and 94 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 17 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 18:22:41] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-08 18:22:41] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 18:22:41] [INFO ] Invariant cache hit.
[2023-03-08 18:22:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:41] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 18:22:41] [INFO ] Invariant cache hit.
[2023-03-08 18:22:41] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-08 18:22:42] [INFO ] Flatten gal took : 38 ms
[2023-03-08 18:22:42] [INFO ] Flatten gal took : 17 ms
[2023-03-08 18:22:42] [INFO ] Input system was already deterministic with 29 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 32) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-08 18:22:43] [INFO ] Invariant cache hit.
[2023-03-08 18:22:43] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 18:22:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-08 18:22:43] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-08 18:22:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:43] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2023-03-08 18:22:43] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 18:22:43] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
Fused 8 Parikh solutions to 2 different solutions.
Finished Parikh walk after 348 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 14 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 24
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 24 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 22
Applied a total of 9 rules in 23 ms. Remains 20 /27 variables (removed 7) and now considering 22/29 (removed 7) transitions.
[2023-03-08 18:22:44] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 18:22:44] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-08 18:22:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 18:22:44] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-08 18:22:44] [INFO ] Invariant cache hit.
[2023-03-08 18:22:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:44] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-08 18:22:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:22:44] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-08 18:22:44] [INFO ] Invariant cache hit.
[2023-03-08 18:22:44] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/27 places, 22/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 20/27 places, 22/29 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s5 s9), p0:(AND (LEQ s15 s14) (LEQ s12 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-00 finished in 732 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 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 18:22:44] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-08 18:22:44] [INFO ] Implicit Places using invariants in 71 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s14 s16), p0:(GT s20 s1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-01 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 24 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 24
Applied a total of 5 rules in 9 ms. Remains 22 /27 variables (removed 5) and now considering 24/29 (removed 5) transitions.
[2023-03-08 18:22:45] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 22 cols
[2023-03-08 18:22:45] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 18:22:45] [INFO ] Implicit Places using invariants in 53 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 24/29 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 21/27 places, 24/29 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s20), p1:(OR (LEQ s6 s16) (LEQ s14 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33278 reset in 570 ms.
Product exploration explored 100000 steps with 33363 reset in 401 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 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 458 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 18:22:47] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 21 cols
[2023-03-08 18:22:47] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 18:22:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 18:22:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 18:22:47] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 18:22:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:47] [INFO ] After 18ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 18:22:47] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 18:22:47] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 24/24 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 20
Applied a total of 4 rules in 6 ms. Remains 21 /21 variables (removed 0) and now considering 20/24 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 21/21 places, 20/24 transitions.
Incomplete random walk after 10031 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=145 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) 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
Interrupted probabilistic random walk after 303220 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 303220 steps, saw 214774 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 20 rows 21 cols
[2023-03-08 18:22:50] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-08 18:22:50] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 18:22:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-08 18:22:50] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 18:22:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:22:50] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 18:22:50] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 18:22:50] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 376 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 476 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 18:22:51] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 21 cols
[2023-03-08 18:22:51] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-08 18:22:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 18:22:51] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 18:22:51] [INFO ] Invariant cache hit.
[2023-03-08 18:22:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:51] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 18:22:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:22:51] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 18:22:51] [INFO ] Invariant cache hit.
[2023-03-08 18:22:51] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 21/21 places, 24/24 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 351 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Incomplete random walk after 10020 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 18:22:52] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 18:22:52] [INFO ] Invariant cache hit.
[2023-03-08 18:22:52] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 18:22:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 18:22:52] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 18:22:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:52] [INFO ] After 17ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 18:22:52] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 18:22:52] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 53 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 24/24 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 20
Applied a total of 4 rules in 9 ms. Remains 21 /21 variables (removed 0) and now considering 20/24 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 21/21 places, 20/24 transitions.
Finished random walk after 7171 steps, including 3 resets, run visited all 2 properties in 13 ms. (steps per millisecond=551 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 502 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Product exploration explored 100000 steps with 33407 reset in 154 ms.
Product exploration explored 100000 steps with 33435 reset in 298 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 18:22:54] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 18:22:54] [INFO ] Invariant cache hit.
[2023-03-08 18:22:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 18:22:54] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 18:22:54] [INFO ] Invariant cache hit.
[2023-03-08 18:22:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 18:22:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:22:54] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 18:22:54] [INFO ] Invariant cache hit.
[2023-03-08 18:22:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 21/21 places, 24/24 transitions.
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-02 finished in 9812 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 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 24 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 24
Applied a total of 5 rules in 10 ms. Remains 22 /27 variables (removed 5) and now considering 24/29 (removed 5) transitions.
[2023-03-08 18:22:54] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 22 cols
[2023-03-08 18:22:54] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-08 18:22:54] [INFO ] Implicit Places using invariants in 58 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 24/29 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 2 / 21 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 23/24 (removed 1) transitions.
[2023-03-08 18:22:54] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 18:22:54] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 18:22:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 18:22:54] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 18:22:54] [INFO ] Invariant cache hit.
[2023-03-08 18:22:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 18:22:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/27 places, 23/29 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 20/27 places, 23/29 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s5 s6) (AND (LEQ s16 s7) (LEQ 2 s14)))], 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 1 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-05 finished in 273 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&&F(p1)))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 18:22:55] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 18:22:55] [INFO ] Implicit Places using invariants in 64 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s2 s5), p1:(LEQ s17 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 3 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-06 finished in 278 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 (G((X(p1) U ((p2&&X(p1))||X(G(p1)))))||(F(p3)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 18:22:55] [INFO ] Invariant cache hit.
[2023-03-08 18:22:55] [INFO ] Implicit Places using invariants in 78 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 80 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 1174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), false, (AND (NOT p1) (NOT p3)), true, (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), false, (NOT p3)]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=5 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=7 dest: 11}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=7 dest: 12}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=9 dest: 13}], [{ cond=(NOT p3), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={1} source=11 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=11 dest: 11}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=11 dest: 12}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=12 dest: 11}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0} source=12 dest: 12}], [{ cond=(NOT p3), acceptance={0, 1} source=13 dest: 13}]], initial=0, aps=[p0:(LEQ 2 s22), p2:(GT 1 s10), p3:(GT 1 s1), p1:(GT s2 s18)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 22 reset in 1 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-08 finished in 1319 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&&X(G(p0))))))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 18:22:56] [INFO ] Invariant cache hit.
[2023-03-08 18:22:56] [INFO ] Implicit Places using invariants in 51 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 3 s4)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-10 finished in 309 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 G(!p1))&&X(p2)))'
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 18:22:57] [INFO ] Invariant cache hit.
[2023-03-08 18:22:57] [INFO ] Implicit Places using invariants in 60 ms returned [16, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (LEQ s13 s1) (LEQ s18 s7)) (LEQ s18 s7)), p0:(GT s18 s7), p2:(LEQ s8 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 509 ms.
Product exploration explored 100000 steps with 1 reset in 672 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 p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Property proved to be false thanks to negative knowledge :(X (NOT p2))
Knowledge based reduction with 12 factoid took 314 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-11 finished in 1847 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)||F(!p0))))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 18:22:58] [INFO ] Invariant cache hit.
[2023-03-08 18:22:58] [INFO ] Implicit Places using invariants in 63 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s9), p1:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-12 finished in 244 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((F(p1)&&F(p2)))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 18:22:59] [INFO ] Invariant cache hit.
[2023-03-08 18:22:59] [INFO ] Implicit Places using invariants in 51 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudOpsManagement-PT-00080by00040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s7 s19), p1:(LEQ 1 s17), p2:(LEQ s21 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 190 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 (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudOpsManagement-PT-00080by00040-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudOpsManagement-PT-00080by00040-LTLCardinality-13 finished in 950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(p1)))))'
[2023-03-08 18:23:00] [INFO ] Flatten gal took : 10 ms
[2023-03-08 18:23:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 18:23:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 29 transitions and 94 arcs took 1 ms.
Total runtime 19621 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CloudOpsManagement-PT-00080by00040
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1678299791680

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-00080by00040-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 23/32 CloudOpsManagement-PT-00080by00040-LTLCardinality-02 3527336 m, 705467 m/sec, 4727468 t fired, .

Time elapsed: 5 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CloudOpsManagement-PT-00080by00040-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-00080by00040-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudOpsManagement-PT-00080by00040-LTLCardinality-02: LTL unknown AGGR


Time elapsed: 10 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudOpsManagement-PT-00080by00040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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