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.r210-tall-174894547700452.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 ShieldPPPs-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547700452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.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.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 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 528K 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 1749028770211

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 09:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-04 09:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 09:19:31] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-06-04 09:19:31] [INFO ] Transformed 2043 places.
[2025-06-04 09:19:31] [INFO ] Transformed 1893 transitions.
[2025-06-04 09:19:31] [INFO ] Found NUPN structural information;
[2025-06-04 09:19:31] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 366 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 2043 transition count 1681
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1831 transition count 1681
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1831 transition count 1531
Deduced a syphon composed of 150 places in 18 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1681 transition count 1531
Performed 720 Post agglomeration using F-continuation condition.Transition count delta: 720
Deduced a syphon composed of 720 places in 3 ms
Reduce places removed 720 places and 0 transitions.
Iterating global reduction 2 with 1440 rules applied. Total rules applied 2164 place count 961 transition count 811
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2164 rules in 394 ms. Remains 961 /2043 variables (removed 1082) and now considering 811/1893 (removed 1082) transitions.
// Phase 1: matrix 811 rows 961 cols
[2025-06-04 09:19:32] [INFO ] Computed 331 invariants in 29 ms
[2025-06-04 09:19:33] [INFO ] Implicit Places using invariants in 821 ms returned []
[2025-06-04 09:19:33] [INFO ] Invariant cache hit.
[2025-06-04 09:19:34] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1782 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-04 09:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 960/960 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (OVERLAPS) 1/961 variables, 331/1291 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/961 variables, 1/1292 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 961/1772 variables, and 1292 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30041 ms.
Refiners :[Domain max(s): 961/961 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/961 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 960/960 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (OVERLAPS) 1/961 variables, 331/1291 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/961 variables, 1/1292 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2025-06-04 09:20:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 5 ms to minimize.
[2025-06-04 09:20:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-06-04 09:20:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-04 09:20:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
[2025-06-04 09:20:22] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2025-06-04 09:20:22] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-06-04 09:20:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-06-04 09:20:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-04 09:20:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2025-06-04 09:20:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-04 09:20:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-06-04 09:20:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-04 09:20:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-04 09:20:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-04 09:20:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-04 09:20:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-06-04 09:20:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-06-04 09:20:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-04 09:20:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-06-04 09:20:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/961 variables, 20/1312 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 961/1772 variables, and 1312 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30024 ms.
Refiners :[Domain max(s): 961/961 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/961 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LIVENESS mode, iteration 1 : 961/2043 places, 811/1893 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62618 ms. Remains : 961/2043 places, 811/1893 transitions.
Discarding 180 transitions out of 811. Remains 631
Initial state reduction rules removed 1 formulas.
RANDOM walk for 37956 steps (16 resets) in 2309 ms. (16 steps per ms) remains 0/630 properties
Able to resolve query QuasiLiveness after proving 631 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 63755 ms.
ITS solved all properties within timeout

BK_STOP 1749028835198

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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 r210-tall-174894547700452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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