Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 370K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1653037985666

Running Version 202205111006
[2022-05-20 09:13: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]
[2022-05-20 09:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:13:07] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2022-05-20 09:13:07] [INFO ] Transformed 1203 places.
[2022-05-20 09:13:07] [INFO ] Transformed 1353 transitions.
[2022-05-20 09:13:07] [INFO ] Found NUPN structural information;
[2022-05-20 09:13:07] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 286 ms.
Structural test allowed to assert that 571 places are NOT stable. Took 13 ms.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 632) seen :533
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 99) 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 99) 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 99) 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 99) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 99) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 99) 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 99) 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 99) 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 99) 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 99) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) 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 98) 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 98) 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 98) 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 98) 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 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) 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 98) 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 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) 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 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 98) 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 98) 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 98) 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 98) 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 98) seen :0
Running SMT prover for 98 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2022-05-20 09:13:08] [INFO ] Computed 121 place invariants in 21 ms
[2022-05-20 09:13:10] [INFO ] After 2466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:98
[2022-05-20 09:13:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2022-05-20 09:13:20] [INFO ] After 5978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :98
[2022-05-20 09:13:20] [INFO ] Deduced a trap composed of 19 places in 443 ms of which 4 ms to minimize.
[2022-05-20 09:13:21] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 1 ms to minimize.
[2022-05-20 09:13:21] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 1 ms to minimize.
[2022-05-20 09:13:22] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 1 ms to minimize.
[2022-05-20 09:13:22] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 2 ms to minimize.
[2022-05-20 09:13:22] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 1 ms to minimize.
[2022-05-20 09:13:23] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2022-05-20 09:13:23] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 0 ms to minimize.
[2022-05-20 09:13:23] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 0 ms to minimize.
[2022-05-20 09:13:24] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 1 ms to minimize.
[2022-05-20 09:13:24] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 1 ms to minimize.
[2022-05-20 09:13:24] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2022-05-20 09:13:24] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 0 ms to minimize.
[2022-05-20 09:13:25] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2022-05-20 09:13:25] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2022-05-20 09:13:25] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2022-05-20 09:13:25] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2022-05-20 09:13:26] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 0 ms to minimize.
[2022-05-20 09:13:26] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2022-05-20 09:13:26] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 09:13:26] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 1 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 0 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 1 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2022-05-20 09:13:27] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 0 ms to minimize.
[2022-05-20 09:13:28] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:29] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 0 ms to minimize.
[2022-05-20 09:13:29] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:13:29] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8743 ms
[2022-05-20 09:13:30] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-20 09:13:31] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 0 ms to minimize.
[2022-05-20 09:13:31] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2022-05-20 09:13:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2022-05-20 09:13:31] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2022-05-20 09:13:32] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 1 ms to minimize.
[2022-05-20 09:13:32] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 1 ms to minimize.
[2022-05-20 09:13:32] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 0 ms to minimize.
[2022-05-20 09:13:33] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2022-05-20 09:13:33] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 1 ms to minimize.
[2022-05-20 09:13:33] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 1 ms to minimize.
[2022-05-20 09:13:34] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 0 ms to minimize.
[2022-05-20 09:13:34] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 0 ms to minimize.
[2022-05-20 09:13:34] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 0 ms to minimize.
[2022-05-20 09:13:35] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2022-05-20 09:13:35] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 1 ms to minimize.
[2022-05-20 09:13:35] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 1 ms to minimize.
[2022-05-20 09:13:35] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 0 ms to minimize.
[2022-05-20 09:13:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 09:13:35] [INFO ] After 25224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:98
Parikh walk visited 0 properties in 30042 ms.
Support contains 98 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1203 transition count 1232
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 1082 transition count 1232
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 1082 transition count 1082
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 932 transition count 1082
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 686 place count 788 transition count 938
Iterating global reduction 2 with 144 rules applied. Total rules applied 830 place count 788 transition count 938
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 830 place count 788 transition count 848
Deduced a syphon composed of 90 places in 10 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1010 place count 698 transition count 848
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 7 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 1366 place count 520 transition count 670
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1428 place count 520 transition count 670
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1429 place count 519 transition count 669
Applied a total of 1429 rules in 440 ms. Remains 519 /1203 variables (removed 684) and now considering 669/1353 (removed 684) transitions.
Finished structural reductions, in 1 iterations. Remains : 519/1203 places, 669/1353 transitions.
Finished random walk after 13165 steps, including 34 resets, run visited all 98 properties in 346 ms. (steps per millisecond=38 )
Able to resolve query StableMarking after proving 633 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 59996 ms.

BK_STOP 1653038046907

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldRVs-PT-030B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-030B, 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 r229-tall-165286034500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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