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

About the Execution of 2024-gold for NoC3x3-PT-7B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.870 20197.00 50550.00 136.80 F 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.r154-tall-174876825200163.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 NoC3x3-PT-7B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825200163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 1748841680172

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 05:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:21:21] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2025-06-02 05:21:21] [INFO ] Transformed 7014 places.
[2025-06-02 05:21:21] [INFO ] Transformed 8833 transitions.
[2025-06-02 05:21:21] [INFO ] Found NUPN structural information;
[2025-06-02 05:21:21] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 459 ms.
Graph (trivial) has 7824 edges and 7014 vertex of which 4885 / 7014 are part of one of the 33 SCC in 23 ms
Free SCC test removed 4852 places
Structural test allowed to assert that 5697 places are NOT stable. Took 91 ms.
Ensure Unique test removed 5920 transitions
Reduce redundant transitions removed 5920 transitions.
RANDOM walk for 40000 steps (154 resets) in 3079 ms. (12 steps per ms) remains 106/1317 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
[2025-06-02 05:21:23] [INFO ] Flow matrix only has 2881 transitions (discarded 32 similar events)
// Phase 1: matrix 2881 rows 2162 cols
[2025-06-02 05:21:23] [INFO ] Computed 66 invariants in 36 ms
[2025-06-02 05:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1418/1524 variables, 39/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1524 variables, 1418/1563 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1524 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 638/2162 variables, 27/1590 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2162 variables, 638/2228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2162/5043 variables, and 2228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5056 ms.
Refiners :[Domain max(s): 2162/2162 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/2162 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1418/1524 variables, 39/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1524 variables, 1418/1563 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 250 places in 510 ms of which 60 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 251 places in 521 ms of which 7 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 212 places in 342 ms of which 6 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 6 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 206 places in 243 ms of which 5 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 117 places in 347 ms of which 8 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 211 places in 413 ms of which 7 ms to minimize.
SMT process timed out in 10319ms, After SMT, problems are : Problem set: 0 solved, 106 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 2913/2913 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 2162 transition count 2527
Reduce places removed 353 places and 0 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 739 place count 1809 transition count 2527
Discarding 665 places :
Symmetric choice reduction at 2 with 665 rule applications. Total rules 1404 place count 1144 transition count 1862
Iterating global reduction 2 with 665 rules applied. Total rules applied 2069 place count 1144 transition count 1862
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 2069 place count 1144 transition count 1824
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 2145 place count 1106 transition count 1824
Discarding 406 places :
Symmetric choice reduction at 2 with 406 rule applications. Total rules 2551 place count 700 transition count 1219
Iterating global reduction 2 with 406 rules applied. Total rules applied 2957 place count 700 transition count 1219
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 3349 place count 700 transition count 827
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 2 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 3599 place count 575 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3601 place count 574 transition count 721
Free-agglomeration rule applied 251 times.
Iterating global reduction 3 with 251 rules applied. Total rules applied 3852 place count 574 transition count 470
Reduce places removed 251 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 800 edges and 323 vertex of which 299 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 304 rules applied. Total rules applied 4156 place count 299 transition count 418
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 4177 place count 299 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 4209 place count 299 transition count 365
Applied a total of 4209 rules in 526 ms. Remains 299 /2162 variables (removed 1863) and now considering 365/2913 (removed 2548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 299/2162 places, 365/2913 transitions.
RANDOM walk for 4000000 steps (8 resets) in 16427 ms. (243 steps per ms) remains 1/106 properties
BEST_FIRST walk for 2679684 steps (6 resets) in 3499 ms. (765 steps per ms) remains 0/1 properties
Able to resolve query StableMarking after proving 1319 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 18897 ms.
ITS solved all properties within timeout

BK_STOP 1748841700369

--------------------
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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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 r154-tall-174876825200163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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