Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r166-smll-171636274400126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274400126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 1716489141271

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:32:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-23 18:32:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:32:23] [INFO ] Load time of PNML (sax parser for PT used): 677 ms
[2024-05-23 18:32:23] [INFO ] Transformed 1090 places.
[2024-05-23 18:32:23] [INFO ] Transformed 5200 transitions.
[2024-05-23 18:32:23] [INFO ] Found NUPN structural information;
[2024-05-23 18:32:23] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 933 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 14 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 17 ms.26111KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 1080 transition count 4880
Deduced a syphon composed of 310 places in 14 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 770 transition count 4880
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 730 place count 680 transition count 3980
Iterating global reduction 2 with 90 rules applied. Total rules applied 820 place count 680 transition count 3980
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 23 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1000 place count 590 transition count 3890
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 1000 rules in 1347 ms. Remains 590 /1090 variables (removed 500) and now considering 3890/5200 (removed 1310) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1376 ms. Remains : 590/1090 places, 3890/5200 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3686 ms (no deadlock found). (steps per millisecond=339 )
Random directed walk for 1250004 steps, including 0 resets, run took 6228 ms (no deadlock found). (steps per millisecond=200 )
[2024-05-23 18:32:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-23 18:32:35] [INFO ] Computed 31 invariants in 21 ms
[2024-05-23 18:32:37] [INFO ] [Real]Absence check using 21 positive place invariants in 56 ms returned sat
[2024-05-23 18:32:37] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 131 ms returned sat
[2024-05-23 18:32:39] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2024-05-23 18:32:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:32:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 30 ms returned sat
[2024-05-23 18:32:40] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 52 ms returned sat
[2024-05-23 18:32:41] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2024-05-23 18:32:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-23 18:32:41] [INFO ] [Nat]Added 436 Read/Feed constraints in 162 ms returned sat
[2024-05-23 18:32:43] [INFO ] Deduced a trap composed of 5 places in 1001 ms of which 94 ms to minimize.
[2024-05-23 18:32:44] [INFO ] Deduced a trap composed of 4 places in 1037 ms of which 17 ms to minimize.
[2024-05-23 18:32:45] [INFO ] Deduced a trap composed of 3 places in 1048 ms of which 9 ms to minimize.
[2024-05-23 18:32:46] [INFO ] Deduced a trap composed of 3 places in 979 ms of which 5 ms to minimize.
[2024-05-23 18:32:47] [INFO ] Deduced a trap composed of 86 places in 942 ms of which 5 ms to minimize.
[2024-05-23 18:32:48] [INFO ] Deduced a trap composed of 3 places in 968 ms of which 9 ms to minimize.
[2024-05-23 18:32:49] [INFO ] Deduced a trap composed of 84 places in 912 ms of which 5 ms to minimize.
[2024-05-23 18:32:50] [INFO ] Deduced a trap composed of 33 places in 753 ms of which 7 ms to minimize.
[2024-05-23 18:32:51] [INFO ] Deduced a trap composed of 28 places in 965 ms of which 8 ms to minimize.
[2024-05-23 18:32:52] [INFO ] Deduced a trap composed of 49 places in 1028 ms of which 8 ms to minimize.
[2024-05-23 18:32:53] [INFO ] Deduced a trap composed of 100 places in 1059 ms of which 9 ms to minimize.
[2024-05-23 18:32:54] [INFO ] Deduced a trap composed of 64 places in 1035 ms of which 8 ms to minimize.
[2024-05-23 18:32:56] [INFO ] Deduced a trap composed of 24 places in 1032 ms of which 8 ms to minimize.
[2024-05-23 18:32:56] [INFO ] Deduced a trap composed of 42 places in 670 ms of which 5 ms to minimize.
[2024-05-23 18:32:57] [INFO ] Deduced a trap composed of 111 places in 621 ms of which 5 ms to minimize.
[2024-05-23 18:32:58] [INFO ] Deduced a trap composed of 43 places in 743 ms of which 5 ms to minimize.
[2024-05-23 18:32:59] [INFO ] Deduced a trap composed of 46 places in 740 ms of which 6 ms to minimize.
[2024-05-23 18:33:00] [INFO ] Deduced a trap composed of 3 places in 834 ms of which 8 ms to minimize.
[2024-05-23 18:33:01] [INFO ] Deduced a trap composed of 28 places in 958 ms of which 8 ms to minimize.
[2024-05-23 18:33:01] [INFO ] Deduced a trap composed of 39 places in 675 ms of which 6 ms to minimize.
[2024-05-23 18:33:02] [INFO ] Deduced a trap composed of 38 places in 669 ms of which 6 ms to minimize.
[2024-05-23 18:33:03] [INFO ] Deduced a trap composed of 93 places in 673 ms of which 6 ms to minimize.
[2024-05-23 18:33:04] [INFO ] Deduced a trap composed of 47 places in 906 ms of which 8 ms to minimize.
[2024-05-23 18:33:05] [INFO ] Deduced a trap composed of 31 places in 902 ms of which 7 ms to minimize.
[2024-05-23 18:33:06] [INFO ] Deduced a trap composed of 56 places in 694 ms of which 5 ms to minimize.
[2024-05-23 18:33:07] [INFO ] Deduced a trap composed of 3 places in 784 ms of which 9 ms to minimize.
[2024-05-23 18:33:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 26 trap constraints in 25069 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 44058 ms.
ITS solved all properties within timeout

BK_STOP 1716489187111

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-10, 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 r166-smll-171636274400126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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