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.r224-tall-174902009600092.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 ShieldRVs-PT-050A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009600092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 320K May 29 14:33 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749106481090

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:54:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:54:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:54:42] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-06-05 06:54:42] [INFO ] Transformed 703 places.
[2025-06-05 06:54:42] [INFO ] Transformed 953 transitions.
[2025-06-05 06:54:42] [INFO ] Found NUPN structural information;
[2025-06-05 06:54:42] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 270 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 70 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2025-06-05 06:54:42] [INFO ] Computed 201 invariants in 30 ms
[2025-06-05 06:54:43] [INFO ] Implicit Places using invariants in 589 ms returned []
[2025-06-05 06:54:43] [INFO ] Invariant cache hit.
[2025-06-05 06:54:44] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
Running 951 sub problems to find dead transitions.
[2025-06-05 06:54:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2025-06-05 06:55:12] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 27 ms to minimize.
[2025-06-05 06:55:13] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 4 ms to minimize.
[2025-06-05 06:55:13] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2025-06-05 06:55:14] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 5 ms to minimize.
[2025-06-05 06:55:14] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 13 ms to minimize.
[2025-06-05 06:55:14] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 3 ms to minimize.
[2025-06-05 06:55:14] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 4 ms to minimize.
SMT process timed out in 30632ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30664ms
Starting structural reductions in LIVENESS mode, iteration 1 : 702/703 places, 952/953 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 32128 ms. Remains : 702/703 places, 952/953 transitions.
Discarding 300 transitions out of 952. Remains 652
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (60 resets) in 3424 ms. (11 steps per ms) remains 3/651 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 1/2 properties
[2025-06-05 06:55:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 689/702 variables, 198/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 689/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:55:17] [INFO ] Deduced a trap composed of 11 places in 961 ms of which 2 ms to minimize.
[2025-06-05 06:55:18] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 5 ms to minimize.
[2025-06-05 06:55:18] [INFO ] Deduced a trap composed of 7 places in 446 ms of which 2 ms to minimize.
[2025-06-05 06:55:18] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 4 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 7 places in 581 ms of which 2 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2025-06-05 06:55:19] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:55:20] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 3/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 952/1654 variables, 702/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1628 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5015 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 689/702 variables, 198/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 689/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 23/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 6 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:55:21] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:55:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 15/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 952/1654 variables, 702/1643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 1/1644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:55:23] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2025-06-05 06:55:23] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 2/1646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 0/1646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1654 variables, 0/1646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2238 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 7273ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 701 transition count 951
Applied a total of 102 rules in 191 ms. Remains 701 /702 variables (removed 1) and now considering 951/952 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 701/702 places, 951/952 transitions.
RANDOM walk for 53979 steps (89 resets) in 631 ms. (85 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 652 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 41636 ms.
ITS solved all properties within timeout

BK_STOP 1749106524069

--------------------
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 QuasiLiveness -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="ShieldRVs-PT-050A"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldRVs-PT-050A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009600092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;