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

About the Execution of ITS-Tools for MAPK-PT-00020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 4084.00 0.00 0.00 15 15 15 15 5 15 10 15 10 10 15 10 20 10 10 5 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423400813.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 itstools
Input is MAPK-PT-00020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423400813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-00020-UpperBounds-00
FORMULA_NAME MAPK-PT-00020-UpperBounds-01
FORMULA_NAME MAPK-PT-00020-UpperBounds-02
FORMULA_NAME MAPK-PT-00020-UpperBounds-03
FORMULA_NAME MAPK-PT-00020-UpperBounds-04
FORMULA_NAME MAPK-PT-00020-UpperBounds-05
FORMULA_NAME MAPK-PT-00020-UpperBounds-06
FORMULA_NAME MAPK-PT-00020-UpperBounds-07
FORMULA_NAME MAPK-PT-00020-UpperBounds-08
FORMULA_NAME MAPK-PT-00020-UpperBounds-09
FORMULA_NAME MAPK-PT-00020-UpperBounds-10
FORMULA_NAME MAPK-PT-00020-UpperBounds-11
FORMULA_NAME MAPK-PT-00020-UpperBounds-12
FORMULA_NAME MAPK-PT-00020-UpperBounds-13
FORMULA_NAME MAPK-PT-00020-UpperBounds-14
FORMULA_NAME MAPK-PT-00020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748906263509

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-00020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 23:17:45] [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-02 23:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:17:45] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2025-06-02 23:17:45] [INFO ] Transformed 22 places.
[2025-06-02 23:17:45] [INFO ] Transformed 30 transitions.
[2025-06-02 23:17:45] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 15, 15, 0, 15, 0, 0, 0, 0, 0, 0, 20, 0, 10, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 15, 15, 0, 15, 0, 0, 0, 0, 0, 0, 20, 0, 10, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 30 rows 22 cols
[2025-06-02 23:17:45] [INFO ] Computed 7 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 15, 15, 0, 15, 0, 0, 0, 0, 0, 0, 20, 0, 10, 5] Max Struct:[15, 15, 15, 15, 5, 15, 10, 15, 10, 10, 15, 10, 20, 10, 10, 5]
FORMULA MAPK-PT-00020-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00020-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00020-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00020-UpperBounds-05 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00020-UpperBounds-03 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00020-UpperBounds-02 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 steps per ms)
FORMULA MAPK-PT-00020-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00020-UpperBounds-10 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00020-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00020-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00020-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00020-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00020-UpperBounds-00 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 47 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 5] Max Struct:[15, 15, 10]
[2025-06-02 23:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:17:45] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 23:17:45] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-02 23:17:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2025-06-02 23:17:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:17:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 23:17:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 23:17:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2025-06-02 23:17:45] [INFO ] Added : 15 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:17:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-02 23:17:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 23:17:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 4 ms.
[2025-06-02 23:17:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:17:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 23:17:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 23:17:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2025-06-02 23:17:45] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:17:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-02 23:17:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 23:17:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2025-06-02 23:17:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:17:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-02 23:17:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 23:17:45] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2025-06-02 23:17:45] [INFO ] Added : 19 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 5] Max Struct:[15, 15, 10]
FORMULA MAPK-PT-00020-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 12] Max Struct:[15, 15]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 11 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 7 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 7 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 7 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 40 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 44 place count 4 transition count 3
Applied a total of 44 rules in 39 ms. Remains 4 /22 variables (removed 18) and now considering 3/30 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 4/22 places, 3/30 transitions.
// Phase 1: matrix 3 rows 4 cols
[2025-06-02 23:17:46] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 12] Max Struct:[15, 15]
FORMULA MAPK-PT-00020-UpperBounds-01 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000001 steps (2 resets) in 349 ms. (2857 steps per ms)
FORMULA MAPK-PT-00020-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 770 ms. (1297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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-02 23:17:47] [INFO ] Flatten gal took : 17 ms
[2025-06-02 23:17:47] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:17:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7347765681653116740.gal : 4 ms
[2025-06-02 23:17:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13899304728058542734.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7347765681653116740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13899304728058542734.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 2549 ms.

BK_STOP 1748906267593

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="MAPK-PT-00020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MAPK-PT-00020, 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 r114-tall-174876423400813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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