Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r448-tajo-167905989700168.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldRVt-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905989700168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 119K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679476804986

Running Version 202205111006
[2023-03-22 09:20:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-22 09:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:20:06] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-22 09:20:06] [INFO ] Transformed 503 places.
[2023-03-22 09:20:06] [INFO ] Transformed 503 transitions.
[2023-03-22 09:20:06] [INFO ] Found NUPN structural information;
[2023-03-22 09:20:06] [INFO ] Parsed PT model containing 503 places and 503 transitions in 204 ms.
Structural test allowed to assert that 201 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 302) seen :244
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Running SMT prover for 58 properties.
// Phase 1: matrix 503 rows 503 cols
[2023-03-22 09:20:07] [INFO ] Computed 41 place invariants in 17 ms
[2023-03-22 09:20:08] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:58
[2023-03-22 09:20:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-22 09:20:09] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :58
[2023-03-22 09:20:09] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 5 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 945 ms
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-22 09:20:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-22 09:20:11] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2023-03-22 09:20:11] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2023-03-22 09:20:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-03-22 09:20:11] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2023-03-22 09:20:11] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2023-03-22 09:20:11] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 1 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-22 09:20:12] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1540 ms
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 5 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2023-03-22 09:20:13] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-03-22 09:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2023-03-22 09:20:14] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2023-03-22 09:20:15] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2023-03-22 09:20:15] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-22 09:20:15] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2023-03-22 09:20:15] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2023-03-22 09:20:15] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2023-03-22 09:20:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1596 ms
[2023-03-22 09:20:16] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2023-03-22 09:20:17] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2023-03-22 09:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-22 09:20:17] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-22 09:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-22 09:20:17] [INFO ] After 8632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :58
Attempting to minimize the solution found.
Minimization took 990 ms.
[2023-03-22 09:20:18] [INFO ] After 10442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :58
Fused 58 Parikh solutions to 51 different solutions.
Parikh walk visited 0 properties in 8300 ms.
Support contains 58 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 503 transition count 355
Reduce places removed 148 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 150 rules applied. Total rules applied 298 place count 355 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 354 transition count 353
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 299 place count 354 transition count 317
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 371 place count 318 transition count 317
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 419 place count 270 transition count 269
Iterating global reduction 3 with 48 rules applied. Total rules applied 467 place count 270 transition count 269
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 467 place count 270 transition count 252
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 501 place count 253 transition count 252
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 691 place count 158 transition count 157
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 735 place count 136 transition count 174
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 736 place count 136 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 136 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 135 transition count 172
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 740 place count 135 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 741 place count 134 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 742 place count 133 transition count 171
Applied a total of 742 rules in 103 ms. Remains 133 /503 variables (removed 370) and now considering 171/503 (removed 332) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/503 places, 171/503 transitions.
Finished random walk after 1282 steps, including 0 resets, run visited all 58 properties in 44 ms. (steps per millisecond=29 )
Able to resolve query StableMarking after proving 303 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 20735 ms.

BK_STOP 1679476826995

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2022"
echo " Input is ShieldRVt-PT-010B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r448-tajo-167905989700168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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