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

About the Execution of 2021-gold for ShieldIIPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
901.308 42936.00 54174.00 365.70 T 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.r234-tall-165286037900176.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 gold2021
Input is ShieldIIPt-PT-020B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-165286037900176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.7K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 338K 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1653032722170

Running Version 0
[2022-05-20 07:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-20 07:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:45:24] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-05-20 07:45:24] [INFO ] Transformed 1403 places.
[2022-05-20 07:45:24] [INFO ] Transformed 1303 transitions.
[2022-05-20 07:45:24] [INFO ] Found NUPN structural information;
[2022-05-20 07:45:24] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 174 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.25357KB memory used
Starting structural reductions, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 1403 transition count 961
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 344 rules applied. Total rules applied 686 place count 1061 transition count 959
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 687 place count 1060 transition count 959
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 687 place count 1060 transition count 878
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 849 place count 979 transition count 878
Discarding 140 places :
Symmetric choice reduction at 3 with 140 rule applications. Total rules 989 place count 839 transition count 738
Iterating global reduction 3 with 140 rules applied. Total rules applied 1129 place count 839 transition count 738
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 1129 place count 839 transition count 678
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 1249 place count 779 transition count 678
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1927 place count 440 transition count 339
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 2045 place count 381 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2046 place count 380 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2048 place count 378 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2048 place count 378 transition count 376
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2050 place count 377 transition count 376
Applied a total of 2050 rules in 367 ms. Remains 377 /1403 variables (removed 1026) and now considering 376/1303 (removed 927) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/1403 places, 376/1303 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5039 ms (no deadlock found). (steps per millisecond=248 )
Random directed walk for 1250000 steps, including 0 resets, run took 3936 ms (no deadlock found). (steps per millisecond=317 )
// Phase 1: matrix 376 rows 377 cols
[2022-05-20 07:45:33] [INFO ] Computed 179 place invariants in 12 ms
[2022-05-20 07:45:33] [INFO ] [Real]Absence check using 179 positive place invariants in 58 ms returned sat
[2022-05-20 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:34] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-20 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:34] [INFO ] [Nat]Absence check using 179 positive place invariants in 58 ms returned sat
[2022-05-20 07:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:34] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-20 07:45:34] [INFO ] Computed and/alt/rep : 372/568/372 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-20 07:45:36] [INFO ] Added : 309 causal constraints over 63 iterations in 2244 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Parikh directed walk for 112200 steps, including 452 resets, run took 528 ms. (steps per millisecond=212 )
Random directed walk for 500002 steps, including 0 resets, run took 1483 ms (no deadlock found). (steps per millisecond=337 )
Random walk for 500000 steps, including 0 resets, run took 1934 ms (no deadlock found). (steps per millisecond=258 )
Random directed walk for 500001 steps, including 0 resets, run took 1436 ms (no deadlock found). (steps per millisecond=348 )
Random walk for 500000 steps, including 0 resets, run took 1908 ms (no deadlock found). (steps per millisecond=262 )
Starting structural reductions, iteration 0 : 377/377 places, 376/376 transitions.
Applied a total of 0 rules in 12 ms. Remains 377 /377 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 377 cols
[2022-05-20 07:45:44] [INFO ] Computed 179 place invariants in 5 ms
[2022-05-20 07:45:44] [INFO ] Implicit Places using invariants in 220 ms returned [366]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
[2022-05-20 07:45:44] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 376 rows 376 cols
[2022-05-20 07:45:44] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-20 07:45:44] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Starting structural reductions, iteration 1 : 376/377 places, 376/376 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 375 transition count 375
Applied a total of 2 rules in 14 ms. Remains 375 /376 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 375 cols
[2022-05-20 07:45:44] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-20 07:45:45] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 375 rows 375 cols
[2022-05-20 07:45:45] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-20 07:45:45] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 375/377 places, 375/376 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4856 ms (no deadlock found). (steps per millisecond=257 )
Random directed walk for 1250002 steps, including 0 resets, run took 3514 ms (no deadlock found). (steps per millisecond=355 )
// Phase 1: matrix 375 rows 375 cols
[2022-05-20 07:45:53] [INFO ] Computed 178 place invariants in 5 ms
[2022-05-20 07:45:53] [INFO ] [Real]Absence check using 178 positive place invariants in 46 ms returned sat
[2022-05-20 07:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:54] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-05-20 07:45:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:54] [INFO ] [Nat]Absence check using 178 positive place invariants in 46 ms returned sat
[2022-05-20 07:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:54] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-05-20 07:45:54] [INFO ] Computed and/alt/rep : 371/565/371 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-20 07:45:56] [INFO ] Added : 312 causal constraints over 63 iterations in 2233 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Parikh directed walk for 155300 steps, including 314 resets, run took 725 ms. (steps per millisecond=214 )
Random directed walk for 500004 steps, including 0 resets, run took 1404 ms (no deadlock found). (steps per millisecond=356 )
Random walk for 500000 steps, including 0 resets, run took 1890 ms (no deadlock found). (steps per millisecond=264 )
Random directed walk for 500002 steps, including 0 resets, run took 1371 ms (no deadlock found). (steps per millisecond=364 )
Finished random walk after 489658 steps, including 0 resets, run found a deadlock after 1855 ms. (steps per millisecond=263 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK

BK_STOP 1653032765106

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ShieldIIPt-PT-020B, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-165286037900176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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