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-167840362300042.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-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362300042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 71K 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-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678578737859

Running Version 202205111006
[2023-03-11 23:52:19] [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:52:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:52:20] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-11 23:52:20] [INFO ] Transformed 161 places.
[2023-03-11 23:52:20] [INFO ] Transformed 341 transitions.
[2023-03-11 23:52:20] [INFO ] Found NUPN structural information;
[2023-03-11 23:52:20] [INFO ] Parsed PT model containing 161 places and 341 transitions in 324 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Normalized transition count is 301 out of 313 initially.
// Phase 1: matrix 301 rows 161 cols
[2023-03-11 23:52:20] [INFO ] Computed 18 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 795 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :6
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 109 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 111 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :2
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2023-03-11 23:52:20] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2023-03-11 23:52:20] [INFO ] Computed 18 place invariants in 9 ms
[2023-03-11 23:52:20] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 23:52:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-11 23:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:20] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-11 23:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 23:52:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:21] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-11 23:52:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:52:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:21] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 8 ms to minimize.
[2023-03-11 23:52:21] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2023-03-11 23:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-11 23:52:21] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 47 ms.
[2023-03-11 23:52:21] [INFO ] Added : 24 causal constraints over 5 iterations in 215 ms. Result :sat
Minimization took 39 ms.
[2023-03-11 23:52:21] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 23:52:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:22] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-11 23:52:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:22] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:22] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2023-03-11 23:52:22] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2023-03-11 23:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-11 23:52:22] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 39 ms.
[2023-03-11 23:52:22] [INFO ] Added : 13 causal constraints over 3 iterations in 129 ms. Result :sat
Minimization took 33 ms.
[2023-03-11 23:52:22] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:22] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-11 23:52:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:23] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-11 23:52:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 23:52:23] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 34 ms.
[2023-03-11 23:52:23] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-11 23:52:23] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2023-03-11 23:52:23] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-11 23:52:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2023-03-11 23:52:23] [INFO ] Added : 13 causal constraints over 4 iterations in 425 ms. Result :sat
Minimization took 36 ms.
[2023-03-11 23:52:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:23] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-11 23:52:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 23:52:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:23] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-11 23:52:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:24] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2023-03-11 23:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-11 23:52:24] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 36 ms.
[2023-03-11 23:52:24] [INFO ] Added : 12 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 34 ms.
[2023-03-11 23:52:24] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:24] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-11 23:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 23:52:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:24] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-11 23:52:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 23:52:24] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2023-03-11 23:52:24] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2023-03-11 23:52:24] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2023-03-11 23:52:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2023-03-11 23:52:24] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 28 ms.
[2023-03-11 23:52:25] [INFO ] Added : 11 causal constraints over 3 iterations in 114 ms. Result :sat
Minimization took 35 ms.
[2023-03-11 23:52:25] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:25] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-11 23:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:25] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:25] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 33 ms.
[2023-03-11 23:52:25] [INFO ] Added : 30 causal constraints over 7 iterations in 202 ms. Result :sat
Minimization took 38 ms.
[2023-03-11 23:52:25] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:25] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-11 23:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:26] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-11 23:52:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:52:26] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 30 ms.
[2023-03-11 23:52:26] [INFO ] Added : 10 causal constraints over 2 iterations in 101 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 237 edges and 161 vertex of which 6 / 161 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 683 edges and 158 vertex of which 148 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 148 transition count 291
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 145 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 143 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 143 transition count 285
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 142 transition count 285
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 98 place count 61 transition count 123
Iterating global reduction 3 with 81 rules applied. Total rules applied 179 place count 61 transition count 123
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 188 place count 52 transition count 105
Iterating global reduction 3 with 9 rules applied. Total rules applied 197 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 206 place count 52 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 207 place count 51 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 50 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 50 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 213 place count 50 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 225 place count 44 transition count 125
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 44 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 44 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 231 place count 42 transition count 121
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 233 place count 42 transition count 119
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 42 transition count 313
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 238 place count 40 transition count 312
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 242 place count 40 transition count 308
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 243 place count 39 transition count 257
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 39 transition count 257
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 38 transition count 255
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 38 transition count 255
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 266 place count 38 transition count 235
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 268 place count 38 transition count 235
Applied a total of 268 rules in 156 ms. Remains 38 /161 variables (removed 123) and now considering 235/313 (removed 78) transitions.
[2023-03-11 23:52:26] [INFO ] Flow matrix only has 171 transitions (discarded 64 similar events)
// Phase 1: matrix 171 rows 38 cols
[2023-03-11 23:52:26] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-11 23:52:26] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/161 places, 235/313 transitions.
Successfully produced net in file /tmp/petri1000_12325499497010434830.dot
Successfully produced net in file /tmp/petri1001_3253326686935052331.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Normalized transition count is 169 out of 233 initially.
// Phase 1: matrix 169 rows 38 cols
[2023-03-11 23:52:26] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 26 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 4) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4 resets, run finished after 411 ms. (steps per millisecond=2433 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 12 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 10 resets, run finished after 395 ms. (steps per millisecond=2531 ) properties (out of 3) seen :0
[2023-03-11 23:52:28] [INFO ] Flow matrix only has 169 transitions (discarded 64 similar events)
// Phase 1: matrix 169 rows 38 cols
[2023-03-11 23:52:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 23:52:28] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-11 23:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:28] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-11 23:52:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:28] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:28] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-11 23:52:28] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-11 23:52:28] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2023-03-11 23:52:28] [INFO ] Computed and/alt/rep : 50/351/50 causal constraints (skipped 103 transitions) in 29 ms.
[2023-03-11 23:52:28] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Minimization took 25 ms.
[2023-03-11 23:52:28] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:28] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-11 23:52:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:28] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:28] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-11 23:52:28] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2023-03-11 23:52:28] [INFO ] Computed and/alt/rep : 50/351/50 causal constraints (skipped 103 transitions) in 23 ms.
[2023-03-11 23:52:28] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Minimization took 24 ms.
[2023-03-11 23:52:29] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-11 23:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:29] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-11 23:52:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:52:29] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-11 23:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:52:29] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-11 23:52:29] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2023-03-11 23:52:29] [INFO ] Computed and/alt/rep : 50/351/50 causal constraints (skipped 103 transitions) in 22 ms.
[2023-03-11 23:52:29] [INFO ] Added : 1 causal constraints over 1 iterations in 52 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 38/38 places, 233/233 transitions.
Graph (trivial) has 7 edges and 38 vertex of which 2 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 179 edges and 37 vertex of which 28 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 28 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 23 transition count 116
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 23 transition count 116
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 38 place count 23 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 23 transition count 104
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 22 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 20 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 20 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 20 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 19 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 19 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 53 place count 19 transition count 93
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 55 place count 18 transition count 92
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 18 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 17 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 17 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 16 transition count 63
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 16 transition count 63
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 72 place count 16 transition count 53
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 88 place count 16 transition count 53
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 16 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 93 place count 15 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 14 transition count 48
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 6 with 6 rules applied. Total rules applied 100 place count 11 transition count 45
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 107 place count 11 transition count 38
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 120 place count 11 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 11 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 122 place count 11 transition count 24
Applied a total of 122 rules in 57 ms. Remains 11 /38 variables (removed 27) and now considering 24/233 (removed 209) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/38 places, 24/233 transitions.
Successfully produced net in file /tmp/petri1002_16480824569460696594.dot
Successfully produced net in file /tmp/petri1003_13750061241888111780.dot
Successfully produced net in file /tmp/petri1004_4181031973392986628.dot
Successfully produced net in file /tmp/petri1005_12582871506209552008.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
Normalized transition count is 18 out of 21 initially.
// Phase 1: matrix 18 rows 11 cols
[2023-03-11 23:52:29] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 14 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 10626 ms.

BK_STOP 1678578750523

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

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