Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 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-11-UpperBounds-00
FORMULA_NAME HealthRecord-PT-11-UpperBounds-01
FORMULA_NAME HealthRecord-PT-11-UpperBounds-02
FORMULA_NAME HealthRecord-PT-11-UpperBounds-03
FORMULA_NAME HealthRecord-PT-11-UpperBounds-04
FORMULA_NAME HealthRecord-PT-11-UpperBounds-05
FORMULA_NAME HealthRecord-PT-11-UpperBounds-06
FORMULA_NAME HealthRecord-PT-11-UpperBounds-07
FORMULA_NAME HealthRecord-PT-11-UpperBounds-08
FORMULA_NAME HealthRecord-PT-11-UpperBounds-09
FORMULA_NAME HealthRecord-PT-11-UpperBounds-10
FORMULA_NAME HealthRecord-PT-11-UpperBounds-11
FORMULA_NAME HealthRecord-PT-11-UpperBounds-12
FORMULA_NAME HealthRecord-PT-11-UpperBounds-13
FORMULA_NAME HealthRecord-PT-11-UpperBounds-14
FORMULA_NAME HealthRecord-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678578717008

Running Version 202205111006
[2023-03-11 23:51:58] [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]
[2023-03-11 23:51:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:51:59] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-11 23:51:59] [INFO ] Transformed 159 places.
[2023-03-11 23:51:59] [INFO ] Transformed 334 transitions.
[2023-03-11 23:51:59] [INFO ] Found NUPN structural information;
[2023-03-11 23:51:59] [INFO ] Parsed PT model containing 159 places and 334 transitions in 424 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Normalized transition count is 295 out of 307 initially.
// Phase 1: matrix 295 rows 159 cols
[2023-03-11 23:51:59] [INFO ] Computed 18 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 683 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :6
FORMULA HealthRecord-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :1
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :1
FORMULA HealthRecord-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
[2023-03-11 23:51:59] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-11 23:51:59] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-11 23:52:00] [INFO ] [Real]Absence check using 10 positive place invariants in 27 ms returned sat
[2023-03-11 23:52:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 23:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:00] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-11 23:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 23:52:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:00] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-11 23:52:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:52:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:00] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 7 ms to minimize.
[2023-03-11 23:52:00] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2023-03-11 23:52:00] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-11 23:52:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2023-03-11 23:52:00] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 91 ms.
[2023-03-11 23:52:01] [INFO ] Added : 19 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 53 ms.
[2023-03-11 23:52:01] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 23:52:01] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:01] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-11 23:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 23:52:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:01] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-11 23:52:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:52:01] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 37 ms.
[2023-03-11 23:52:01] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2023-03-11 23:52:02] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2023-03-11 23:52:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-11 23:52:02] [INFO ] Added : 14 causal constraints over 5 iterations in 421 ms. Result :sat
Minimization took 34 ms.
[2023-03-11 23:52:02] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:02] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-11 23:52:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:02] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:02] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-11 23:52:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:52:02] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2023-03-11 23:52:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-11 23:52:02] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 35 ms.
[2023-03-11 23:52:02] [INFO ] Added : 10 causal constraints over 3 iterations in 133 ms. Result :sat
Minimization took 34 ms.
[2023-03-11 23:52:03] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:03] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-11 23:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:03] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:52:03] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 37 ms.
[2023-03-11 23:52:03] [INFO ] Added : 9 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 35 ms.
[2023-03-11 23:52:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:03] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:03] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-11 23:52:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:52:03] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 32 ms.
[2023-03-11 23:52:04] [INFO ] Added : 20 causal constraints over 5 iterations in 163 ms. Result :sat
Minimization took 37 ms.
[2023-03-11 23:52:04] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:04] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-11 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:04] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:52:04] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 32 ms.
[2023-03-11 23:52:04] [INFO ] Added : 11 causal constraints over 3 iterations in 122 ms. Result :sat
Minimization took 34 ms.
[2023-03-11 23:52:04] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:04] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-11 23:52:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:05] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:05] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-11 23:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-11 23:52:05] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 33 ms.
[2023-03-11 23:52:05] [INFO ] Added : 14 causal constraints over 4 iterations in 150 ms. Result :sat
Minimization took 35 ms.
[2023-03-11 23:52:05] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:05] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-11 23:52:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:05] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-11 23:52:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:52:05] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-11 23:52:05] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2023-03-11 23:52:06] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-11 23:52:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2023-03-11 23:52:06] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 30 ms.
[2023-03-11 23:52:06] [INFO ] Added : 15 causal constraints over 3 iterations in 129 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 237 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 667 edges and 154 vertex of which 124 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 124 transition count 157
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 192 place count 46 transition count 79
Iterating global reduction 1 with 78 rules applied. Total rules applied 270 place count 46 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 270 place count 46 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 280 place count 41 transition count 74
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 291 place count 30 transition count 59
Iterating global reduction 1 with 11 rules applied. Total rules applied 302 place count 30 transition count 59
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 311 place count 30 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 314 place count 27 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 317 place count 27 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 318 place count 27 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 320 place count 25 transition count 42
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 25 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 328 place count 25 transition count 36
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 4 with 6 rules applied. Total rules applied 334 place count 22 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 335 place count 21 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 20 transition count 32
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 340 place count 20 transition count 28
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 5 with 2 rules applied. Total rules applied 342 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 343 place count 18 transition count 26
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 18 transition count 26
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 347 place count 18 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 349 place count 17 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 350 place count 17 transition count 22
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 351 place count 17 transition count 21
Applied a total of 351 rules in 60 ms. Remains 17 /159 variables (removed 142) and now considering 21/307 (removed 286) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/159 places, 21/307 transitions.
Normalized transition count is 19 out of 21 initially.
// Phase 1: matrix 19 rows 17 cols
[2023-03-11 23:52:06] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 113221 resets, run finished after 889 ms. (steps per millisecond=1124 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8282 ms.

BK_STOP 1678578727339

--------------------
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-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is HealthRecord-PT-11, 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 r223-smll-167840362300040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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