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-167903718100639.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 ShieldPPPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718100639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 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.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 ShieldPPPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679526732870

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 23:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:12:15] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-22 23:12:15] [INFO ] Transformed 1563 places.
[2023-03-22 23:12:15] [INFO ] Transformed 1423 transitions.
[2023-03-22 23:12:15] [INFO ] Found NUPN structural information;
[2023-03-22 23:12:15] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-22 23:12:15] [INFO ] Computed 221 place invariants in 17 ms
[2023-03-22 23:12:16] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 23:12:17] [INFO ] [Nat]Absence check using 221 positive place invariants in 106 ms returned sat
[2023-03-22 23:12:19] [INFO ] After 1906ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-22 23:12:20] [INFO ] Deduced a trap composed of 32 places in 600 ms of which 11 ms to minimize.
[2023-03-22 23:12:21] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 3 ms to minimize.
[2023-03-22 23:12:21] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2023-03-22 23:12:21] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 1 ms to minimize.
[2023-03-22 23:12:22] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 1 ms to minimize.
[2023-03-22 23:12:22] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 4 ms to minimize.
[2023-03-22 23:12:23] [INFO ] Deduced a trap composed of 44 places in 340 ms of which 1 ms to minimize.
[2023-03-22 23:12:23] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 1 ms to minimize.
[2023-03-22 23:12:23] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 0 ms to minimize.
[2023-03-22 23:12:24] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 2 ms to minimize.
[2023-03-22 23:12:24] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 0 ms to minimize.
[2023-03-22 23:12:24] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 2 ms to minimize.
[2023-03-22 23:12:25] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 0 ms to minimize.
[2023-03-22 23:12:25] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-22 23:12:26] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2023-03-22 23:12:26] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 1 ms to minimize.
[2023-03-22 23:12:26] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:12:27] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 0 ms to minimize.
[2023-03-22 23:12:27] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 0 ms to minimize.
[2023-03-22 23:12:27] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 2 ms to minimize.
[2023-03-22 23:12:28] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 1 ms to minimize.
[2023-03-22 23:12:28] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 1 ms to minimize.
[2023-03-22 23:12:28] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 1 ms to minimize.
[2023-03-22 23:12:29] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 1 ms to minimize.
[2023-03-22 23:12:29] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2023-03-22 23:12:29] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 0 ms to minimize.
[2023-03-22 23:12:30] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2023-03-22 23:12:30] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 1 ms to minimize.
[2023-03-22 23:12:30] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2023-03-22 23:12:31] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 1 ms to minimize.
[2023-03-22 23:12:31] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2023-03-22 23:12:31] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 0 ms to minimize.
[2023-03-22 23:12:31] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 0 ms to minimize.
[2023-03-22 23:12:32] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 0 ms to minimize.
[2023-03-22 23:12:32] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 1 ms to minimize.
[2023-03-22 23:12:32] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 12707 ms
[2023-03-22 23:12:33] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 1 ms to minimize.
[2023-03-22 23:12:33] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 0 ms to minimize.
[2023-03-22 23:12:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-22 23:12:33] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 1 ms to minimize.
[2023-03-22 23:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2023-03-22 23:12:34] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 0 ms to minimize.
[2023-03-22 23:12:34] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 1 ms to minimize.
[2023-03-22 23:12:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 696 ms
[2023-03-22 23:12:35] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 1 ms to minimize.
[2023-03-22 23:12:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2023-03-22 23:12:36] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 0 ms to minimize.
[2023-03-22 23:12:36] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 3 ms to minimize.
[2023-03-22 23:12:37] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:12:37] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 1 ms to minimize.
[2023-03-22 23:12:37] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2023-03-22 23:12:38] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 1 ms to minimize.
[2023-03-22 23:12:38] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 0 ms to minimize.
[2023-03-22 23:12:38] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2023-03-22 23:12:38] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-22 23:12:39] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 1 ms to minimize.
[2023-03-22 23:12:39] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-22 23:12:40] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 0 ms to minimize.
[2023-03-22 23:12:40] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 1 ms to minimize.
[2023-03-22 23:12:40] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 1 ms to minimize.
[2023-03-22 23:12:40] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 5 ms to minimize.
[2023-03-22 23:12:41] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2023-03-22 23:12:41] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 0 ms to minimize.
[2023-03-22 23:12:41] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2023-03-22 23:12:41] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5904 ms
[2023-03-22 23:12:41] [INFO ] After 23876ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 23:12:41] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 301 ms.
Support contains 96 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 1563 transition count 1110
Reduce places removed 313 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 340 rules applied. Total rules applied 653 place count 1250 transition count 1083
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 680 place count 1223 transition count 1083
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 680 place count 1223 transition count 1006
Deduced a syphon composed of 77 places in 22 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 834 place count 1146 transition count 1006
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 954 place count 1026 transition count 886
Iterating global reduction 3 with 120 rules applied. Total rules applied 1074 place count 1026 transition count 886
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 3 with 2 rules applied. Total rules applied 1076 place count 1026 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1077 place count 1025 transition count 884
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1077 place count 1025 transition count 844
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1157 place count 985 transition count 844
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 5 with 620 rules applied. Total rules applied 1777 place count 675 transition count 534
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1861 place count 633 transition count 534
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1864 place count 633 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1867 place count 630 transition count 531
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 6 with 51 rules applied. Total rules applied 1918 place count 630 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1919 place count 629 transition count 530
Applied a total of 1919 rules in 475 ms. Remains 629 /1563 variables (removed 934) and now considering 530/1423 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 629/1563 places, 530/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 9) seen :2
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 530 rows 629 cols
[2023-03-22 23:12:43] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-22 23:12:43] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 23:12:43] [INFO ] [Nat]Absence check using 221 positive place invariants in 59 ms returned sat
[2023-03-22 23:12:44] [INFO ] After 737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 23:12:44] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-22 23:12:44] [INFO ] After 441ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 23:12:45] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-22 23:12:45] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-22 23:12:45] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-22 23:12:45] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-22 23:12:45] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-22 23:12:45] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-22 23:12:46] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 4 ms to minimize.
[2023-03-22 23:12:46] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-22 23:12:46] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2023-03-22 23:12:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1567 ms
[2023-03-22 23:12:46] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 13 ms to minimize.
[2023-03-22 23:12:46] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 0 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 13 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-22 23:12:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1365 ms
[2023-03-22 23:12:48] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-22 23:12:48] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-22 23:12:48] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 0 ms to minimize.
[2023-03-22 23:12:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 709 ms
[2023-03-22 23:12:49] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-22 23:12:49] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-22 23:12:49] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-03-22 23:12:49] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-22 23:12:50] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-22 23:12:50] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-22 23:12:50] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2023-03-22 23:12:50] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-22 23:12:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1574 ms
[2023-03-22 23:12:50] [INFO ] After 6238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 534 ms.
[2023-03-22 23:12:51] [INFO ] After 7899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 201 ms.
Support contains 88 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 530/530 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 629 transition count 528
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 627 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 626 transition count 527
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 624 transition count 525
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
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 16 place count 621 transition count 524
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 621 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 620 transition count 523
Applied a total of 18 rules in 83 ms. Remains 620 /629 variables (removed 9) and now considering 523/530 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 620/629 places, 523/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 146416 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146416 steps, saw 112338 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 523 rows 620 cols
[2023-03-22 23:12:55] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-22 23:12:55] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 23:12:55] [INFO ] [Nat]Absence check using 221 positive place invariants in 293 ms returned sat
[2023-03-22 23:12:56] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 23:12:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 23:12:56] [INFO ] After 399ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 23:12:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-22 23:12:57] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-22 23:12:57] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-22 23:12:57] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2023-03-22 23:12:57] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2023-03-22 23:12:57] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2023-03-22 23:12:57] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-22 23:12:58] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-22 23:12:58] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-22 23:12:58] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-22 23:12:58] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-22 23:12:58] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-22 23:12:58] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-22 23:12:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2264 ms
[2023-03-22 23:12:59] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2023-03-22 23:12:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-22 23:12:59] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-03-22 23:13:00] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2023-03-22 23:13:00] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-22 23:13:00] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-22 23:13:00] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-22 23:13:00] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2023-03-22 23:13:00] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-22 23:13:01] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-22 23:13:01] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-22 23:13:01] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-22 23:13:01] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-22 23:13:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1916 ms
[2023-03-22 23:13:01] [INFO ] After 5382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 495 ms.
[2023-03-22 23:13:02] [INFO ] After 6998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 114 ms.
Support contains 88 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 523/523 transitions.
Applied a total of 0 rules in 12 ms. Remains 620 /620 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 620/620 places, 523/523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 523/523 transitions.
Applied a total of 0 rules in 11 ms. Remains 620 /620 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-22 23:13:02] [INFO ] Invariant cache hit.
[2023-03-22 23:13:02] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-22 23:13:02] [INFO ] Invariant cache hit.
[2023-03-22 23:13:03] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-22 23:13:03] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2023-03-22 23:13:03] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-22 23:13:03] [INFO ] Invariant cache hit.
[2023-03-22 23:13:04] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1827 ms. Remains : 620/620 places, 523/523 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 620 transition count 523
Applied a total of 86 rules in 25 ms. Remains 620 /620 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 523 rows 620 cols
[2023-03-22 23:13:04] [INFO ] Computed 221 place invariants in 5 ms
[2023-03-22 23:13:04] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 23:13:04] [INFO ] [Nat]Absence check using 221 positive place invariants in 46 ms returned sat
[2023-03-22 23:13:05] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 23:13:05] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-22 23:13:05] [INFO ] After 504ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-22 23:13:06] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 14 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-22 23:13:07] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-22 23:13:08] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-22 23:13:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2301 ms
[2023-03-22 23:13:08] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-22 23:13:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-22 23:13:09] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-22 23:13:09] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2023-03-22 23:13:09] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-22 23:13:09] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-22 23:13:09] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-03-22 23:13:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1917 ms
[2023-03-22 23:13:10] [INFO ] After 5534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 428 ms.
[2023-03-22 23:13:11] [INFO ] After 6937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 23:13:11] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-22 23:13:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 620 places, 523 transitions and 2032 arcs took 12 ms.
[2023-03-22 23:13:11] [INFO ] Flatten gal took : 109 ms
Total runtime 56844 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPt_PT_020B
(NrP: 620 NrTr: 523 NrArc: 2032)

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

net check time: 0m 0.000sec

init dd package: 0m 2.817sec


before gc: list nodes free: 1161684

after gc: idd nodes used:454210, unused:63545790; list nodes free:279019754

before gc: list nodes free: 1230554

after gc: idd nodes used:589010, unused:63410990; list nodes free:278409826

before gc: list nodes free: 1168388

after gc: idd nodes used:531458, unused:63468542; list nodes free:278671377

before gc: list nodes free: 1830359

after gc: idd nodes used:490962, unused:63509038; list nodes free:278854309

before gc: list nodes free: 1587772

after gc: idd nodes used:525330, unused:63474670; list nodes free:278700125

before gc: list nodes free: 700128

after gc: idd nodes used:671386, unused:63328614; list nodes free:278041630

before gc: list nodes free: 1128220

after gc: idd nodes used:683082, unused:63316918; list nodes free:277988877

before gc: list nodes free: 1702064

after gc: idd nodes used:635602, unused:63364398; list nodes free:278207583
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6193572 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097512 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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.002sec

529015 1008201

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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPt-PT-020B, examination is ReachabilityFireability"
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-167903718100639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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