fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r489-tall-167912706700347
Last Updated
May 14, 2023

About the Execution of LTSMin+red for SwimmingPool-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
312.096 7702.00 12819.00 174.80 FFFTFFFTFTFFFFFF normal

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.r489-tall-167912706700347.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 SwimmingPool-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706700347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.0K Feb 26 03:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-04-LTLCardinality-00
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-01
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-02
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-03
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-04
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-05
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-06
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-07
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-08
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-09
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-10
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-11
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-12
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-13
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-14
FORMULA_NAME SwimmingPool-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679236941791

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 14:42:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 14:42:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 14:42:23] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-19 14:42:23] [INFO ] Transformed 9 places.
[2023-03-19 14:42:23] [INFO ] Transformed 7 transitions.
[2023-03-19 14:42:23] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SwimmingPool-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 14:42:23] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 14:42:23] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-19 14:42:23] [INFO ] Invariant cache hit.
[2023-03-19 14:42:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-19 14:42:23] [INFO ] Invariant cache hit.
[2023-03-19 14:42:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 14:42:24] [INFO ] Flatten gal took : 17 ms
[2023-03-19 14:42:24] [INFO ] Flatten gal took : 2 ms
[2023-03-19 14:42:24] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 1311 steps, including 0 resets, run visited all 26 properties in 20 ms. (steps per millisecond=65 )
FORMULA SwimmingPool-PT-04-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SwimmingPool-PT-04-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:42:24] [INFO ] Invariant cache hit.
[2023-03-19 14:42:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 14:42:24] [INFO ] Invariant cache hit.
[2023-03-19 14:42:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 14:42:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:42:24] [INFO ] Invariant cache hit.
[2023-03-19 14:42:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-01 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 (GT s3 s5) (GT 2 s1) (GT s0 s4)), p1:(LEQ s0 s4)], 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]]
Product exploration explored 100000 steps with 780 reset in 215 ms.
Stack based approach found an accepted trace after 136 steps with 1 reset with depth 119 and stack size 119 in 1 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-01 finished in 576 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))||G(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 14:42:24] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 14:42:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 14:42:25] [INFO ] Invariant cache hit.
[2023-03-19 14:42:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 14:42:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:42:25] [INFO ] Invariant cache hit.
[2023-03-19 14:42:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s0), p0:(GT s4 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 61 reset in 134 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-04 finished in 335 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 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
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 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
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 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 6 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 14:42:25] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 14:42:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 14:42:25] [INFO ] Invariant cache hit.
[2023-03-19 14:42:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 14:42:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:42:25] [INFO ] Invariant cache hit.
[2023-03-19 14:42:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-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:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 67 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 25 in 0 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-05 finished in 374 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&&X(X(G(p1)))))||G((p2||X(p2))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 14:42:25] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 14:42:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 14:42:25] [INFO ] Invariant cache hit.
[2023-03-19 14:42:25] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-19 14:42:25] [INFO ] Invariant cache hit.
[2023-03-19 14:42:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s0), p1:(LEQ 3 s3), p2:(GT 2 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-06 finished in 370 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 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:42:26] [INFO ] Invariant cache hit.
[2023-03-19 14:42:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 14:42:26] [INFO ] Invariant cache hit.
[2023-03-19 14:42:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 14:42:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:42:26] [INFO ] Invariant cache hit.
[2023-03-19 14:42:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-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:(AND (LEQ s2 s8) (GT 3 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 0 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-08 finished in 236 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) U X(p2))||(p2 U p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:42:26] [INFO ] Invariant cache hit.
[2023-03-19 14:42:26] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 14:42:26] [INFO ] Invariant cache hit.
[2023-03-19 14:42:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 14:42:26] [INFO ] Invariant cache hit.
[2023-03-19 14:42:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 2 s7), p0:(LEQ 1 s7), p2:(LEQ s7 s4)], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 72 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 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 13 factoid took 201 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-04-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-04-LTLCardinality-09 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s2), p1:(LEQ s8 s5)], 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]]
Product exploration explored 100000 steps with 15 reset in 100 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-11 finished in 373 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(F(!p0))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 67 reset in 71 ms.
Stack based approach found an accepted trace after 168 steps with 0 reset with depth 169 and stack size 169 in 1 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-12 finished in 269 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))||F(G(p2))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 14:42:27] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 14:42:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 14:42:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:42:27] [INFO ] Invariant cache hit.
[2023-03-19 14:42:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s6 s7), p0:(LEQ s7 s1), p2:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Stack based approach found an accepted trace after 8244 steps with 2 reset with depth 3707 and stack size 3594 in 8 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-13 finished in 315 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(F(p0))&&(!p0||G(p1)))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 14:42:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 14:42:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 14:42:28] [INFO ] Invariant cache hit.
[2023-03-19 14:42:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 14:42:28] [INFO ] Invariant cache hit.
[2023-03-19 14:42:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s5 s3), p1:(GT s6 s8)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 4453 reset in 62 ms.
Stack based approach found an accepted trace after 320 steps with 14 reset with depth 75 and stack size 75 in 1 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-14 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(G((p0||G(!p1))))) U (G((p0&&X(G((p0||G(!p1))))))||(X(G((p0||G(!p1))))&&p2)))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:42:28] [INFO ] Invariant cache hit.
[2023-03-19 14:42:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 14:42:28] [INFO ] Invariant cache hit.
[2023-03-19 14:42:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 14:42:28] [INFO ] Invariant cache hit.
[2023-03-19 14:42:28] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 (NOT p0)), p1]
Running random walk in product with property : SwimmingPool-PT-04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GT 3 s4) (GT s6 s4)), p0:(GT s6 s4), p1:(OR (GT s2 s8) (LEQ s2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, 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 1939 steps with 0 reset in 6 ms.
FORMULA SwimmingPool-PT-04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-04-LTLCardinality-15 finished in 325 ms.
All properties solved by simple procedures.
Total runtime 5430 ms.
ITS solved all properties within timeout

BK_STOP 1679236949493

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

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="SwimmingPool-PT-04"
export BK_EXAMINATION="LTLCardinality"
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 SwimmingPool-PT-04, 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 r489-tall-167912706700347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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