Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477300189.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 6.1K Apr 30 11:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 11:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 11:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 11:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 73K May 10 09:34 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 HealthRecord-PT-15-UpperBounds-00
FORMULA_NAME HealthRecord-PT-15-UpperBounds-01
FORMULA_NAME HealthRecord-PT-15-UpperBounds-02
FORMULA_NAME HealthRecord-PT-15-UpperBounds-03
FORMULA_NAME HealthRecord-PT-15-UpperBounds-04
FORMULA_NAME HealthRecord-PT-15-UpperBounds-05
FORMULA_NAME HealthRecord-PT-15-UpperBounds-06
FORMULA_NAME HealthRecord-PT-15-UpperBounds-07
FORMULA_NAME HealthRecord-PT-15-UpperBounds-08
FORMULA_NAME HealthRecord-PT-15-UpperBounds-09
FORMULA_NAME HealthRecord-PT-15-UpperBounds-10
FORMULA_NAME HealthRecord-PT-15-UpperBounds-11
FORMULA_NAME HealthRecord-PT-15-UpperBounds-12
FORMULA_NAME HealthRecord-PT-15-UpperBounds-13
FORMULA_NAME HealthRecord-PT-15-UpperBounds-14
FORMULA_NAME HealthRecord-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652695354869

Running Version 202205111006
[2022-05-16 10:02:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 10:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:02:37] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2022-05-16 10:02:37] [INFO ] Transformed 163 places.
[2022-05-16 10:02:37] [INFO ] Transformed 348 transitions.
[2022-05-16 10:02:37] [INFO ] Found NUPN structural information;
[2022-05-16 10:02:37] [INFO ] Parsed PT model containing 163 places and 348 transitions in 307 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Normalized transition count is 307 out of 319 initially.
// Phase 1: matrix 307 rows 163 cols
[2022-05-16 10:02:37] [INFO ] Computed 18 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 916 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
[2022-05-16 10:02:37] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2022-05-16 10:02:37] [INFO ] Computed 18 place invariants in 10 ms
[2022-05-16 10:02:37] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2022-05-16 10:02:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2022-05-16 10:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:37] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-05-16 10:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:02:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 10:02:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 10:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:38] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-16 10:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 10:02:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 10:02:38] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 5 ms to minimize.
[2022-05-16 10:02:38] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2022-05-16 10:02:38] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2022-05-16 10:02:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2022-05-16 10:02:38] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 48 ms.
[2022-05-16 10:02:39] [INFO ] Added : 12 causal constraints over 3 iterations in 163 ms. Result :sat
Minimization took 50 ms.
[2022-05-16 10:02:39] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:39] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-16 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:02:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:39] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 10:02:39] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 38 ms.
[2022-05-16 10:02:39] [INFO ] Added : 10 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 10:02:39] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:39] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 10:02:39] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:02:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:40] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 10:02:40] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 38 ms.
[2022-05-16 10:02:40] [INFO ] Added : 17 causal constraints over 5 iterations in 149 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 10:02:40] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:40] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:02:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:40] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-16 10:02:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2022-05-16 10:02:40] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 49 ms.
[2022-05-16 10:02:41] [INFO ] Added : 18 causal constraints over 5 iterations in 238 ms. Result :sat
Minimization took 55 ms.
[2022-05-16 10:02:41] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 10:02:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 10:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:41] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-05-16 10:02:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:02:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 10:02:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 10:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:02:41] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-05-16 10:02:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 10:02:41] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2022-05-16 10:02:42] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2022-05-16 10:02:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2022-05-16 10:02:42] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 45 ms.
[2022-05-16 10:02:42] [INFO ] Added : 5 causal constraints over 1 iterations in 108 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 163 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 317/317 transitions.
Graph (trivial) has 247 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 693 edges and 160 vertex of which 134 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 134 transition count 167
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 210 place count 48 transition count 81
Iterating global reduction 1 with 86 rules applied. Total rules applied 296 place count 48 transition count 81
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 296 place count 48 transition count 72
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 314 place count 39 transition count 72
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 329 place count 24 transition count 49
Iterating global reduction 1 with 15 rules applied. Total rules applied 344 place count 24 transition count 49
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 353 place count 24 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 357 place count 20 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 361 place count 20 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 362 place count 20 transition count 32
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 17 transition count 29
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 17 transition count 29
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 377 place count 17 transition count 20
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 4 with 2 rules applied. Total rules applied 379 place count 16 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 15 transition count 18
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 384 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 390 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 390 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 392 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 393 place count 10 transition count 10
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 6 with 2 rules applied. Total rules applied 395 place count 9 transition count 9
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 398 place count 9 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 402 place count 7 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 402 place count 7 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 404 place count 6 transition count 3
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 406 place count 4 transition count 1
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 408 place count 2 transition count 1
Applied a total of 408 rules in 96 ms. Remains 2 /163 variables (removed 161) and now considering 1/317 (removed 316) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/163 places, 1/317 transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-05-16 10:02:42] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6177 ms.

BK_STOP 1652695363180

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="HealthRecord-PT-15"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-15, 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 r114-smll-165264477300189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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