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-165286033800092.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 ShieldIIPs-PT-050A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286033800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.8K Apr 29 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 426K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1653032382639

Running Version 202205111006
[2022-05-20 07:39:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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 07:39:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:39:44] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-05-20 07:39:44] [INFO ] Transformed 1253 places.
[2022-05-20 07:39:44] [INFO ] Transformed 1203 transitions.
[2022-05-20 07:39:44] [INFO ] Found NUPN structural information;
[2022-05-20 07:39:44] [INFO ] Parsed PT model containing 1253 places and 1203 transitions in 292 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 26 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 245 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-20 07:39:44] [INFO ] Computed 451 place invariants in 29 ms
[2022-05-20 07:39:45] [INFO ] Implicit Places using invariants in 909 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 939 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 43 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Discarding 300 transitions out of 1201. Remains 901
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1227 ms. (steps per millisecond=8 ) properties (out of 900) seen :836
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 64) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :0
Running SMT prover for 62 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-20 07:39:47] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-20 07:39:49] [INFO ] [Real]Absence check using 450 positive place invariants in 72 ms returned sat
[2022-05-20 07:39:56] [INFO ] After 8474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:62
[2022-05-20 07:39:57] [INFO ] [Nat]Absence check using 450 positive place invariants in 67 ms returned sat
[2022-05-20 07:40:08] [INFO ] After 9828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :62
[2022-05-20 07:40:09] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 9 ms to minimize.
[2022-05-20 07:40:09] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2022-05-20 07:40:09] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2022-05-20 07:40:09] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-05-20 07:40:09] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2022-05-20 07:40:10] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-20 07:40:11] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2022-05-20 07:40:11] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2022-05-20 07:40:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2176 ms
[2022-05-20 07:40:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2022-05-20 07:40:12] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2022-05-20 07:40:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2022-05-20 07:40:12] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2022-05-20 07:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-20 07:40:13] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 3 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2022-05-20 07:40:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1103 ms
[2022-05-20 07:40:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-05-20 07:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-20 07:40:17] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2022-05-20 07:40:17] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-05-20 07:40:17] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2022-05-20 07:40:17] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-20 07:40:17] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2022-05-20 07:40:18] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2022-05-20 07:40:18] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-20 07:40:18] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-05-20 07:40:18] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-20 07:40:18] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2022-05-20 07:40:19] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-05-20 07:40:19] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2022-05-20 07:40:19] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-20 07:40:19] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-05-20 07:40:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2646 ms
[2022-05-20 07:40:19] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2022-05-20 07:40:19] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-05-20 07:40:20] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-05-20 07:40:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 304 ms
[2022-05-20 07:40:20] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-20 07:40:20] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-20 07:40:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2022-05-20 07:40:21] [INFO ] After 22187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :61
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-20 07:40:21] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :61
Parikh walk visited 8 properties in 31125 ms.
Support contains 150 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 254 times.
Drop transitions removed 254 transitions
Iterating global reduction 0 with 254 rules applied. Total rules applied 254 place count 1250 transition count 1201
Applied a total of 254 rules in 166 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Finished random walk after 39770 steps, including 13 resets, run visited all 54 properties in 1092 ms. (steps per millisecond=36 )
Able to resolve query QuasiLiveness after proving 901 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 69805 ms.

BK_STOP 1653032453686

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -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 QuasiLiveness -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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldIIPs-PT-050A, examination is QuasiLiveness"
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-165286033800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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