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.r458-smll-167912650300445.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 StigmergyCommit-PT-05a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650300445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 11:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 11:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 613K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-05a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679456566750

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=StigmergyCommit-PT-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 03:42:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 03:42:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:42:50] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2023-03-22 03:42:50] [INFO ] Transformed 220 places.
[2023-03-22 03:42:50] [INFO ] Transformed 1212 transitions.
[2023-03-22 03:42:50] [INFO ] Found NUPN structural information;
[2023-03-22 03:42:50] [INFO ] Parsed PT model containing 220 places and 1212 transitions and 11640 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyCommit-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 394 out of 412 initially.
// Phase 1: matrix 394 rows 220 cols
[2023-03-22 03:42:51] [INFO ] Computed 7 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 15) seen :11
FORMULA StigmergyCommit-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 03:42:51] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
// Phase 1: matrix 394 rows 220 cols
[2023-03-22 03:42:51] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-22 03:42:51] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-22 03:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:51] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-22 03:42:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:42:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-22 03:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:52] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-22 03:42:52] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-03-22 03:42:52] [INFO ] [Nat]Added 209 Read/Feed constraints in 63 ms returned sat
[2023-03-22 03:42:52] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 5 ms to minimize.
[2023-03-22 03:42:52] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2023-03-22 03:42:52] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2023-03-22 03:42:53] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2023-03-22 03:42:53] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2023-03-22 03:42:53] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-22 03:42:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1039 ms
[2023-03-22 03:42:53] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 73 ms.
[2023-03-22 03:42:53] [INFO ] Added : 53 causal constraints over 11 iterations in 567 ms. Result :sat
Minimization took 116 ms.
[2023-03-22 03:42:54] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-22 03:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:54] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-22 03:42:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:42:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-22 03:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:54] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 03:42:54] [INFO ] [Nat]Added 209 Read/Feed constraints in 58 ms returned sat
[2023-03-22 03:42:54] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 1 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 2 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1985 ms
[2023-03-22 03:42:56] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 53 ms.
[2023-03-22 03:42:56] [INFO ] Added : 49 causal constraints over 10 iterations in 408 ms. Result :sat
Minimization took 66 ms.
[2023-03-22 03:42:57] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-22 03:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:57] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-22 03:42:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:42:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-22 03:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:57] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-22 03:42:57] [INFO ] [Nat]Added 209 Read/Feed constraints in 40 ms returned sat
[2023-03-22 03:42:57] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-22 03:42:57] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-22 03:42:57] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-22 03:42:58] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-22 03:42:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-22 03:42:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 03:42:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 627 ms
[2023-03-22 03:42:58] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 38 ms.
[2023-03-22 03:42:58] [INFO ] Added : 45 causal constraints over 9 iterations in 352 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA StigmergyCommit-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-05a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 8204 ms.
ITS solved all properties within timeout

BK_STOP 1679456580628

--------------------
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="StigmergyCommit-PT-05a"
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 StigmergyCommit-PT-05a, 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 r458-smll-167912650300445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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