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-174881266700288.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-S04J04T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 563K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K 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 2.5M 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 1748899880124

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 21:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:31:21] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2025-06-02 21:31:21] [INFO ] Transformed 554 places.
[2025-06-02 21:31:21] [INFO ] Transformed 2998 transitions.
[2025-06-02 21:31:21] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 359 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40000 steps (8 resets) in 2140 ms. (18 steps per ms) remains 3/554 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2025-06-02 21:31:22] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2025-06-02 21:31:22] [INFO ] Computed 50 invariants in 86 ms
[2025-06-02 21:31:22] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 270/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/366 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 184/550 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/552 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1348/1900 variables, 552/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1900 variables, 120/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1900 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1902 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1902 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1902 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1902 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1902/1902 variables, and 724 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2793 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 554/554 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 270/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/366 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 184/550 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 76 places in 287 ms of which 33 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/552 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1348/1900 variables, 552/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1900 variables, 120/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1900 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1900 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1902 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1902 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:31:29] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 4 ms to minimize.
[2025-06-02 21:31:29] [INFO ] Deduced a trap composed of 296 places in 447 ms of which 21 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1902 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1902 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1902 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1902/1902 variables, and 732 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 554/554 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 7956ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 550 transition count 1320
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 108 place count 498 transition count 1320
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 498 transition count 1260
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 438 transition count 1260
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 348 place count 378 transition count 1200
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 360 place count 378 transition count 1188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 372 place count 366 transition count 1188
Applied a total of 372 rules in 423 ms. Remains 366 /554 variables (removed 188) and now considering 1188/1372 (removed 184) transitions.
Running 1184 sub problems to find dead transitions.
[2025-06-02 21:31:31] [INFO ] Flow matrix only has 1164 transitions (discarded 24 similar events)
// Phase 1: matrix 1164 rows 366 cols
[2025-06-02 21:31:31] [INFO ] Computed 46 invariants in 36 ms
[2025-06-02 21:31:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2025-06-02 21:31:49] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1530 variables, and 35 constraints, problems are : Problem set: 0 solved, 1184 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/366 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1184/1184 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2025-06-02 21:31:58] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:31:58] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2025-06-02 21:31:59] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-02 21:32:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2025-06-02 21:32:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
[2025-06-02 21:32:16] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2025-06-02 21:32:16] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1530 variables, and 42 constraints, problems are : Problem set: 0 solved, 1184 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/366 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1184 constraints, Known Traps: 8/8 constraints]
After SMT, in 46133ms problems are : Problem set: 0 solved, 1184 unsolved
Search for dead transitions found 0 dead transitions in 46187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46654 ms. Remains : 366/554 places, 1188/1372 transitions.
RANDOM walk for 54996 steps (14 resets) in 759 ms. (72 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 554 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 56374 ms.
ITS solved all properties within timeout

BK_STOP 1748899937782

--------------------
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="PolyORBLF-PT-S04J04T06"
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 PolyORBLF-PT-S04J04T06, 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 r168-tall-174881266700288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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