About the Execution of LTSMin+red for Philosophers-COL-000020
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407500397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is Philosophers-COL-000020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407500397
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.9K Apr 13 09:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 09:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 09:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 09:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 09:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 13 09:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K May 18 16:43 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
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000020-UpperBounds-00
FORMULA_NAME Philosophers-COL-000020-UpperBounds-01
FORMULA_NAME Philosophers-COL-000020-UpperBounds-02
FORMULA_NAME Philosophers-COL-000020-UpperBounds-03
FORMULA_NAME Philosophers-COL-000020-UpperBounds-04
FORMULA_NAME Philosophers-COL-000020-UpperBounds-05
FORMULA_NAME Philosophers-COL-000020-UpperBounds-06
FORMULA_NAME Philosophers-COL-000020-UpperBounds-07
FORMULA_NAME Philosophers-COL-000020-UpperBounds-08
FORMULA_NAME Philosophers-COL-000020-UpperBounds-09
FORMULA_NAME Philosophers-COL-000020-UpperBounds-10
FORMULA_NAME Philosophers-COL-000020-UpperBounds-11
FORMULA_NAME Philosophers-COL-000020-UpperBounds-12
FORMULA_NAME Philosophers-COL-000020-UpperBounds-13
FORMULA_NAME Philosophers-COL-000020-UpperBounds-14
FORMULA_NAME Philosophers-COL-000020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717301777561
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 04:16:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 04:16:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 04:16:20] [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.
[2024-06-02 04:16:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-02 04:16:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1225 ms
[2024-06-02 04:16:21] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2024-06-02 04:16:21] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-06-02 04:16:21] [INFO ] Skeletonized 5 HLPN properties in 1 ms.
// Phase 1: matrix 5 rows 5 cols
[2024-06-02 04:16:21] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 20, 20, 0] Max Struct:[10, 20, 20, 20, 20]
FORMULA Philosophers-COL-000020-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-02 04:16:21] [INFO ] Invariant cache hit.
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-02 04:16:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-02 04:16:22] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 16 ms.
[2024-06-02 04:16:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 04:16:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-02 04:16:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-02 04:16:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 04:16:22] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-02 04:16:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 04:16:22] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-02 04:16:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 04:16:22] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[10, 20, 20]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 20) 20) 20)]] contains successor/predecessor on variables of sort Philo
[2024-06-02 04:16:22] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions 320 arcs in 40 ms.
[2024-06-02 04:16:22] [INFO ] Unfolded 3 HLPN properties in 1 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:[10, 20, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[10, 20, 20]
// Phase 1: matrix 100 rows 100 cols
[2024-06-02 04:16:22] [INFO ] Computed 40 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[10, 20, 20]
RANDOM walk for 10000 steps (21 resets) in 94 ms. (105 steps per ms)
FORMULA Philosophers-COL-000020-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000020-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 30 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[10]
[2024-06-02 04:16:22] [INFO ] Invariant cache hit.
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2024-06-02 04:16:22] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 04:16:22] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-02 04:16:22] [INFO ] Added : 9 causal constraints over 2 iterations in 57 ms. Result :sat
Minimization took 18 ms.
[2024-06-02 04:16:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 04:16:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-06-02 04:16:23] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-02 04:16:23] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-02 04:16:23] [INFO ] Added : 9 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[10]
Support contains 20 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 100/100 transitions.
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 100 transition count 60
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 100 place count 60 transition count 40
Applied a total of 100 rules in 47 ms. Remains 60 /100 variables (removed 40) and now considering 40/100 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 60/100 places, 40/100 transitions.
// Phase 1: matrix 40 rows 60 cols
[2024-06-02 04:16:23] [INFO ] Computed 40 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[10]
FORMULA Philosophers-COL-000020-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2351 ms. (425 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 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5585 ms.
ITS solved all properties within timeout
BK_STOP 1717301785934
--------------------
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 UpperBounds -timeout 360 -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="Philosophers-COL-000020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-COL-000020, 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 r512-smll-171654407500397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000020.tgz
mv Philosophers-COL-000020 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;