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.r538-tall-171690547700218.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 ltsminxred
Input is StigmergyElection-PT-08a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690547700218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.3M May 18 16:43 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 1717229162195

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:06:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 08:06:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:06:03] [INFO ] Load time of PNML (sax parser for PT used): 430 ms
[2024-06-01 08:06:03] [INFO ] Transformed 114 places.
[2024-06-01 08:06:03] [INFO ] Transformed 6882 transitions.
[2024-06-01 08:06:03] [INFO ] Found NUPN structural information;
[2024-06-01 08:06:03] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 590 ms.
Structural test allowed to assert that 18 places are NOT stable. Took 21 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
RANDOM walk for 40000 steps (17 resets) in 2448 ms. (16 steps per ms) remains 2/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2024-06-01 08:06:04] [INFO ] Flow matrix only has 640 transitions (discarded 24 similar events)
// Phase 1: matrix 640 rows 114 cols
[2024-06-01 08:06:04] [INFO ] Computed 9 invariants in 16 ms
[2024-06-01 08:06:04] [INFO ] State equation strengthened by 549 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 27/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/114 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 85/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 639/753 variables, 114/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 548/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/754 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/754 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/754 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 786 constraints, problems are : Problem set: 0 solved, 2 unsolved in 642 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 114/114 constraints, ReadFeed: 549/549 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 27/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 7 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 85/114 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 3 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 639/753 variables, 114/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 548/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/753 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/753 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/753 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/754 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/754 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/754 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 821 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3668 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 114/114 constraints, ReadFeed: 549/549 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints]
After SMT, in 4425ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1339 steps, including 53 resets, run visited all 2 properties in 13 ms. (steps per millisecond=103 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 24 ms.
Able to resolve query StableMarking after proving 97 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 6042 ms.
ITS solved all properties within timeout

BK_STOP 1717229169352

--------------------
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 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="StigmergyElection-PT-08a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-08a, 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 r538-tall-171690547700218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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