About the Execution of ITS-Tools for Philosophers-PT-000200
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.r210-smll-177969942000149.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 Philosophers-PT-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942000149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 201K Mar 5 12:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Mar 5 12:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 171K Mar 5 12:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Mar 5 12:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 106K Mar 16 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 426K Mar 16 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Mar 16 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 402K Mar 16 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 271K Mar 5 12:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Mar 5 12:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 141K Mar 5 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 888K Mar 5 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Mar 16 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Mar 16 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 445K 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 Philosophers-PT-000200-UpperBounds-00
FORMULA_NAME Philosophers-PT-000200-UpperBounds-01
FORMULA_NAME Philosophers-PT-000200-UpperBounds-02
FORMULA_NAME Philosophers-PT-000200-UpperBounds-03
FORMULA_NAME Philosophers-PT-000200-UpperBounds-04
FORMULA_NAME Philosophers-PT-000200-UpperBounds-05
FORMULA_NAME Philosophers-PT-000200-UpperBounds-06
FORMULA_NAME Philosophers-PT-000200-UpperBounds-07
FORMULA_NAME Philosophers-PT-000200-UpperBounds-08
FORMULA_NAME Philosophers-PT-000200-UpperBounds-09
FORMULA_NAME Philosophers-PT-000200-UpperBounds-10
FORMULA_NAME Philosophers-PT-000200-UpperBounds-11
FORMULA_NAME Philosophers-PT-000200-UpperBounds-12
FORMULA_NAME Philosophers-PT-000200-UpperBounds-13
FORMULA_NAME Philosophers-PT-000200-UpperBounds-14
FORMULA_NAME Philosophers-PT-000200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779885789000
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 12:43:11] [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 12:43:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 12:43:12] [INFO ] Load time of PNML (sax parser for PT used): 351 ms
[2026-05-27 12:43:12] [INFO ] Transformed 1000 places.
[2026-05-27 12:43:12] [INFO ] Transformed 1000 transitions.
[2026-05-27 12:43:12] [INFO ] Found NUPN structural information;
[2026-05-27 12:43:12] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 598 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 36 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 200, 0, 1, 0, 1, 0, 0, 1, 0, 1] Max Struct:[200, 200, 200, 200, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Philosophers-PT-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[200, 200, 200, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17003654776230956978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9219409353070002159.kers'
[2026-05-27 12:43:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17003654776230956978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9219409353070002159.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1000 rows 1000 cols 3200 entries
Finished phase 1 with 600 SingleSign rule and 0 generalized
[2026-05-27 12:43:12] [INFO ] Computed 400 invariants in 9 ms
Computed 400 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9219409353070002159.kers
Total runtime 13 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[200, 200, 200, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 455 ms. (21 steps per ms)
FORMULA Philosophers-PT-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 629 ms. (47 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[109, 32, 118] Max Struct:[200, 200, 200]
[2026-05-27 12:43:13] [INFO ] Invariant cache hit.
[2026-05-27 12:43:14] [INFO ] [Real]Absence check using 400 positive place invariants in 202 ms returned sat
[2026-05-27 12:43:15] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2026-05-27 12:43:16] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 170 ms.
[2026-05-27 12:43:16] [INFO ] Added : 14 causal constraints over 3 iterations in 742 ms. Result :sat
Minimization took 1974 ms.
[2026-05-27 12:43:19] [INFO ] [Real]Absence check using 400 positive place invariants in 209 ms returned sat
[2026-05-27 12:43:20] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2026-05-27 12:43:20] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 223 ms.
[2026-05-27 12:43:21] [INFO ] Added : 33 causal constraints over 7 iterations in 1126 ms. Result :sat
Minimization took 784 ms.
[2026-05-27 12:43:22] [INFO ] [Real]Absence check using 400 positive place invariants in 181 ms returned sat
[2026-05-27 12:43:23] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2026-05-27 12:43:23] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 76 ms.
[2026-05-27 12:43:23] [INFO ] Added : 10 causal constraints over 2 iterations in 303 ms. Result :sat
Minimization took 3268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[109, 32, 118] Max Struct:[200, 200, 200]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[109, 32, 118] Max Struct:[200, 200, 200]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 117 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2026-05-27 12:43:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[109, 32, 118] Max Struct:[200, 200, 200]
RANDOM walk for 1000000 steps (21 resets) in 26853 ms. (37 steps per ms)
FORMULA Philosophers-PT-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-PT-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 364409 steps (9 resets) in 5003 ms. (72 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[41] Max Struct:[200]
[2026-05-27 12:43:59] [INFO ] Invariant cache hit.
[2026-05-27 12:43:59] [INFO ] [Real]Absence check using 400 positive place invariants in 246 ms returned sat
[2026-05-27 12:44:00] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2026-05-27 12:44:00] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 72 ms.
[2026-05-27 12:44:01] [INFO ] Added : 42 causal constraints over 9 iterations in 989 ms. Result :sat
Minimization took 834 ms.
[2026-05-27 12:44:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 12:44:03] [INFO ] [Nat]Absence check using 400 positive place invariants in 145 ms returned sat
[2026-05-27 12:44:03] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2026-05-27 12:44:03] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 162 ms.
[2026-05-27 12:44:04] [INFO ] Added : 42 causal constraints over 9 iterations in 824 ms. Result :sat
Minimization took 1012 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[41] Max Struct:[200]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[99] Max Struct:[200]
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 1000 transition count 600
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 1000 place count 600 transition count 400
Applied a total of 1000 rules in 262 ms. Remains 600 /1000 variables (removed 400) and now considering 400/1000 (removed 600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 600/1000 places, 400/1000 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5131935810285698935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12971641205239703204.kers'
[2026-05-27 12:44:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5131935810285698935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12971641205239703204.kers]
Culling duplicate invariants (modulo rational): removing 200 columns.
Culled 200 columns in 0 ms.
// Phase 1: matrix 400 rows 400 cols 1200 entries
Finished phase 1 with 0 SingleSign rule and 200 generalized
[2026-05-27 12:44:07] [INFO ] Computed 400 invariants in 3 ms
Computed 400 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12971641205239703204.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[99] Max Struct:[200]
RANDOM walk for 1000000 steps (2 resets) in 29917 ms. (33 steps per ms)
BEST_FIRST walk for 280148 steps (0 resets) in 5001 ms. (56 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[99] Max Struct:[200]
[2026-05-27 12:44:42] [INFO ] Invariant cache hit.
[2026-05-27 12:44:42] [INFO ] [Real]Absence check using 200 positive place invariants in 82 ms returned sat
[2026-05-27 12:44:42] [INFO ] [Real]Absence check using 200 positive and 200 generalized place invariants in 272 ms returned sat
[2026-05-27 12:44:43] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2026-05-27 12:44:43] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 30 ms.
[2026-05-27 12:44:43] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[99] Max Struct:[200]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[200]
Support contains 200 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 19 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 600/600 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2026-05-27 12:44:43] [INFO ] Invariant cache hit.
[2026-05-27 12:44:44] [INFO ] Implicit Places using invariants in 886 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 193, 194, 196, 197, 198, 199, 200, 201, 202, 203, 204]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 892 ms to find 200 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/600 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 922 ms. Remains : 400/600 places, 400/400 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12148491157683361125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14125846024905681264.kers'
[2026-05-27 12:44:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12148491157683361125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14125846024905681264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 400 cols 1200 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-27 12:44:44] [INFO ] Computed 200 invariants in 1 ms
Computed 200 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14125846024905681264.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[200]
RANDOM walk for 1000000 steps (2 resets) in 20464 ms. (48 steps per ms)
BEST_FIRST walk for 390421 steps (1 resets) in 5001 ms. (78 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[100] Max Struct:[200]
[2026-05-27 12:45:09] [INFO ] Invariant cache hit.
[2026-05-27 12:45:10] [INFO ] [Real]Absence check using 200 positive place invariants in 184 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[100] Max Struct:[100]
FORMULA Philosophers-PT-000200-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Philosophers-PT-000200-UpperBounds-01 100 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 118814 ms.
BK_STOP 1779885910319
--------------------
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="Philosophers-PT-000200"
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 Philosophers-PT-000200, 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 r210-smll-177969942000149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 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 ;