Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024900219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024900219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 7.9K Apr 29 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 50K May 10 09:34 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 ShieldIIPt-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652952130805

Running Version 202205111006
[2022-05-19 09:22:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 09:22:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 09:22:12] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-19 09:22:12] [INFO ] Transformed 213 places.
[2022-05-19 09:22:12] [INFO ] Transformed 198 transitions.
[2022-05-19 09:22:12] [INFO ] Found NUPN structural information;
[2022-05-19 09:22:12] [INFO ] Parsed PT model containing 213 places and 198 transitions in 201 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 2 formulas.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 171
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 171
Applied a total of 54 rules in 41 ms. Remains 186 /213 variables (removed 27) and now considering 171/198 (removed 27) transitions.
// Phase 1: matrix 171 rows 186 cols
[2022-05-19 09:22:12] [INFO ] Computed 28 place invariants in 17 ms
[2022-05-19 09:22:12] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 171 rows 186 cols
[2022-05-19 09:22:12] [INFO ] Computed 28 place invariants in 9 ms
[2022-05-19 09:22:12] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 186 cols
[2022-05-19 09:22:12] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-19 09:22:12] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/213 places, 171/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/213 places, 171/198 transitions.
Support contains 25 out of 186 places after structural reductions.
[2022-05-19 09:22:13] [INFO ] Flatten gal took : 40 ms
[2022-05-19 09:22:13] [INFO ] Flatten gal took : 16 ms
[2022-05-19 09:22:13] [INFO ] Input system was already deterministic with 171 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 171 rows 186 cols
[2022-05-19 09:22:13] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:13] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 09:22:13] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2022-05-19 09:22:13] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-19 09:22:13] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 4 ms to minimize.
[2022-05-19 09:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-19 09:22:13] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 09:22:13] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 186/186 places, 171/171 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 186 transition count 133
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 40 rules applied. Total rules applied 78 place count 148 transition count 131
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 147 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 146 transition count 130
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 81 place count 146 transition count 109
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 123 place count 125 transition count 109
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 121 transition count 105
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 121 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 131 place count 121 transition count 103
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 119 transition count 103
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 235 place count 69 transition count 53
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 251 place count 61 transition count 58
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 61 transition count 57
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 255 place count 61 transition count 57
Applied a total of 255 rules in 35 ms. Remains 61 /186 variables (removed 125) and now considering 57/171 (removed 114) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/186 places, 57/171 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1669623 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1669623 steps, saw 949090 distinct states, run finished after 3002 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 57 rows 61 cols
[2022-05-19 09:22:16] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-19 09:22:16] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:22:16] [INFO ] [Nat]Absence check using 28 positive place invariants in 3 ms returned sat
[2022-05-19 09:22:16] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-19 09:22:16] [INFO ] After 19ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:17] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-19 09:22:17] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 57/57 transitions.
Applied a total of 0 rules in 10 ms. Remains 61 /61 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 57/57 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 57/57 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 57/57 (removed 0) transitions.
// Phase 1: matrix 57 rows 61 cols
[2022-05-19 09:22:17] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-19 09:22:17] [INFO ] Implicit Places using invariants in 53 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 59/61 places, 57/57 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 59 transition count 56
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 58 transition count 56
Applied a total of 2 rules in 4 ms. Remains 58 /59 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 58 cols
[2022-05-19 09:22:17] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-19 09:22:17] [INFO ] Implicit Places using invariants in 53 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 57/61 places, 56/57 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 55
Applied a total of 2 rules in 4 ms. Remains 56 /57 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:17] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:17] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:17] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-19 09:22:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-19 09:22:17] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 56/61 places, 55/57 transitions.
Finished structural reductions, in 3 iterations. Remains : 56/61 places, 55/57 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1742837 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :{}
Probabilistic random walk after 1742837 steps, saw 947508 distinct states, run finished after 3001 ms. (steps per millisecond=580 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:20] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-19 09:22:20] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:22:20] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2022-05-19 09:22:20] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-19 09:22:20] [INFO ] After 14ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:20] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2022-05-19 09:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-19 09:22:20] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-19 09:22:20] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 55/55 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:20] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:20] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:20] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-19 09:22:20] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2022-05-19 09:22:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:20] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-19 09:22:20] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 55/55 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 56 transition count 55
Applied a total of 13 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 56 cols
[2022-05-19 09:22:20] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:20] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:22:20] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-19 09:22:20] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 09:22:20] [INFO ] After 11ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-19 09:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-19 09:22:20] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 09:22:20] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:22:20] [INFO ] Flatten gal took : 5 ms
[2022-05-19 09:22:20] [INFO ] Flatten gal took : 5 ms
[2022-05-19 09:22:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality74416520683498363.gal : 3 ms
[2022-05-19 09:22:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17159065802855668942.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5165114730110626196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality74416520683498363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17159065802855668942.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality17159065802855668942.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 34
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :34 after 73
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :73 after 217
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :217 after 4149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4149 after 10049
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10049 after 406099
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.101e+08,0.146856,9048,2,383,14,21958,7,0,285,35378,0
Total reachable state count : 110100458

Verifying 1 reachability properties.
Reachability property AtomicPropp9 does not hold.
No reachable states exhibit your property : AtomicPropp9

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp9,0,0.148008,9048,1,0,14,21958,7,0,287,35378,0
FORMULA ShieldIIPt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 49 stable transitions
FORMULA ShieldIIPt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(G(p0)))))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 171/171 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 185 transition count 132
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 40 rules applied. Total rules applied 78 place count 147 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 146 transition count 130
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 79 place count 146 transition count 110
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 119 place count 126 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 121 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 121 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 129 place count 121 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 118 transition count 102
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 233 place count 69 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 247 place count 62 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 60 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 251 place count 58 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 251 place count 58 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 57 transition count 54
Applied a total of 253 rules in 34 ms. Remains 57 /186 variables (removed 129) and now considering 54/171 (removed 117) transitions.
// Phase 1: matrix 54 rows 57 cols
[2022-05-19 09:22:21] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-19 09:22:21] [INFO ] Implicit Places using invariants in 42 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/186 places, 54/171 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 53
Applied a total of 2 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 55 cols
[2022-05-19 09:22:21] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:21] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 53 rows 55 cols
[2022-05-19 09:22:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-19 09:22:21] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/186 places, 53/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/186 places, 53/171 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-06 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 (NEQ s53 0) (NEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38296 steps with 0 reset in 141 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-06 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F(p0))||p1)))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 171/171 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 179 transition count 164
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 178 transition count 163
Applied a total of 16 rules in 11 ms. Remains 178 /186 variables (removed 8) and now considering 163/171 (removed 8) transitions.
// Phase 1: matrix 163 rows 178 cols
[2022-05-19 09:22:21] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-19 09:22:21] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 163 rows 178 cols
[2022-05-19 09:22:21] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 178 cols
[2022-05-19 09:22:21] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:21] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/186 places, 163/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/186 places, 163/171 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s7 1), p0:(OR (EQ s73 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19335 reset in 157 ms.
Product exploration explored 100000 steps with 19357 reset in 281 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 127 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 178 cols
[2022-05-19 09:22:23] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-19 09:22:23] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 163 rows 178 cols
[2022-05-19 09:22:23] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-19 09:22:23] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 178 cols
[2022-05-19 09:22:23] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/178 places, 163/163 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 276 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 32910 reset in 148 ms.
Product exploration explored 100000 steps with 32987 reset in 150 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 178 transition count 163
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 33 place count 178 transition count 173
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 46 place count 178 transition count 173
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 104 place count 178 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 178 transition count 172
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 128 place count 155 transition count 149
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 151 place count 155 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 155 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 153 transition count 147
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 153 transition count 147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 153 transition count 202
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 143 transition count 182
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 143 transition count 182
Deduced a syphon composed of 80 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 195 place count 143 transition count 173
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 195 rules in 46 ms. Remains 143 /178 variables (removed 35) and now considering 173/163 (removed -10) transitions.
[2022-05-19 09:22:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 173 rows 143 cols
[2022-05-19 09:22:25] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-19 09:22:25] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/178 places, 173/163 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/178 places, 173/163 transitions.
Stuttering criterion allowed to conclude after 14343 steps with 4663 reset in 118 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-07 finished in 3966 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)||G(p2)))'
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 171/171 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 181 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 181 transition count 166
Applied a total of 10 rules in 9 ms. Remains 181 /186 variables (removed 5) and now considering 166/171 (removed 5) transitions.
// Phase 1: matrix 166 rows 181 cols
[2022-05-19 09:22:25] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:25] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 166 rows 181 cols
[2022-05-19 09:22:25] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:25] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 181 cols
[2022-05-19 09:22:25] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-19 09:22:25] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/186 places, 166/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/186 places, 166/171 transitions.
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(OR (EQ s174 0) (EQ s111 1)), p1:(NEQ s149 1), p2:(OR (EQ s93 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 17 factoid took 257 ms. Reduced automaton from 9 states, 22 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-08 finished in 1437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 171/171 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 133
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 39 rules applied. Total rules applied 76 place count 148 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 147 transition count 131
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 77 place count 147 transition count 110
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 119 place count 126 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 121 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 121 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 129 place count 121 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 118 transition count 102
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 233 place count 69 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 247 place count 62 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 60 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 251 place count 58 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 251 place count 58 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 57 transition count 54
Applied a total of 253 rules in 25 ms. Remains 57 /186 variables (removed 129) and now considering 54/171 (removed 117) transitions.
// Phase 1: matrix 54 rows 57 cols
[2022-05-19 09:22:27] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-19 09:22:27] [INFO ] Implicit Places using invariants in 43 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/186 places, 54/171 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/186 places, 54/171 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s43 1))], 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 1 reset in 259 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-09 finished in 378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||(p1 U !X(p1))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 171/171 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 180 transition count 165
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 179 transition count 164
Applied a total of 14 rules in 9 ms. Remains 179 /186 variables (removed 7) and now considering 164/171 (removed 7) transitions.
// Phase 1: matrix 164 rows 179 cols
[2022-05-19 09:22:27] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:27] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 164 rows 179 cols
[2022-05-19 09:22:27] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:27] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 179 cols
[2022-05-19 09:22:27] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-19 09:22:27] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/186 places, 164/171 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/186 places, 164/171 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}], [{ cond=p1, acceptance={} source=6 dest: 3}]], initial=2, aps=[p1:(EQ s22 1), p0:(OR (EQ s132 0) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||p2)))'
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 171/171 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 133
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 39 rules applied. Total rules applied 76 place count 148 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 147 transition count 131
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 77 place count 147 transition count 112
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 115 place count 128 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 125 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 125 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 121 place count 125 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 123 transition count 107
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 225 place count 73 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 67 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 65 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 63 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 241 place count 63 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 62 transition count 57
Applied a total of 243 rules in 26 ms. Remains 62 /186 variables (removed 124) and now considering 57/171 (removed 114) transitions.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 09:22:28] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-19 09:22:28] [INFO ] Implicit Places using invariants in 46 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/186 places, 57/171 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 56
Applied a total of 2 rules in 2 ms. Remains 60 /61 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 60 cols
[2022-05-19 09:22:28] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:28] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 56 rows 60 cols
[2022-05-19 09:22:28] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-19 09:22:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:22:28] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/186 places, 56/171 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/186 places, 56/171 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s38 0) (EQ s37 1)), p2:(AND (EQ s57 0) (EQ s41 1)), p1:(AND (OR (EQ s22 0) (EQ s22 1)) (EQ s38 0) (EQ s37 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3487 reset in 207 ms.
Stack based approach found an accepted trace after 32 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-15 finished in 429 ms.
All properties solved by simple procedures.
Total runtime 16884 ms.

BK_STOP 1652952148942

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-003B, 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 r222-tall-165286024900219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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