fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r201-csrt-159033401400376
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.190 1800000.00 16496.00 237.40 F normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r201-csrt-159033401400376.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Vasy2003-PT-none, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-csrt-159033401400376
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.7K Apr 12 20:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 20:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 15 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 22:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 207K Mar 24 05:38 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 1591251747919

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:22:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 1800, -rebuildPNML]
[2020-06-04 06:22:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:22:31] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2020-06-04 06:22:31] [INFO ] Transformed 485 places.
[2020-06-04 06:22:31] [INFO ] Transformed 776 transitions.
[2020-06-04 06:22:31] [INFO ] Found NUPN structural information;
[2020-06-04 06:22:31] [INFO ] Parsed PT model containing 485 places and 776 transitions in 214 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 23 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.18459KB memory used
Starting structural reductions, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 167 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 483 transition count 749
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 482 transition count 749
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 5 place count 482 transition count 730
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 43 place count 463 transition count 730
Symmetric choice reduction at 2 with 144 rule applications. Total rules 187 place count 463 transition count 730
Deduced a syphon composed of 144 places in 2 ms
Reduce places removed 144 places and 144 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 475 place count 319 transition count 586
Ensure Unique test removed 1 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 516 place count 318 transition count 546
Symmetric choice reduction at 3 with 100 rule applications. Total rules 616 place count 318 transition count 546
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 126 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 816 place count 218 transition count 420
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 887 place count 218 transition count 349
Symmetric choice reduction at 4 with 43 rule applications. Total rules 930 place count 218 transition count 349
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 77 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1016 place count 175 transition count 272
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1056 place count 175 transition count 232
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1059 place count 175 transition count 232
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 18 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1065 place count 172 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1066 place count 172 transition count 213
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1068 place count 172 transition count 213
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 3 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1072 place count 170 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1074 place count 170 transition count 208
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1075 place count 170 transition count 208
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1077 place count 169 transition count 206
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1078 place count 169 transition count 206
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1080 place count 168 transition count 203
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1081 place count 168 transition count 203
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1083 place count 167 transition count 200
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1084 place count 167 transition count 200
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1086 place count 166 transition count 198
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1106 place count 156 transition count 188
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1113 place count 156 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1114 place count 155 transition count 180
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 26 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 14 rules applied. Total rules applied 1128 place count 144 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1130 place count 144 transition count 174
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1130 place count 144 transition count 170
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 1142 place count 136 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1145 place count 136 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1145 place count 136 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1148 place count 134 transition count 166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1148 place count 134 transition count 165
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1151 place count 132 transition count 165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1157 place count 128 transition count 163
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1158 place count 128 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1160 place count 127 transition count 162
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1166 place count 124 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1170 place count 124 transition count 155
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1171 place count 124 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1173 place count 123 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1175 place count 123 transition count 151
Applied a total of 1175 rules in 221 ms. Remains 123 /485 variables (removed 362) and now considering 151/752 (removed 601) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/485 places, 151/752 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2765 ms (no deadlock found). (steps per millisecond=452 )
Random directed walk for 1250002 steps, including 0 resets, run took 2148 ms (no deadlock found). (steps per millisecond=581 )
[2020-06-04 06:22:36] [INFO ] Flow matrix only has 127 transitions (discarded 24 similar events)
// Phase 1: matrix 127 rows 123 cols
[2020-06-04 06:22:36] [INFO ] Computed 48 place invariants in 11 ms
[2020-06-04 06:22:36] [INFO ] [Real]Absence check using 42 positive place invariants in 26 ms returned sat
[2020-06-04 06:22:36] [INFO ] [Real]Absence check using 42 positive and 6 generalized place invariants in 22 ms returned sat
[2020-06-04 06:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:22:36] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-04 06:22:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:22:37] [INFO ] [Nat]Absence check using 42 positive place invariants in 7 ms returned unsat
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION

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

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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Vasy2003-PT-none, 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 r201-csrt-159033401400376"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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