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

About the Execution of 2024-gold for ResIsolation-PT-N10P2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15682.770 113557.00 139110.00 488.20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r195-tall-174889278100036.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 ResIsolation-PT-N10P2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-tall-174889278100036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 45M 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-00
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-01
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-02
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-03
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-04
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-05
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-06
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-07
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-08
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-09
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-10
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-11
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-12
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-13
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-14
FORMULA_NAME ResIsolation-PT-N10P2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748951473364

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N10P2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-03 11:51:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 11:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 11:51:16] [INFO ] Load time of PNML (sax parser for PT used): 1764 ms
[2025-06-03 11:51:16] [INFO ] Transformed 367 places.
[2025-06-03 11:51:16] [INFO ] Transformed 37193 transitions.
[2025-06-03 11:51:16] [INFO ] Found NUPN structural information;
[2025-06-03 11:51:16] [INFO ] Parsed PT model containing 367 places and 37193 transitions and 885405 arcs in 2193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 37193 rows 367 cols
[2025-06-03 11:51:17] [INFO ] Computed 12 invariants in 646 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 3152 ms. (3 steps per ms)
FORMULA ResIsolation-PT-N10P2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (18 resets) in 4217 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-03 11:51:25] [INFO ] Invariant cache hit.
[2025-06-03 11:51:25] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2025-06-03 11:51:30] [INFO ] [Real]Absence check using state equation in 4836 ms returned unknown
[2025-06-03 11:51:30] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-03 11:51:35] [INFO ] [Real]Absence check using state equation in 4904 ms returned unknown
[2025-06-03 11:51:35] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-03 11:51:40] [INFO ] [Real]Absence check using state equation in 4947 ms returned unknown
[2025-06-03 11:51:40] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-03 11:51:45] [INFO ] [Real]Absence check using state equation in 4945 ms returned unknown
[2025-06-03 11:51:45] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2025-06-03 11:51:50] [INFO ] [Real]Absence check using state equation in 4929 ms returned unknown
[2025-06-03 11:51:50] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-03 11:51:55] [INFO ] [Real]Absence check using state equation in 4936 ms returned unknown
[2025-06-03 11:51:55] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2025-06-03 11:52:00] [INFO ] [Real]Absence check using state equation in 4932 ms returned unknown
[2025-06-03 11:52:00] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2025-06-03 11:52:05] [INFO ] [Real]Absence check using state equation in 4943 ms returned unknown
[2025-06-03 11:52:05] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2025-06-03 11:52:10] [INFO ] [Real]Absence check using state equation in 4939 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 37193/37193 transitions.
Graph (trivial) has 308 edges and 367 vertex of which 30 / 367 are part of one of the 10 SCC in 12 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 4486 edges and 347 vertex of which 311 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.205 ms
Discarding 36 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 311 transition count 37081
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 106 place count 265 transition count 37081
Discarding 172 places :
Symmetric choice reduction at 2 with 172 rule applications. Total rules 278 place count 93 transition count 36909
Iterating global reduction 2 with 172 rules applied. Total rules applied 450 place count 93 transition count 36909
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 2 with 258 rules applied. Total rules applied 708 place count 93 transition count 36651
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 708 place count 93 transition count 36645
Deduced a syphon composed of 6 places in 27 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 720 place count 87 transition count 36645
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 12 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 752 place count 71 transition count 36629
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 753 place count 71 transition count 36628
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 765 place count 71 transition count 36616
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2304 transitions
Reduce isomorphic transitions removed 2304 transitions.
Iterating post reduction 4 with 2316 rules applied. Total rules applied 3081 place count 59 transition count 34312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3082 place count 58 transition count 34311
Applied a total of 3082 rules in 14905 ms. Remains 58 /367 variables (removed 309) and now considering 34311/37193 (removed 2882) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14928 ms. Remains : 58/367 places, 34311/37193 transitions.
// Phase 1: matrix 34311 rows 58 cols
[2025-06-03 11:52:25] [INFO ] Computed 12 invariants in 138 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 2135 steps (0 resets) in 30017 ms. (0 steps per ms)
FORMULA ResIsolation-PT-N10P2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N10P2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 3883 ms. (257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 30 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-03 11:53:03] [INFO ] Flatten gal took : 3241 ms
[2025-06-03 11:53:06] [INFO ] Flatten gal took : 2616 ms
[2025-06-03 11:53:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality361776292492527267.gal : 540 ms
[2025-06-03 11:53:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12427031184068995130.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality361776292492527267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12427031184068995130.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 112317 ms.

BK_STOP 1748951586921

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ResIsolation-PT-N10P2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ResIsolation-PT-N10P2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r195-tall-174889278100036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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