fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r204-oct2-165281599300469
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ServersAndClients-PT-100040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
603.287 41110.00 57960.00 71.40 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/fko/mcc2022-input.r204-oct2-165281599300469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 ServersAndClients-PT-100040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599300469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 5.4K Apr 29 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 29 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.5M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652973311061

Running Version 202205111006
[2022-05-19 15:15:12] [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]
[2022-05-19 15:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:15:12] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2022-05-19 15:15:12] [INFO ] Transformed 4441 places.
[2022-05-19 15:15:12] [INFO ] Transformed 8200 transitions.
[2022-05-19 15:15:12] [INFO ] Parsed PT model containing 4441 places and 8200 transitions in 406 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 8200 rows 4441 cols
[2022-05-19 15:15:12] [INFO ] Computed 241 place invariants in 137 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 16) seen :7
FORMULA ServersAndClients-PT-100040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :2
FORMULA ServersAndClients-PT-100040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :2
FORMULA ServersAndClients-PT-100040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :2
FORMULA ServersAndClients-PT-100040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
FORMULA ServersAndClients-PT-100040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 8200 rows 4441 cols
[2022-05-19 15:15:13] [INFO ] Computed 241 place invariants in 76 ms
[2022-05-19 15:15:13] [INFO ] [Real]Absence check using 141 positive place invariants in 179 ms returned sat
[2022-05-19 15:15:13] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 12 ms returned unsat
[2022-05-19 15:15:14] [INFO ] [Real]Absence check using 141 positive place invariants in 206 ms returned sat
[2022-05-19 15:15:14] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 66 ms returned sat
[2022-05-19 15:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:17] [INFO ] [Real]Absence check using state equation in 3079 ms returned sat
[2022-05-19 15:15:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:15:18] [INFO ] [Nat]Absence check using 141 positive place invariants in 185 ms returned sat
[2022-05-19 15:15:18] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 45 ms returned sat
[2022-05-19 15:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:21] [INFO ] [Nat]Absence check using state equation in 2688 ms returned sat
[2022-05-19 15:15:22] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 336 ms.
[2022-05-19 15:15:23] [INFO ] Added : 1 causal constraints over 1 iterations in 1351 ms. Result :sat
[2022-05-19 15:15:24] [INFO ] [Real]Absence check using 141 positive place invariants in 204 ms returned sat
[2022-05-19 15:15:24] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 46 ms returned sat
[2022-05-19 15:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:27] [INFO ] [Real]Absence check using state equation in 2935 ms returned sat
[2022-05-19 15:15:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:15:27] [INFO ] [Nat]Absence check using 141 positive place invariants in 194 ms returned sat
[2022-05-19 15:15:27] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 82 ms returned sat
[2022-05-19 15:15:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:30] [INFO ] [Nat]Absence check using state equation in 2711 ms returned sat
[2022-05-19 15:15:31] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 642 ms.
[2022-05-19 15:15:32] [INFO ] Added : 1 causal constraints over 1 iterations in 1389 ms. Result :sat
[2022-05-19 15:15:33] [INFO ] [Real]Absence check using 141 positive place invariants in 282 ms returned sat
[2022-05-19 15:15:33] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 47 ms returned sat
[2022-05-19 15:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:36] [INFO ] [Real]Absence check using state equation in 3489 ms returned sat
[2022-05-19 15:15:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:15:38] [INFO ] [Nat]Absence check using 141 positive place invariants in 203 ms returned sat
[2022-05-19 15:15:38] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 60 ms returned sat
[2022-05-19 15:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:41] [INFO ] [Nat]Absence check using state equation in 3220 ms returned sat
[2022-05-19 15:15:42] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 564 ms.
[2022-05-19 15:15:42] [INFO ] Added : 0 causal constraints over 0 iterations in 566 ms. Result :unknown
[2022-05-19 15:15:42] [INFO ] [Real]Absence check using 141 positive place invariants in 177 ms returned sat
[2022-05-19 15:15:42] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 47 ms returned sat
[2022-05-19 15:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:46] [INFO ] [Real]Absence check using state equation in 3305 ms returned sat
[2022-05-19 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:15:47] [INFO ] [Nat]Absence check using 141 positive place invariants in 249 ms returned sat
[2022-05-19 15:15:47] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 44 ms returned sat
[2022-05-19 15:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:15:49] [INFO ] [Nat]Absence check using state equation in 2526 ms returned sat
[2022-05-19 15:15:50] [INFO ] Computed and/alt/rep : 8000/8000/8000 causal constraints (skipped 100 transitions) in 358 ms.
[2022-05-19 15:15:51] [INFO ] Added : 1 causal constraints over 1 iterations in 1170 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[1, 0, 0, 0, 0]
FORMULA ServersAndClients-PT-100040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3998 transitions
Trivial Post-agglo rules discarded 3998 transitions
Performed 3998 trivial Post agglomeration. Transition count delta: 3998
Iterating post reduction 0 with 3998 rules applied. Total rules applied 3998 place count 4441 transition count 4202
Reduce places removed 4036 places and 0 transitions.
Ensure Unique test removed 3700 transitions
Reduce isomorphic transitions removed 3700 transitions.
Iterating post reduction 1 with 7736 rules applied. Total rules applied 11734 place count 405 transition count 502
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 11932 place count 405 transition count 304
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 2 with 294 rules applied. Total rules applied 12226 place count 307 transition count 108
Reduce places removed 294 places and 0 transitions.
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 392 rules applied. Total rules applied 12618 place count 13 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 12620 place count 13 transition count 10
Applied a total of 12620 rules in 154 ms. Remains 13 /4441 variables (removed 4428) and now considering 10/8200 (removed 8190) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/4441 places, 10/8200 transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-19 15:15:51] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 2) seen :2
FORMULA ServersAndClients-PT-100040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ServersAndClients-PT-100040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 39787 ms.

BK_STOP 1652973352171

--------------------
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
+ [[ 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
+ 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 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=@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="ServersAndClients-PT-100040"
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 ServersAndClients-PT-100040, 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 r204-oct2-165281599300469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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