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.r138-smll-167819421000525.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 marciexred
Input is DoubleLock-PT-p1s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421000525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 14:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 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 DoubleLock-PT-p1s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678935923945

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 03:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 03:05:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 03:05:27] [INFO ] Load time of PNML (sax parser for PT used): 607 ms
[2023-03-16 03:05:27] [INFO ] Transformed 570 places.
[2023-03-16 03:05:27] [INFO ] Transformed 7568 transitions.
[2023-03-16 03:05:27] [INFO ] Parsed PT model containing 570 places and 7568 transitions and 30656 arcs in 775 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 132 places in 25 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s3-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 4971 out of 7312 initially.
// Phase 1: matrix 4971 rows 438 cols
[2023-03-16 03:05:27] [INFO ] Computed 4 place invariants in 163 ms
Incomplete random walk after 10007 steps, including 96 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 11) seen :7
FORMULA DoubleLock-PT-p1s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :1
FORMULA DoubleLock-PT-p1s3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-16 03:05:28] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 438 cols
[2023-03-16 03:05:28] [INFO ] Computed 4 place invariants in 115 ms
[2023-03-16 03:05:29] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2023-03-16 03:05:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 03:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:05:30] [INFO ] [Real]Absence check using state equation in 1831 ms returned sat
[2023-03-16 03:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:05:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-16 03:05:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 03:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:05:33] [INFO ] [Nat]Absence check using state equation in 1792 ms returned sat
[2023-03-16 03:05:33] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-16 03:05:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 03:05:36] [INFO ] [Nat]Added 400 Read/Feed constraints in 3037 ms returned unknown
[2023-03-16 03:05:36] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-16 03:05:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 03:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:05:38] [INFO ] [Real]Absence check using state equation in 1849 ms returned sat
[2023-03-16 03:05:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:05:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-16 03:05:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-16 03:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:05:39] [INFO ] [Nat]Absence check using state equation in 1690 ms returned sat
[2023-03-16 03:05:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 03:05:43] [INFO ] [Nat]Added 400 Read/Feed constraints in 3234 ms returned unknown
[2023-03-16 03:05:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-16 03:05:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 03:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:05:44] [INFO ] [Real]Absence check using state equation in 1637 ms returned sat
[2023-03-16 03:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:05:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-16 03:05:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 03:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:05:46] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2023-03-16 03:05:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 03:05:50] [INFO ] [Nat]Added 400 Read/Feed constraints in 3251 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 7312/7312 transitions.
Graph (complete) has 12297 edges and 438 vertex of which 434 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.27 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 434 transition count 7184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 433 transition count 7056
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 433 transition count 7056
Applied a total of 131 rules in 873 ms. Remains 433 /438 variables (removed 5) and now considering 7056/7312 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 433/438 places, 7056/7312 transitions.
Normalized transition count is 4715 out of 7056 initially.
// Phase 1: matrix 4715 rows 433 cols
[2023-03-16 03:05:51] [INFO ] Computed 3 place invariants in 43 ms
Incomplete random walk after 1000005 steps, including 9344 resets, run finished after 4817 ms. (steps per millisecond=207 ) properties (out of 3) seen :3
FORMULA DoubleLock-PT-p1s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29296 ms.
ITS solved all properties within timeout

BK_STOP 1678935956946

--------------------
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 UpperBounds -timeout 360 -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="DoubleLock-PT-p1s3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is DoubleLock-PT-p1s3, 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 r138-smll-167819421000525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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