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.r394-oct2-167903717700270.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 167K 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 ShieldIIPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679499466365

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:37:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:37:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:37:48] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-22 15:37:48] [INFO ] Transformed 703 places.
[2023-03-22 15:37:48] [INFO ] Transformed 653 transitions.
[2023-03-22 15:37:48] [INFO ] Found NUPN structural information;
[2023-03-22 15:37:48] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 612 ms. (steps per millisecond=16 ) properties (out of 14) seen :8
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-22 15:37:49] [INFO ] Computed 91 place invariants in 26 ms
[2023-03-22 15:37:50] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 15:37:50] [INFO ] [Nat]Absence check using 91 positive place invariants in 96 ms returned sat
[2023-03-22 15:37:51] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-22 15:37:51] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 7 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 13 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2023-03-22 15:37:52] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 4 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-22 15:37:53] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2639 ms
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 1 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 13 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1824 ms
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1220 ms
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 25 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1183 ms
[2023-03-22 15:37:59] [INFO ] After 8862ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-22 15:38:00] [INFO ] After 9712ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 71 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 703 transition count 529
Reduce places removed 124 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 126 rules applied. Total rules applied 250 place count 579 transition count 527
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 264 place count 578 transition count 514
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 277 place count 565 transition count 514
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 277 place count 565 transition count 469
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 367 place count 520 transition count 469
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 421 place count 466 transition count 415
Iterating global reduction 4 with 54 rules applied. Total rules applied 475 place count 466 transition count 415
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 475 place count 466 transition count 393
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 519 place count 444 transition count 393
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 4 with 284 rules applied. Total rules applied 803 place count 302 transition count 251
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 847 place count 280 transition count 260
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 849 place count 280 transition count 258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 851 place count 278 transition count 258
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 857 place count 278 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 858 place count 277 transition count 257
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 860 place count 275 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 860 place count 275 transition count 256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 862 place count 274 transition count 256
Applied a total of 862 rules in 188 ms. Remains 274 /703 variables (removed 429) and now considering 256/653 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 274/703 places, 256/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 256 rows 274 cols
[2023-03-22 15:38:01] [INFO ] Computed 89 place invariants in 1 ms
[2023-03-22 15:38:01] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 15:38:01] [INFO ] [Nat]Absence check using 89 positive place invariants in 45 ms returned sat
[2023-03-22 15:38:01] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 15:38:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 15:38:01] [INFO ] After 134ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 314 ms
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-22 15:38:02] [INFO ] After 1337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-22 15:38:03] [INFO ] After 1977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 44 ms.
Support contains 70 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 256/256 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 255
Applied a total of 2 rules in 30 ms. Remains 273 /274 variables (removed 1) and now considering 255/256 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 273/274 places, 255/256 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 255 rows 273 cols
[2023-03-22 15:38:03] [INFO ] Computed 89 place invariants in 1 ms
[2023-03-22 15:38:03] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:38:03] [INFO ] [Nat]Absence check using 89 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:03] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 15:38:03] [INFO ] After 102ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 19 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 841 ms
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 592 ms
[2023-03-22 15:38:05] [INFO ] After 1620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-22 15:38:05] [INFO ] After 1889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 54 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 255/255 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 273 transition count 254
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 272 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 270 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 270 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 267 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 265 transition count 247
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 265 transition count 247
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 260 transition count 242
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 258 transition count 243
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 258 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 257 transition count 242
Applied a total of 32 rules in 37 ms. Remains 257 /273 variables (removed 16) and now considering 242/255 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 257/273 places, 242/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 367044 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367044 steps, saw 199733 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 242 rows 257 cols
[2023-03-22 15:38:08] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-22 15:38:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:38:08] [INFO ] [Nat]Absence check using 89 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:08] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:08] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-22 15:38:09] [INFO ] After 168ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 7 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-22 15:38:10] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-22 15:38:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 714 ms
[2023-03-22 15:38:10] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-22 15:38:10] [INFO ] After 1574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 54 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 257 /257 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 257/257 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 257 /257 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2023-03-22 15:38:10] [INFO ] Invariant cache hit.
[2023-03-22 15:38:10] [INFO ] Implicit Places using invariants in 247 ms returned [238]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/257 places, 242/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 255 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 241
Applied a total of 2 rules in 13 ms. Remains 255 /256 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 255 cols
[2023-03-22 15:38:10] [INFO ] Computed 88 place invariants in 3 ms
[2023-03-22 15:38:10] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-22 15:38:10] [INFO ] Invariant cache hit.
[2023-03-22 15:38:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 15:38:11] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/257 places, 241/242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 956 ms. Remains : 255/257 places, 241/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 367564 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367564 steps, saw 201983 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 15:38:14] [INFO ] Invariant cache hit.
[2023-03-22 15:38:14] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:38:14] [INFO ] [Nat]Absence check using 88 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:14] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 15:38:14] [INFO ] After 113ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 554 ms
[2023-03-22 15:38:15] [INFO ] After 1095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-22 15:38:15] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 54 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 241/241 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 255/255 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 241/241 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-22 15:38:15] [INFO ] Invariant cache hit.
[2023-03-22 15:38:16] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-22 15:38:16] [INFO ] Invariant cache hit.
[2023-03-22 15:38:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 15:38:16] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-22 15:38:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 15:38:16] [INFO ] Invariant cache hit.
[2023-03-22 15:38:16] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 255/255 places, 241/241 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 255 transition count 241
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 255 transition count 240
Applied a total of 20 rules in 16 ms. Remains 255 /255 variables (removed 0) and now considering 240/241 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 240 rows 255 cols
[2023-03-22 15:38:16] [INFO ] Computed 88 place invariants in 1 ms
[2023-03-22 15:38:16] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:38:16] [INFO ] [Nat]Absence check using 88 positive place invariants in 19 ms returned sat
[2023-03-22 15:38:17] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 15:38:17] [INFO ] After 120ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 465 ms
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 321 ms
[2023-03-22 15:38:18] [INFO ] After 1025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-22 15:38:18] [INFO ] After 1446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:38:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 21 ms.
[2023-03-22 15:38:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 255 places, 241 transitions and 966 arcs took 3 ms.
[2023-03-22 15:38:18] [INFO ] Flatten gal took : 61 ms
Total runtime 30036 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_010B
(NrP: 255 NrTr: 241 NrArc: 966)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec

net check time: 0m 0.000sec

init dd package: 0m 2.919sec


before gc: list nodes free: 882169

after gc: idd nodes used:284907, unused:63715093; list nodes free:288113579

before gc: list nodes free: 781042

after gc: idd nodes used:393502, unused:63606498; list nodes free:287622905
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6131076 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099180 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

313509 411912 350254

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-010B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldIIPt-PT-010B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717700270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;