fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r281-smll-167863551000258
Last Updated
May 14, 2023

About the Execution of Smart+red for Parking-PT-104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
205.560 6731.00 12104.00 269.50 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r281-smll-167863551000258.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Parking-PT-104, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863551000258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:23 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 StableMarking

=== Now, execution of the tool begins

BK_START 1678921365823

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-104
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 23:02:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 23:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:02:49] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-15 23:02:49] [INFO ] Transformed 65 places.
[2023-03-15 23:02:49] [INFO ] Transformed 97 transitions.
[2023-03-15 23:02:49] [INFO ] Found NUPN structural information;
[2023-03-15 23:02:49] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 300 ms.
Structural test allowed to assert that 25 places are NOT stable. Took 11 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Incomplete random walk after 10000 steps, including 598 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 40) seen :33
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 56 rows 65 cols
[2023-03-15 23:02:50] [INFO ] Computed 16 place invariants in 9 ms
[2023-03-15 23:02:50] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 23:02:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-15 23:02:50] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 23:02:50] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 23:02:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 23:02:50] [INFO ] After 43ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 23:02:50] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 23:02:50] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 4 properties in 413 ms.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 60 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 60 transition count 51
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 2 with 6 rules applied. Total rules applied 16 place count 57 transition count 48
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 57 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 34 place count 48 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 47 transition count 38
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 25 rules applied. Total rules applied 60 place count 38 transition count 22
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 22 rules applied. Total rules applied 82 place count 22 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 86 place count 18 transition count 16
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 86 place count 18 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 96 place count 13 transition count 11
Applied a total of 96 rules in 79 ms. Remains 13 /65 variables (removed 52) and now considering 11/56 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 13/65 places, 11/56 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Able to resolve query StableMarking after proving 41 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 2608 ms.
ITS solved all properties within timeout

BK_STOP 1678921372554

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="Parking-PT-104"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Parking-PT-104, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r281-smll-167863551000258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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