Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418900573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DrinkVendingMachine-COL-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418900573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 04:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22K Mar 5 18:22 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 DrinkVendingMachine-COL-02-UpperBounds-00
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-01
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-02
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-03
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-04
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-05
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-06
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-07
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-08
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-09
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-10
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-11
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-12
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-13
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-14
FORMULA_NAME DrinkVendingMachine-COL-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678971040463

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 12:50:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 12:50:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 12:50:43] [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.
[2023-03-16 12:50:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 12:50:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 902 ms
[2023-03-16 12:50:44] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-16 12:50:44] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2023-03-16 12:50:44] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 12:50:44] [INFO ] Computed 3 place invariants in 4 ms
FORMULA DrinkVendingMachine-COL-02-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 12:50:44] [INFO ] Invariant cache hit.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 12:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-16 12:50:44] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:50:44] [INFO ] Added : 3 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 12:50:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-16 12:50:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-16 12:50:45] [INFO ] Computed and/alt/rep : 4/12/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 12:50:45] [INFO ] Added : 3 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [2, 2, 2, 8, 8, 2, 2, 2]
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:8) in guard (AND (GT $x 5) (LEQ $x 7))introduces in Quality(8) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:8) in guard (AND (GT $x 3) (LEQ $x 5))introduces in Quality(8) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:8) in guard (AND (GT $x 1) (LEQ $x 3))introduces in Quality(8) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:8) in guard (LEQ $x 1)introduces in Quality(8) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 8 reducing to 4 values.
For transition elaborate3:(AND (GT $x 5) (LEQ $x 7)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 3) (LEQ $x 5)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 1) (LEQ $x 3)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 1) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 2
[2023-03-16 12:50:45] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 18 ms.
[2023-03-16 12:50:45] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :24
FORMULA DrinkVendingMachine-COL-02-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-02-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-02-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-02-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-02-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-02-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :12
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 12:50:45] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 12:50:45] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 12:50:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 12:50:45] [INFO ] Computed and/alt/rep : 7/12/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 12:50:45] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 12:50:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 12:50:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 12:50:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 12:50:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-16 12:50:45] [INFO ] Computed and/alt/rep : 7/12/7 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 12:50:45] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[6, 6]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 1 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 7 rules in 15 ms. Remains 7 /12 variables (removed 5) and now considering 6/10 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 7/12 places, 6/10 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 12:50:45] [INFO ] Computed 3 place invariants in 1 ms
FORMULA DrinkVendingMachine-COL-02-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 2861 ms.
ITS solved all properties within timeout

BK_STOP 1678971046970

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DrinkVendingMachine-COL-02"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DrinkVendingMachine-COL-02, 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 r137-smll-167819418900573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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