Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r192-oct2-177969025800142.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2025
Input is MedleyA-PT-17, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r192-oct2-177969025800142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K Mar 3 18:30 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 1780576842567

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-06-04 12:40:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-04 12:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-04 12:40:44] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2026-06-04 12:40:44] [INFO ] Transformed 248 places.
[2026-06-04 12:40:44] [INFO ] Transformed 591 transitions.
[2026-06-04 12:40:44] [INFO ] Found NUPN structural information;
[2026-06-04 12:40:44] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 221 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 248/248 places, 591/591 transitions.
Graph (trivial) has 289 edges and 248 vertex of which 9 / 248 are part of one of the 3 SCC in 10 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 242 transition count 546
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 205 transition count 544
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 77 place count 205 transition count 528
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 109 place count 189 transition count 528
Performed 37 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 183 place count 152 transition count 459
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 187 place count 152 transition count 455
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -276
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 285 place count 103 transition count 731
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 103 transition count 729
Applied a total of 287 rules in 179 ms. Remains 103 /248 variables (removed 145) and now considering 729/591 (removed -138) transitions.
[2026-06-04 12:40:45] [INFO ] Flow matrix only has 639 transitions (discarded 90 similar events)
// Phase 1: matrix 639 rows 103 cols
[2026-06-04 12:40:45] [INFO ] Computed 7 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-04 12:40:45] [INFO ] Implicit Places using invariants in 568 ms returned []
[2026-06-04 12:40:45] [INFO ] Flow matrix only has 639 transitions (discarded 90 similar events)
[2026-06-04 12:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-04 12:40:46] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-06-04 12:40:47] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2026-06-04 12:40:47] [INFO ] Flow matrix only has 639 transitions (discarded 90 similar events)
[2026-06-04 12:40:47] [INFO ] Invariant cache hit.
[2026-06-04 12:40:47] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:01] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:02] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:02] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:02] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:03] [INFO ] Deduced a trap composed of 10 places in 532 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:03] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:04] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:04] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:04] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:06] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:06] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:06] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:07] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:07] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:07] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:07] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:12] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:12] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:13] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 38 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:17] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/742 variables, and 130 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30056 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/103 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 6 (OVERLAPS) 638/741 variables, 103/233 constraints. Problems are: Problem set: 68 solved, 660 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 92/325 constraints. Problems are: Problem set: 68 solved, 660 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 660/985 constraints. Problems are: Problem set: 68 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 985 constraints, problems are : Problem set: 68 solved, 660 unsolved in 30058 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 103/103 constraints, ReadFeed: 92/93 constraints, PredecessorRefiner: 660/728 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61010ms problems are : Problem set: 68 solved, 660 unsolved
Search for dead transitions found 68 dead transitions in 61048ms
Found 68 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 63885 ms.

BK_STOP 1780576908721

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-17"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
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-5348"
echo " Executing tool gold2025"
echo " Input is MedleyA-PT-17, 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 r192-oct2-177969025800142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;