fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918400359
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
260.275 7870.00 16814.00 76.00 FFFFTFTTTTTFTFTT normal

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.r024-tall-165251918400359.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 BusinessProcesses-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 29 23:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 29 23:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 29 23:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K 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

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

=== Now, execution of the tool begins

BK_START 1654200485745

Running Version 202205111006
[2022-06-02 20:08:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2022-06-02 20:08:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:08:07] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-06-02 20:08:07] [INFO ] Transformed 368 places.
[2022-06-02 20:08:07] [INFO ] Transformed 319 transitions.
[2022-06-02 20:08:07] [INFO ] Found NUPN structural information;
[2022-06-02 20:08:07] [INFO ] Parsed PT model containing 368 places and 319 transitions in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 97 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :4
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 318 rows 367 cols
[2022-06-02 20:08:08] [INFO ] Computed 57 place invariants in 26 ms
[2022-06-02 20:08:08] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 20:08:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-06-02 20:08:08] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2022-06-02 20:08:09] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 4 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2022-06-02 20:08:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 674 ms
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 370 ms
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:08:10] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 1 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 0 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:08:11] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 0 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 97 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 4 ms to minimize.
[2022-06-02 20:08:12] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2022-06-02 20:08:13] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:08:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 2471 ms
[2022-06-02 20:08:13] [INFO ] After 4223ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-06-02 20:08:13] [INFO ] After 4562ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 4199 steps, including 34 resets, run visited all 1 properties in 12 ms. (steps per millisecond=349 )
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 404 ms.
All properties solved without resorting to model-checking.
Total runtime 6647 ms.

BK_STOP 1654200493615

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityFireability -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=@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="BusinessProcesses-PT-05"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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