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.r197-tall-171640625800501.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 gold2023
Input is HealthRecord-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625800501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 20:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 72K 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 HealthRecord-PT-14-UpperBounds-00
FORMULA_NAME HealthRecord-PT-14-UpperBounds-01
FORMULA_NAME HealthRecord-PT-14-UpperBounds-02
FORMULA_NAME HealthRecord-PT-14-UpperBounds-03
FORMULA_NAME HealthRecord-PT-14-UpperBounds-04
FORMULA_NAME HealthRecord-PT-14-UpperBounds-05
FORMULA_NAME HealthRecord-PT-14-UpperBounds-06
FORMULA_NAME HealthRecord-PT-14-UpperBounds-07
FORMULA_NAME HealthRecord-PT-14-UpperBounds-08
FORMULA_NAME HealthRecord-PT-14-UpperBounds-09
FORMULA_NAME HealthRecord-PT-14-UpperBounds-10
FORMULA_NAME HealthRecord-PT-14-UpperBounds-11
FORMULA_NAME HealthRecord-PT-14-UpperBounds-12
FORMULA_NAME HealthRecord-PT-14-UpperBounds-13
FORMULA_NAME HealthRecord-PT-14-UpperBounds-14
FORMULA_NAME HealthRecord-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716558244318

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=HealthRecord-PT-14
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 13:44:06] [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-24 13:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:44:06] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-24 13:44:06] [INFO ] Transformed 162 places.
[2024-05-24 13:44:06] [INFO ] Transformed 347 transitions.
[2024-05-24 13:44:06] [INFO ] Found NUPN structural information;
[2024-05-24 13:44:06] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Normalized transition count is 306 out of 318 initially.
// Phase 1: matrix 306 rows 162 cols
[2024-05-24 13:44:06] [INFO ] Computed 18 invariants in 19 ms
Incomplete random walk after 10000 steps, including 842 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
[2024-05-24 13:44:06] [INFO ] Flow matrix only has 306 transitions (discarded 12 similar events)
// Phase 1: matrix 306 rows 162 cols
[2024-05-24 13:44:06] [INFO ] Computed 18 invariants in 12 ms
[2024-05-24 13:44:06] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-24 13:44:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2024-05-24 13:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:06] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-24 13:44:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:44:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 13:44:06] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2024-05-24 13:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:06] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-24 13:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-24 13:44:07] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-24 13:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-24 13:44:07] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 23 ms.
[2024-05-24 13:44:07] [INFO ] Added : 13 causal constraints over 3 iterations in 109 ms. Result :sat
Minimization took 35 ms.
[2024-05-24 13:44:07] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:44:07] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:07] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-24 13:44:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:44:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:44:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:07] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-24 13:44:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:44:07] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2024-05-24 13:44:07] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-24 13:44:07] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2024-05-24 13:44:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 355 ms
[2024-05-24 13:44:07] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 23 ms.
[2024-05-24 13:44:08] [INFO ] Added : 8 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-24 13:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:44:08] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 20 ms.
[2024-05-24 13:44:08] [INFO ] Added : 11 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 31 ms.
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 13:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:44:08] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 19 ms.
[2024-05-24 13:44:08] [INFO ] Added : 10 causal constraints over 2 iterations in 65 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:08] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-24 13:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:08] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-24 13:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:44:08] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 19 ms.
[2024-05-24 13:44:09] [INFO ] Added : 13 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 13:44:09] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:44:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:09] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-24 13:44:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:44:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:44:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:44:09] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 13:44:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:44:09] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-24 13:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-24 13:44:09] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 19 ms.
[2024-05-24 13:44:09] [INFO ] Added : 12 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 318/318 transitions.
Graph (trivial) has 243 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 692 edges and 159 vertex of which 133 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 133 transition count 170
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 206 place count 49 transition count 86
Iterating global reduction 1 with 84 rules applied. Total rules applied 290 place count 49 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 290 place count 49 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 304 place count 42 transition count 79
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 317 place count 29 transition count 58
Iterating global reduction 1 with 13 rules applied. Total rules applied 330 place count 29 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 339 place count 29 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 340 place count 28 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 28 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 342 place count 28 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 348 place count 25 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 25 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 350 place count 24 transition count 42
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 353 place count 22 transition count 41
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 364 place count 22 transition count 30
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 366 place count 21 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 367 place count 20 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 368 place count 20 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 369 place count 20 transition count 27
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 373 place count 20 transition count 23
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 377 place count 16 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 16 transition count 23
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 379 place count 16 transition count 22
Applied a total of 379 rules in 56 ms. Remains 16 /162 variables (removed 146) and now considering 22/318 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 16/162 places, 22/318 transitions.
// Phase 1: matrix 22 rows 16 cols
[2024-05-24 13:44:09] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 74494 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4070 ms.

BK_STOP 1716558251156

--------------------
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="HealthRecord-PT-14"
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 HealthRecord-PT-14, 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 r197-tall-171640625800501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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