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.r140-smll-174876533500158.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 MedleyA-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533500158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 130K 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 1748928824111

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:33:46] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-06-03 05:33:46] [INFO ] Transformed 273 places.
[2025-06-03 05:33:46] [INFO ] Transformed 518 transitions.
[2025-06-03 05:33:46] [INFO ] Found NUPN structural information;
[2025-06-03 05:33:46] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 345 ms.
Graph (trivial) has 233 edges and 273 vertex of which 30 / 273 are part of one of the 3 SCC in 5 ms
Free SCC test removed 27 places
Structural test allowed to assert that 98 places are NOT stable. Took 43 ms.
Ensure Unique test removed 36 transitions
Reduce redundant transitions removed 36 transitions.
RANDOM walk for 40000 steps (56 resets) in 3731 ms. (10 steps per ms) remains 66/175 properties
BEST_FIRST walk for 4004 steps (22 resets) in 73 ms. (54 steps per ms) remains 61/66 properties
BEST_FIRST walk for 4001 steps (18 resets) in 51 ms. (76 steps per ms) remains 55/61 properties
BEST_FIRST walk for 4004 steps (18 resets) in 62 ms. (63 steps per ms) remains 40/55 properties
BEST_FIRST walk for 4003 steps (20 resets) in 45 ms. (87 steps per ms) remains 34/40 properties
BEST_FIRST walk for 4003 steps (16 resets) in 62 ms. (63 steps per ms) remains 28/34 properties
BEST_FIRST walk for 4004 steps (15 resets) in 73 ms. (54 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (21 resets) in 30 ms. (129 steps per ms) remains 23/27 properties
BEST_FIRST walk for 4003 steps (15 resets) in 32 ms. (121 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (17 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (19 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
[2025-06-03 05:33:48] [INFO ] Flow matrix only has 480 transitions (discarded 2 similar events)
// Phase 1: matrix 480 rows 246 cols
[2025-06-03 05:33:48] [INFO ] Computed 11 invariants in 19 ms
[2025-06-03 05:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 114/127 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 65/192 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 65/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 54/246 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 54/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 479/725 variables, 246/503 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/726 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/726 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 504 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1618 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 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) 114/127 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 65/192 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 65/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 54/246 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 54/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-03 05:33:50] [INFO ] Deduced a trap composed of 136 places in 252 ms of which 39 ms to minimize.
[2025-06-03 05:33:50] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 4 ms to minimize.
[2025-06-03 05:33:51] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 479/725 variables, 246/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/725 variables, 13/519 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-06-03 05:33:51] [INFO ] Deduced a trap composed of 159 places in 241 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/725 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/725 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 1/726 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/726 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 521 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3100 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 4811ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 23914 steps, including 996 resets, run visited all 1 properties in 48 ms. (steps per millisecond=498 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 1575 ms.
Able to resolve query StableMarking after proving 177 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 8395 ms.
ITS solved all properties within timeout

BK_STOP 1748928834775

--------------------
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="MedleyA-PT-20"
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 MedleyA-PT-20, 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 r140-smll-174876533500158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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