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-171640625700491.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-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625700491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 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 71K 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-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716557949058

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-12
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 13:39:10] [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:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:39:10] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-24 13:39:10] [INFO ] Transformed 160 places.
[2024-05-24 13:39:10] [INFO ] Transformed 340 transitions.
[2024-05-24 13:39:10] [INFO ] Found NUPN structural information;
[2024-05-24 13:39:10] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Normalized transition count is 300 out of 312 initially.
// Phase 1: matrix 300 rows 160 cols
[2024-05-24 13:39:10] [INFO ] Computed 18 invariants in 17 ms
Incomplete random walk after 10000 steps, including 720 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 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 87 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
[2024-05-24 13:39:10] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2024-05-24 13:39:11] [INFO ] Computed 18 invariants in 12 ms
[2024-05-24 13:39:11] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:11] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-24 13:39:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:39:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:11] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-24 13:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:39:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:39:11] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
[2024-05-24 13:39:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-24 13:39:11] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 26 ms.
[2024-05-24 13:39:11] [INFO ] Added : 12 causal constraints over 3 iterations in 94 ms. Result :sat
Minimization took 33 ms.
[2024-05-24 13:39:11] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:11] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-24 13:39:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:39:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:11] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-24 13:39:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:39:11] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 530 ms
[2024-05-24 13:39:12] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 23 ms.
[2024-05-24 13:39:12] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 13:39:12] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 13:39:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-24 13:39:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:39:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-24 13:39:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:12] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 13:39:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-24 13:39:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-05-24 13:39:12] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 22 ms.
[2024-05-24 13:39:13] [INFO ] Added : 29 causal constraints over 6 iterations in 129 ms. Result :sat
Minimization took 41 ms.
[2024-05-24 13:39:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:13] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-24 13:39:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:39:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:13] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:39:13] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-05-24 13:39:13] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-24 13:39:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-24 13:39:13] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2024-05-24 13:39:13] [INFO ] Added : 28 causal constraints over 6 iterations in 124 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 13:39:13] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:13] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-24 13:39:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:39:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:13] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-24 13:39:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 13:39:14] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 0 ms to minimize.
[2024-05-24 13:39:14] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-24 13:39:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-24 13:39:14] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 21 ms.
[2024-05-24 13:39:14] [INFO ] Added : 10 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 13:39:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:39:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:14] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 13:39:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:39:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:39:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:39:14] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-24 13:39:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:39:14] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 20 ms.
[2024-05-24 13:39:14] [INFO ] Added : 14 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 20 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-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 242 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 678 edges and 156 vertex of which 128 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 128 transition count 162
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 201 place count 46 transition count 80
Iterating global reduction 1 with 82 rules applied. Total rules applied 283 place count 46 transition count 80
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 283 place count 46 transition count 73
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 297 place count 39 transition count 73
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 310 place count 26 transition count 54
Iterating global reduction 1 with 13 rules applied. Total rules applied 323 place count 26 transition count 54
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 332 place count 26 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 334 place count 24 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 24 transition count 41
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 338 place count 22 transition count 39
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 22 transition count 39
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 346 place count 22 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 350 place count 20 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 20 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 352 place count 19 transition count 29
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 359 place count 11 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 376 place count 9 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 378 place count 9 transition count 9
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 381 place count 7 transition count 8
Applied a total of 381 rules in 35 ms. Remains 7 /160 variables (removed 153) and now considering 8/312 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 7/160 places, 8/312 transitions.
// Phase 1: matrix 8 rows 7 cols
[2024-05-24 13:39:14] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 142787 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4566 ms.

BK_STOP 1716557956210

--------------------
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-12"
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-12, 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-171640625700491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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