Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253200029.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 Philosophers-COL-000050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253200029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 95K 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.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 12K 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 Philosophers-COL-000050-UpperBounds-00
FORMULA_NAME Philosophers-COL-000050-UpperBounds-01
FORMULA_NAME Philosophers-COL-000050-UpperBounds-02
FORMULA_NAME Philosophers-COL-000050-UpperBounds-03
FORMULA_NAME Philosophers-COL-000050-UpperBounds-04
FORMULA_NAME Philosophers-COL-000050-UpperBounds-05
FORMULA_NAME Philosophers-COL-000050-UpperBounds-06
FORMULA_NAME Philosophers-COL-000050-UpperBounds-07
FORMULA_NAME Philosophers-COL-000050-UpperBounds-08
FORMULA_NAME Philosophers-COL-000050-UpperBounds-09
FORMULA_NAME Philosophers-COL-000050-UpperBounds-10
FORMULA_NAME Philosophers-COL-000050-UpperBounds-11
FORMULA_NAME Philosophers-COL-000050-UpperBounds-12
FORMULA_NAME Philosophers-COL-000050-UpperBounds-13
FORMULA_NAME Philosophers-COL-000050-UpperBounds-14
FORMULA_NAME Philosophers-COL-000050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841578666

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-02 05:19:39] [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 05:19:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:19:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:19:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 509 ms
[2025-06-02 05:19:40] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2025-06-02 05:19:40] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2025-06-02 05:19:40] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2025-06-02 05:19:40] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 50, 0, 0, 50] Max Struct:[50, 50, 50, 25, 50]
FORMULA Philosophers-COL-000050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 05:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:19:40] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:19:40] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:19:40] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:19:40] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:19:40] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:19:40] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:19:40] [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 05:19:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:19:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:19:40] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:19:40] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[50, 50, 25]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2025-06-02 05:19:40] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 37 ms.
[2025-06-02 05:19:40] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[50, 50, 25]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[50, 50, 25]
// Phase 1: matrix 250 rows 250 cols
[2025-06-02 05:19:40] [INFO ] Computed 100 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[50, 50, 25]
RANDOM walk for 10000 steps (5 resets) in 82 ms. (120 steps per ms)
FORMULA Philosophers-COL-000050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (3 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13] Max Struct:[25]
[2025-06-02 05:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 05:19:41] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2025-06-02 05:19:41] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-06-02 05:19:41] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 05:19:41] [INFO ] Added : 14 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 30 ms.
[2025-06-02 05:19:41] [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 05:19:41] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2025-06-02 05:19:41] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-02 05:19:41] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 05:19:41] [INFO ] Added : 14 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13] Max Struct:[25]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[25] Max Struct:[25]
Support contains 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 250 transition count 150
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 250 place count 150 transition count 100
Applied a total of 250 rules in 47 ms. Remains 150 /250 variables (removed 100) and now considering 100/250 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 150/250 places, 100/250 transitions.
// Phase 1: matrix 100 rows 150 cols
[2025-06-02 05:19:41] [INFO ] Computed 100 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[25]
FORMULA Philosophers-COL-000050-UpperBounds-09 25 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 4255 ms. (234 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 05:19:46] [INFO ] Flatten gal took : 27 ms
[2025-06-02 05:19:46] [INFO ] Flatten gal took : 21 ms
[2025-06-02 05:19:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3250384071428696614.gal : 8 ms
[2025-06-02 05:19:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1966791177832190062.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/ReachabilityCardinality3250384071428696614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1966791177832190062.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 6432 ms.

BK_STOP 1748841586330

--------------------
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="Philosophers-COL-000050"
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 Philosophers-COL-000050, 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 r156-tall-174881253200029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000050.tgz
mv Philosophers-COL-000050 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 ;