Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460600161.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460600161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 PolyORBLF-PT-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717117942428

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 01:12:24] [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]
[2024-05-31 01:12:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:12:24] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-31 01:12:24] [INFO ] Transformed 844 places.
[2024-05-31 01:12:24] [INFO ] Transformed 1812 transitions.
[2024-05-31 01:12:24] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Normalized transition count is 1632 out of 1652 initially.
// Phase 1: matrix 1632 rows 844 cols
[2024-05-31 01:12:24] [INFO ] Computed 58 invariants in 121 ms
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :14
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :12
[2024-05-31 01:12:25] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-31 01:12:25] [INFO ] Computed 58 invariants in 95 ms
[2024-05-31 01:12:25] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2024-05-31 01:12:25] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 25 ms returned unsat
[2024-05-31 01:12:25] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-31 01:12:25] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 47 ms returned unsat
[2024-05-31 01:12:25] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-31 01:12:25] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 21 ms returned unsat
[2024-05-31 01:12:26] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-31 01:12:26] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned sat
[2024-05-31 01:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:27] [INFO ] [Real]Absence check using state equation in 1477 ms returned sat
[2024-05-31 01:12:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:12:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-31 01:12:27] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 47 ms returned sat
[2024-05-31 01:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:32] [INFO ] [Nat]Absence check using state equation in 4830 ms returned unknown
[2024-05-31 01:12:32] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-31 01:12:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 52 ms returned sat
[2024-05-31 01:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:33] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2024-05-31 01:12:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:12:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2024-05-31 01:12:34] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 57 ms returned sat
[2024-05-31 01:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:35] [INFO ] [Nat]Absence check using state equation in 1579 ms returned sat
[2024-05-31 01:12:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:12:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 01:12:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 3226 ms returned unknown
[2024-05-31 01:12:39] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-31 01:12:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 27 ms returned unsat
[2024-05-31 01:12:39] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 01:12:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 31 ms returned sat
[2024-05-31 01:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:40] [INFO ] [Real]Absence check using state equation in 1659 ms returned sat
[2024-05-31 01:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:12:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-31 01:12:41] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 44 ms returned sat
[2024-05-31 01:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:45] [INFO ] [Nat]Absence check using state equation in 4840 ms returned unknown
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 60 ms returned unsat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 26 ms returned unsat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 34 ms returned unsat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-31 01:12:46] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1, 2, -1, -1, 1, -1, 1, 1, 1, 1, 1] Max seen :[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 31 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 315 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
[2024-05-31 01:12:47] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-31 01:12:47] [INFO ] Computed 56 invariants in 27 ms
[2024-05-31 01:12:48] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 552/844 places, 1252/1652 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 551 transition count 1232
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 11 place count 541 transition count 1212
Deduced a syphon composed of 11 places in 1 ms
Applied a total of 11 rules in 41 ms. Remains 541 /552 variables (removed 11) and now considering 1212/1252 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1506 ms. Remains : 541/844 places, 1212/1652 transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1192 out of 1212 initially.
// Phase 1: matrix 1192 rows 530 cols
[2024-05-31 01:12:48] [INFO ] Computed 56 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 336 resets, run finished after 5753 ms. (steps per millisecond=173 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 913 resets, run finished after 2696 ms. (steps per millisecond=370 ) properties (out of 1) seen :1
[2024-05-31 01:12:56] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 530 cols
[2024-05-31 01:12:56] [INFO ] Computed 56 invariants in 59 ms
[2024-05-31 01:12:57] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 01:12:57] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 22 ms returned sat
[2024-05-31 01:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:58] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2024-05-31 01:12:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:12:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 01:12:58] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 21 ms returned sat
[2024-05-31 01:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:12:59] [INFO ] [Nat]Absence check using state equation in 1393 ms returned sat
[2024-05-31 01:12:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 01:13:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 1123 ms returned sat
[2024-05-31 01:13:01] [INFO ] Deduced a trap composed of 121 places in 229 ms of which 4 ms to minimize.
[2024-05-31 01:13:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 308 ms
Current structural bounds on expressions (after SMT) : [1, -1, -1] Max seen :[1, 0, 0]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 37040 ms.

BK_STOP 1717117981341

--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r307-tajo-171654460600161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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