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.r168-tall-174881266700284.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 PolyORBLF-PT-S02J06T10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 20K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 136K 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 8.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 217K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 Liveness

=== Now, execution of the tool begins

BK_START 1748899815187

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:30:16] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-06-02 21:30:16] [INFO ] Transformed 844 places.
[2025-06-02 21:30:16] [INFO ] Transformed 1812 transitions.
[2025-06-02 21:30:16] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 253 ms.
Discarding 160 transitions out of 1812. Remains 1652
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.28797KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 97 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2025-06-02 21:30:17] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2025-06-02 21:30:17] [INFO ] Computed 58 invariants in 91 ms
[2025-06-02 21:30:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 54 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2025-06-02 21:30:45] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 22 ms to minimize.
[2025-06-02 21:30:45] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:30:45] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:30:45] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-06-02 21:30:46] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2025-06-02 21:30:46] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2025-06-02 21:30:46] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2025-06-02 21:30:46] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2025-06-02 21:30:46] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2025-06-02 21:30:46] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2025-06-02 21:30:47] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 3 ms to minimize.
[2025-06-02 21:30:47] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 3 ms to minimize.
[2025-06-02 21:30:48] [INFO ] Deduced a trap composed of 226 places in 379 ms of which 5 ms to minimize.
[2025-06-02 21:30:48] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2025-06-02 21:30:50] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 5 ms to minimize.
[2025-06-02 21:30:51] [INFO ] Deduced a trap composed of 407 places in 396 ms of which 5 ms to minimize.
[2025-06-02 21:30:54] [INFO ] Deduced a trap composed of 454 places in 394 ms of which 5 ms to minimize.
[2025-06-02 21:30:55] [INFO ] Deduced a trap composed of 496 places in 394 ms of which 5 ms to minimize.
[2025-06-02 21:30:56] [INFO ] Deduced a trap composed of 437 places in 387 ms of which 5 ms to minimize.
[2025-06-02 21:30:56] [INFO ] Deduced a trap composed of 491 places in 383 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 74 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 20/20 constraints]
After SMT, in 42798ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 42841ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42984 ms. Remains : 844/844 places, 1652/1652 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 47 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
[2025-06-02 21:30:59] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-02 21:30:59] [INFO ] Invariant cache hit.
[2025-06-02 21:30:59] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 21:30:59] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-02 21:30:59] [INFO ] Invariant cache hit.
[2025-06-02 21:31:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:31:02] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 2544 ms to find 0 implicit places.
[2025-06-02 21:31:02] [INFO ] Redundant transitions in 101 ms returned []
Running 1650 sub problems to find dead transitions.
[2025-06-02 21:31:02] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-02 21:31:02] [INFO ] Invariant cache hit.
[2025-06-02 21:31:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2025-06-02 21:31:25] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2025-06-02 21:31:25] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:31:25] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2025-06-02 21:31:25] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2025-06-02 21:31:25] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2025-06-02 21:31:27] [INFO ] Deduced a trap composed of 220 places in 371 ms of which 5 ms to minimize.
[2025-06-02 21:31:27] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2025-06-02 21:31:27] [INFO ] Deduced a trap composed of 430 places in 369 ms of which 5 ms to minimize.
[2025-06-02 21:31:29] [INFO ] Deduced a trap composed of 407 places in 382 ms of which 5 ms to minimize.
[2025-06-02 21:31:30] [INFO ] Deduced a trap composed of 86 places in 397 ms of which 5 ms to minimize.
[2025-06-02 21:31:31] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:31:31] [INFO ] Deduced a trap composed of 436 places in 384 ms of which 5 ms to minimize.
[2025-06-02 21:31:32] [INFO ] Deduced a trap composed of 598 places in 386 ms of which 5 ms to minimize.
[2025-06-02 21:31:32] [INFO ] Deduced a trap composed of 606 places in 371 ms of which 4 ms to minimize.
[2025-06-02 21:31:33] [INFO ] Deduced a trap composed of 637 places in 369 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 74 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 74 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 20/20 constraints]
After SMT, in 62309ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 62326ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 65027 ms. Remains : 844/844 places, 1652/1652 transitions.
Finished random walk after 9199 steps, including 0 resets, run found a deadlock after 60 ms. (steps per millisecond=153 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 108553 ms.
ITS solved all properties within timeout

BK_STOP 1748899924955

--------------------
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 Liveness -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="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-PT-S02J06T10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266700284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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