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.r496-tall-171640603300389.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 GPPP-PT-C0010N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603300389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 08:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C0010N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717196233160

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:57:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:57:14] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-31 22:57:14] [INFO ] Transformed 33 places.
[2024-05-31 22:57:14] [INFO ] Transformed 22 transitions.
[2024-05-31 22:57:14] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 200, 0, 200, 0, 0, 100, 0, 400, 70, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 200, 0, 200, 0, 0, 100, 0, 400, 70, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 22:57:14] [INFO ] Computed 12 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 200, 0, 200, 0, 0, 100, 0, 400, 70, 1, 0, 0, 0] Max Struct:[60, 7, 45, 200, 7, 200, 45, 90, 100, 20, 540, 70, 1, 9660, 45, 350]
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-11 70 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10004 steps (23 resets) in 28 ms. (344 steps per ms)
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100007 steps (24 resets) in 92 ms. (1075 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 40, 2, 40, 10, 405, 30, 38, 10] Max Struct:[60, 7, 45, 7, 45, 90, 540, 9660, 45, 350]
[2024-05-31 22:57:14] [INFO ] Invariant cache hit.
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned unsat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-31 22:57:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 22:57:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 22:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 22:57:15] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:57:15] [INFO ] Added : 20 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 22:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using state equation in 50 ms returned unsat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-31 22:57:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 40, 2, 40, 10, 405, 30, 38, 10] Max Struct:[1, 2, 40, 2, 40, 10, 540, 30, 38, 10]
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-14 38 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-13 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-06 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-02 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[407] Max Struct:[540]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 35 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-31 22:57:15] [INFO ] Computed 10 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD13 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 34 constraints, problems are : Problem set: 1 solved, 12 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-31 22:57:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 12/47 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/38 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 47 constraints, problems are : Problem set: 1 solved, 12 unsolved in 3696 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 3888ms problems are : Problem set: 1 solved, 12 unsolved
Search for dead transitions found 1 dead transitions in 3897ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/33 places, 13/22 transitions.
Graph (complete) has 62 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3948 ms. Remains : 23/33 places, 13/22 transitions.
// Phase 1: matrix 13 rows 23 cols
[2024-05-31 22:57:19] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[407] Max Struct:[470]
RANDOM walk for 1000017 steps (5550 resets) in 418 ms. (2386 steps per ms)
BEST_FIRST walk for 1000001 steps (2151 resets) in 377 ms. (2645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[407] Max Struct:[470]
[2024-05-31 22:57:20] [INFO ] Invariant cache hit.
[2024-05-31 22:57:20] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:57:20] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[407] Max Struct:[407]
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-10 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 6044 ms.
ITS solved all properties within timeout

BK_STOP 1717196240410

--------------------
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="GPPP-PT-C0010N0000000100"
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 GPPP-PT-C0010N0000000100, 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 r496-tall-171640603300389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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 ;