Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080600443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Echo-PT-d03r07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080600443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.2M May 29 14:32 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 1748740872744

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Echo-PT-d03r07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:21:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 01:21:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:21:14] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2025-06-01 01:21:14] [INFO ] Transformed 4209 places.
[2025-06-01 01:21:14] [INFO ] Transformed 3518 transitions.
[2025-06-01 01:21:14] [INFO ] Found NUPN structural information;
[2025-06-01 01:21:14] [INFO ] Parsed PT model containing 4209 places and 3518 transitions and 25540 arcs in 563 ms.
Structural test allowed to assert that 8 places are NOT stable. Took 23 ms.
RANDOM walk for 40000 steps (56 resets) in 5993 ms. (6 steps per ms) remains 15/4201 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 13/13 properties
// Phase 1: matrix 3518 rows 4209 cols
[2025-06-01 01:21:17] [INFO ] Computed 2107 invariants in 318 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 39/52 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 4/56 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 739/795 variables, 150/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/795 variables, 739/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/795 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 78/873 variables, 46/998 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 78/1076 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 11/884 variables, 3/1079 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/884 variables, 11/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/884 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 12/896 variables, 2/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 12/1104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/896 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 2110/3006 variables, 1117/2221 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3006 variables, 2110/4331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3006 variables, 0/4331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 93/3099 variables, 87/4418 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3099 variables, 93/4511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3099 variables, 0/4511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 644/3743 variables, 388/4899 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3743 variables, 644/5543 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3743/7727 variables, and 5543 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5058 ms.
Refiners :[Domain max(s): 3743/4209 constraints, Positive P Invariants (semi-flows): 145/216 constraints, Generalized P Invariants (flows): 1655/1891 constraints, State Equation: 0/4209 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 39/52 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 4/56 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 739/795 variables, 150/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/795 variables, 739/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/795 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 78/873 variables, 46/998 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 78/1076 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 11/884 variables, 3/1079 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/884 variables, 11/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/884 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 12/896 variables, 2/1092 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 12/1104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/896 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 2110/3006 variables, 1117/2221 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3006 variables, 2110/4331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-01 01:21:27] [INFO ] Deduced a trap composed of 23 places in 1393 ms of which 183 ms to minimize.
SMT process timed out in 10556ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 4209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4209/4209 places, 3518/3518 transitions.
Graph (complete) has 18050 edges and 4209 vertex of which 3853 are kept as prefixes of interest. Removing 356 places using SCC suffix rule.19 ms
Discarding 356 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 673 ms. Remains 3852 /4209 variables (removed 357) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 3852/4209 places, 3510/3518 transitions.
RANDOM walk for 275843 steps (404 resets) in 14364 ms. (19 steps per ms) remains 0/13 properties
Able to resolve query StableMarking after proving 4202 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 19980 ms.
ITS solved all properties within timeout

BK_STOP 1748740894257

--------------------
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="Echo-PT-d03r07"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Echo-PT-d03r07, 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 r084-tall-174860080600443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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