fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r210-tall-174894547100139
Last Updated
June 24, 2025

About the Execution of 2024-gold for SharedMemory-PT-000020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15693.410 121775.00 146429.00 488.30 T normal

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-174894547100139.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 SharedMemory-PT-000020, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547100139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 116K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 222K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 915K 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 55K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 358K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 352K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 413K 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 1749025250080

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SharedMemory-PT-000020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 08:20:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-04 08:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:20:51] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-04 08:20:51] [INFO ] Transformed 461 places.
[2025-06-04 08:20:51] [INFO ] Transformed 820 transitions.
[2025-06-04 08:20:51] [INFO ] Found NUPN structural information;
[2025-06-04 08:20:51] [INFO ] Parsed PT model containing 461 places and 820 transitions and 3200 arcs in 220 ms.
Discarding 20 transitions out of 820. Remains 800
Built sparse matrix representations for Structural reductions in 8 ms.22781KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 461/461 places, 820/820 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 83 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 97 ms. Remains : 461/461 places, 820/820 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 461/461 places, 820/820 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 41 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
// Phase 1: matrix 820 rows 461 cols
[2025-06-04 08:20:51] [INFO ] Computed 41 invariants in 43 ms
[2025-06-04 08:20:52] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-04 08:20:52] [INFO ] Invariant cache hit.
[2025-06-04 08:20:52] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2025-06-04 08:20:52] [INFO ] Redundant transitions in 40 ms returned []
Running 780 sub problems to find dead transitions.
[2025-06-04 08:20:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 21/462 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 20/461 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 820/1281 variables, 461/963 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/1281 variables, and 963 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30039 ms.
Refiners :[Domain max(s): 461/461 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 21/462 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 20/461 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (OVERLAPS) 820/1281 variables, 461/963 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 780/1743 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 1743 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30024 ms.
Refiners :[Domain max(s): 461/461 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 0/0 constraints]
After SMT, in 64966ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 65101ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 65843 ms. Remains : 461/461 places, 820/820 transitions.
Random walk for 1250000 steps, including 0 resets, run took 23848 ms (no deadlock found). (steps per millisecond=52 )
Interrupted Random directed walk after 523716 steps, including 0 resets, run timeout after 30012 ms. (steps per millisecond=17 )
[2025-06-04 08:22:51] [INFO ] Invariant cache hit.
[2025-06-04 08:22:51] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 461/461 places, 820/820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 380 transitions
Trivial Post-agglo rules discarded 380 transitions
Performed 380 trivial Post agglomeration. Transition count delta: 380
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 461 transition count 440
Reduce places removed 401 places and 0 transitions.
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (trivial) has 80 edges and 60 vertex of which 60 / 60 are part of one of the 20 SCC in 2 ms
Free SCC test removed 40 places
Iterating post reduction 1 with 762 rules applied. Total rules applied 1142 place count 20 transition count 80
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 1241 place count 0 transition count 1
Applied a total of 1241 rules in 23 ms. Remains 0 /461 variables (removed 461) and now considering 1/820 (removed 819) transitions.
[2025-06-04 08:22:51] [INFO ] Computed 0 invariants in 0 ms
[2025-06-04 08:22:51] [INFO ] Implicit Places using invariants in 5 ms returned []
[2025-06-04 08:22:51] [INFO ] Invariant cache hit.
[2025-06-04 08:22:51] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LIVENESS mode, iteration 1 : 0/461 places, 1/820 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 45 ms. Remains : 0/461 places, 1/820 transitions.
Able to resolve query QuasiLiveness after proving 1 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 461/461 places, 820/820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 380 transitions
Trivial Post-agglo rules discarded 380 transitions
Performed 380 trivial Post agglomeration. Transition count delta: 380
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 461 transition count 440
Reduce places removed 401 places and 0 transitions.
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (trivial) has 80 edges and 60 vertex of which 60 / 60 are part of one of the 20 SCC in 0 ms
Free SCC test removed 40 places
Iterating post reduction 1 with 762 rules applied. Total rules applied 1142 place count 20 transition count 80
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 1241 place count 0 transition count 1
Applied a total of 1241 rules in 4 ms. Remains 0 /461 variables (removed 461) and now considering 1/820 (removed 819) transitions.
[2025-06-04 08:22:51] [INFO ] Invariant cache hit.
[2025-06-04 08:22:51] [INFO ] Implicit Places using invariants in 5 ms returned []
[2025-06-04 08:22:51] [INFO ] Invariant cache hit.
[2025-06-04 08:22:51] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LIVENESS mode, iteration 1 : 0/461 places, 1/820 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 25 ms. Remains : 0/461 places, 1/820 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Able to resolve query Liveness after proving 1 properties.
FORMULA Liveness TRUE TECHNIQUES TOPOLOGICAL QUASI_LIVE_REVERSIBLE INITIAL_STATE
Total runtime 120481 ms.
ITS solved all properties within timeout

BK_STOP 1749025371855

--------------------
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="SharedMemory-PT-000020"
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 SharedMemory-PT-000020, 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 r210-tall-174894547100139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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