fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171200139
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for HealthRecord-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
234.571 7798.00 11891.00 660.30 FTTFTTTTTFFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171200139.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is HealthRecord-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.9K May 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 35K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME net-ReachabilityCardinality-00
FORMULA_NAME net-ReachabilityCardinality-01
FORMULA_NAME net-ReachabilityCardinality-02
FORMULA_NAME net-ReachabilityCardinality-03
FORMULA_NAME net-ReachabilityCardinality-04
FORMULA_NAME net-ReachabilityCardinality-05
FORMULA_NAME net-ReachabilityCardinality-06
FORMULA_NAME net-ReachabilityCardinality-07
FORMULA_NAME net-ReachabilityCardinality-08
FORMULA_NAME net-ReachabilityCardinality-09
FORMULA_NAME net-ReachabilityCardinality-10
FORMULA_NAME net-ReachabilityCardinality-11
FORMULA_NAME net-ReachabilityCardinality-12
FORMULA_NAME net-ReachabilityCardinality-13
FORMULA_NAME net-ReachabilityCardinality-14
FORMULA_NAME net-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621341068047

[2021-05-18 12:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:31:10] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-18 12:31:10] [INFO ] Transformed 121 places.
[2021-05-18 12:31:10] [INFO ] Transformed 232 transitions.
[2021-05-18 12:31:10] [INFO ] Found NUPN structural information;
[2021-05-18 12:31:10] [INFO ] Parsed PT model containing 121 places and 232 transitions in 85 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 673 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0]
FORMULA net-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA net-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-18 12:31:10] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2021-05-18 12:31:10] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 12:31:10] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:31:10] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:10] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:31:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:31:10] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:31:10] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 19 ms.
[2021-05-18 12:31:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 39 ms returned sat
[2021-05-18 12:31:11] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-18 12:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:11] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-18 12:31:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:31:11] [INFO ] Deduced a trap composed of 41 places in 81 ms
[2021-05-18 12:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-18 12:31:11] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 14 ms.
[2021-05-18 12:31:11] [INFO ] Added : 108 causal constraints over 22 iterations in 496 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-18 12:31:11] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:31:11] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 12:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:11] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-18 12:31:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 68 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned unsat
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned unsat
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-18 12:31:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:12] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 24 ms.
[2021-05-18 12:31:12] [INFO ] Added : 97 causal constraints over 20 iterations in 367 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:12] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:12] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 14 ms.
[2021-05-18 12:31:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:31:13] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-18 12:31:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:31:13] [INFO ] Computed and/alt/rep : 224/1388/216 causal constraints in 16 ms.
[2021-05-18 12:31:13] [INFO ] Added : 122 causal constraints over 25 iterations in 374 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA net-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 13000 steps, including 465 resets, run finished after 54 ms. (steps per millisecond=240 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7400 steps, including 246 resets, run finished after 26 ms. (steps per millisecond=284 ) properties seen :[1, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11400 steps, including 687 resets, run finished after 40 ms. (steps per millisecond=285 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 178 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (complete) has 429 edges and 116 vertex of which 109 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 109 transition count 201
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 31 place count 104 transition count 194
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 102 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 34 place count 102 transition count 191
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 99 transition count 191
Symmetric choice reduction at 3 with 52 rule applications. Total rules 91 place count 99 transition count 191
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 104 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 195 place count 47 transition count 87
Symmetric choice reduction at 3 with 10 rule applications. Total rules 205 place count 47 transition count 87
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 225 place count 37 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 229 place count 37 transition count 63
Symmetric choice reduction at 4 with 3 rule applications. Total rules 232 place count 37 transition count 63
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 238 place count 34 transition count 54
Symmetric choice reduction at 4 with 3 rule applications. Total rules 241 place count 34 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 247 place count 31 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 250 place count 31 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 30 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 262 place count 25 transition count 68
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 25 transition count 113
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 266 place count 24 transition count 111
Symmetric choice reduction at 6 with 1 rule applications. Total rules 267 place count 24 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 25 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 269 place count 23 transition count 86
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 23 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 22 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 276 place count 22 transition count 79
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 284 place count 22 transition count 79
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 291 place count 22 transition count 79
Applied a total of 291 rules in 52 ms. Remains 22 /121 variables (removed 99) and now considering 79/225 (removed 146) transitions.
[2021-05-18 12:31:13] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
// Phase 1: matrix 65 rows 22 cols
[2021-05-18 12:31:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-18 12:31:13] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned [71, 72, 73, 74, 75, 76, 77, 78]
Found 8 dead transitions using SMT.
Drop transitions removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions :[78, 77, 76, 75, 74, 73, 72, 71]
Starting structural reductions, iteration 1 : 22/121 places, 71/225 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 74 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Applied a total of 1 rules in 3 ms. Remains 21 /22 variables (removed 1) and now considering 71/71 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/121 places, 71/225 transitions.
Finished random walk after 3506 steps, including 854 resets, run visited all 1 properties in 14 ms. (steps per millisecond=250 )
FORMULA net-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341075845

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="HealthRecord-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is HealthRecord-PT-03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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