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

About the Execution of ITS-Tools for HealthRecord-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
210.443 12727.00 8195.00 6448.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r292-tall-162124156200275.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 itstools
Input is HealthRecord-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156200275
=====================================================================

--------------------
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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621281027865

Running Version 0
[2021-05-17 19:50:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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, 3600]
[2021-05-17 19:50:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:50:38] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-17 19:50:38] [INFO ] Transformed 121 places.
[2021-05-17 19:50:38] [INFO ] Transformed 232 transitions.
[2021-05-17 19:50:38] [INFO ] Found NUPN structural information;
[2021-05-17 19:50:38] [INFO ] Parsed PT model containing 121 places and 232 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Normalized transition count is 217 out of 225 initially.
// Phase 1: matrix 217 rows 121 cols
[2021-05-17 19:50:38] [INFO ] Computed 14 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 669 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :6
FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :2
FORMULA net-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :2
FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :3
FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-17 19:50:38] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2021-05-17 19:50:38] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-17 19:50:38] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:50:38] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-17 19:50:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:50:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:50:38] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-17 19:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:50:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:50:38] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 19 ms.
[2021-05-17 19:50:38] [INFO ] Added : 50 causal constraints over 10 iterations in 165 ms. Result :sat
Minimization took 31 ms.
[2021-05-17 19:50:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:50:38] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:50:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:50:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:50:38] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-17 19:50:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:50:38] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 26 ms.
[2021-05-17 19:50:39] [INFO ] Added : 45 causal constraints over 9 iterations in 164 ms. Result :sat
Minimization took 22 ms.
[2021-05-17 19:50:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:50:39] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:50:39] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-17 19:50:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:50:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:50:39] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:50:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-17 19:50:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:50:39] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 15 ms.
[2021-05-17 19:50:39] [INFO ] Added : 45 causal constraints over 9 iterations in 107 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 8100 steps, including 962 resets, run finished after 35 ms. (steps per millisecond=231 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8100 steps, including 264 resets, run finished after 32 ms. (steps per millisecond=253 ) properties (out of 2) seen :2 could not realise parikh vector
FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621281040592

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -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 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HealthRecord-PT-03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156200275"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;