About the Execution of ITS-Tools for LeafsetExtension-PT-S08C3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 312.407 | 7133.00 | 14316.00 | 130.30 | 1 1 1 1 1 1 1 1 1 3 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/mcc2026-input.r162-smll-177961107900461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LeafsetExtension-PT-S08C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900461
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 9.3K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 15 11:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 254K Mar 3 18:30 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 LeafsetExtension-PT-S08C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779909739244
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 19:22:21] [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]
[2026-05-27 19:22:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 19:22:22] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2026-05-27 19:22:22] [INFO ] Transformed 462 places.
[2026-05-27 19:22:22] [INFO ] Transformed 409 transitions.
[2026-05-27 19:22:22] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5926506688278221328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7217515239509633751.kers'
[2026-05-27 19:22:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5926506688278221328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7217515239509633751.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 409 rows 450 cols 1132 entries
Finished phase 1 with 251 SingleSign rule and 158 generalized
[2026-05-27 19:22:22] [INFO ] Computed 53 invariants in 7 ms
Computed 53 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7217515239509633751.kers
Total runtime 9 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, 4, 1, 3, 1, 1, 1, 1]
RANDOM walk for 10000 steps (378 resets) in 88 ms. (112 steps per ms)
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (128 resets) in 45 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1] Max Struct:[4, 3]
[2026-05-27 19:22:22] [INFO ] Invariant cache hit.
[2026-05-27 19:22:23] [INFO ] [Real]Absence check using 20 positive place invariants in 36 ms returned sat
[2026-05-27 19:22:23] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 41 ms returned sat
[2026-05-27 19:22:23] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2026-05-27 19:22:23] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 76 ms.
[2026-05-27 19:22:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 19:22:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2026-05-27 19:22:24] [INFO ] [Nat]Absence check using 20 positive and 33 generalized place invariants in 20 ms returned sat
[2026-05-27 19:22:24] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-05-27 19:22:24] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 94 ms.
[2026-05-27 19:22:25] [INFO ] Added : 13 causal constraints over 3 iterations in 309 ms. Result :sat
Minimization took 170 ms.
[2026-05-27 19:22:25] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2026-05-27 19:22:25] [INFO ] [Real]Absence check using 20 positive and 33 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1] Max Struct:[4, 1]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 25 are kept as prefixes of interest. Removing 437 places using SCC suffix rule.3 ms
Discarding 437 places :
Also discarding 297 output transitions
Drop transitions (Output transitions of discarded places.) removed 297 transitions
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 21 transition count 26
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 15 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 11 transition count 22
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 11 transition count 17
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 115 place count 6 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 127 place count 6 transition count 5
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 2 transition count 2
Applied a total of 134 rules in 61 ms. Remains 2 /462 variables (removed 460) and now considering 2/409 (removed 407) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 2/462 places, 2/409 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7446418593532547240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-511936493189459742.kers'
[2026-05-27 19:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7446418593532547240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-511936493189459742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 19:22:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-511936493189459742.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000002 steps (111123 resets) in 423 ms. (2358 steps per ms)
BEST_FIRST walk for 1000001 steps (83336 resets) in 352 ms. (2832 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2026-05-27 19:22:26] [INFO ] Invariant cache hit.
[2026-05-27 19:22:26] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[3]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4621 ms.
BK_STOP 1779909746377
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="LeafsetExtension-PT-S08C3"
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-5973"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S08C3, 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 r162-smll-177961107900461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S08C3.tgz
mv LeafsetExtension-PT-S08C3 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 '
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 ;
