fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r016-tajo-165245743500268
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AutoFlight-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
259.852 29445.00 53114.00 25.20 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r016-tajo-165245743500268.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743500268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 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 1652772721735

Running Version 202205111006
[2022-05-17 07:32:02] [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-17 07:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:32:03] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-17 07:32:03] [INFO ] Transformed 390 places.
[2022-05-17 07:32:03] [INFO ] Transformed 388 transitions.
[2022-05-17 07:32:03] [INFO ] Found NUPN structural information;
[2022-05-17 07:32:03] [INFO ] Parsed PT model containing 390 places and 388 transitions in 167 ms.
Structural test allowed to assert that 231 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 159) seen :69
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 90) 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 90) 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 90) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 90) 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 90) 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 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 90) 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 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 90) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 90) 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 90) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 90) 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 90) 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 90) 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 90) 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 90) 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 90) 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 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 90) 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 90) 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 90) 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 90) seen :0
Running SMT prover for 90 properties.
// Phase 1: matrix 388 rows 390 cols
[2022-05-17 07:32:03] [INFO ] Computed 28 place invariants in 16 ms
[2022-05-17 07:32:04] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:90
[2022-05-17 07:32:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-05-17 07:32:05] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-17 07:32:06] [INFO ] After 1289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :90
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 5 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 1 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 543 ms
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2022-05-17 07:32:07] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-17 07:32:08] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2022-05-17 07:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 525 ms
[2022-05-17 07:32:09] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 0 ms to minimize.
[2022-05-17 07:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 07:32:10] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:32:10] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:32:10] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:32:10] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2022-05-17 07:32:11] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:32:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 430 ms
[2022-05-17 07:32:11] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2022-05-17 07:32:11] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2022-05-17 07:32:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2022-05-17 07:32:11] [INFO ] After 5951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :90
Attempting to minimize the solution found.
Minimization took 982 ms.
[2022-05-17 07:32:12] [INFO ] After 7829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :90
Fused 90 Parikh solutions to 89 different solutions.
Parikh walk visited 87 properties in 18435 ms.
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 390 transition count 239
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 176 rules applied. Total rules applied 325 place count 241 transition count 212
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 333 place count 233 transition count 212
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 333 place count 233 transition count 159
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 439 place count 180 transition count 159
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 474 place count 145 transition count 124
Iterating global reduction 3 with 35 rules applied. Total rules applied 509 place count 145 transition count 124
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 509 place count 145 transition count 112
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 533 place count 133 transition count 112
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 599 place count 100 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 600 place count 100 transition count 78
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 616 place count 100 transition count 62
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 632 place count 84 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 633 place count 83 transition count 61
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 29 rules applied. Total rules applied 662 place count 69 transition count 46
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 677 place count 54 transition count 46
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 677 place count 54 transition count 31
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 707 place count 39 transition count 31
Applied a total of 707 rules in 73 ms. Remains 39 /390 variables (removed 351) and now considering 31/388 (removed 357) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/390 places, 31/388 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Able to resolve query StableMarking after proving 160 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 28203 ms.

BK_STOP 1652772751180

--------------------
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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r016-tajo-165245743500268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b 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 ;