fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r125-smll-165264481900073
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for HealthRecord-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
327.468 45887.00 68434.00 476.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 5.3K Apr 30 11:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 30 11:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 125K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-16-UpperBounds-00
FORMULA_NAME HealthRecord-PT-16-UpperBounds-01
FORMULA_NAME HealthRecord-PT-16-UpperBounds-02
FORMULA_NAME HealthRecord-PT-16-UpperBounds-03
FORMULA_NAME HealthRecord-PT-16-UpperBounds-04
FORMULA_NAME HealthRecord-PT-16-UpperBounds-05
FORMULA_NAME HealthRecord-PT-16-UpperBounds-06
FORMULA_NAME HealthRecord-PT-16-UpperBounds-07
FORMULA_NAME HealthRecord-PT-16-UpperBounds-08
FORMULA_NAME HealthRecord-PT-16-UpperBounds-09
FORMULA_NAME HealthRecord-PT-16-UpperBounds-10
FORMULA_NAME HealthRecord-PT-16-UpperBounds-11
FORMULA_NAME HealthRecord-PT-16-UpperBounds-12
FORMULA_NAME HealthRecord-PT-16-UpperBounds-13
FORMULA_NAME HealthRecord-PT-16-UpperBounds-14
FORMULA_NAME HealthRecord-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727523220

Running Version 0
[2022-05-16 18:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:58:46] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-05-16 18:58:46] [INFO ] Transformed 453 places.
[2022-05-16 18:58:46] [INFO ] Transformed 594 transitions.
[2022-05-16 18:58:46] [INFO ] Found NUPN structural information;
[2022-05-16 18:58:46] [INFO ] Parsed PT model containing 453 places and 594 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 594 rows 453 cols
[2022-05-16 18:58:46] [INFO ] Computed 14 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 95 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :7
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 18 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 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
// Phase 1: matrix 594 rows 453 cols
[2022-05-16 18:58:46] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-16 18:58:47] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned sat
[2022-05-16 18:58:47] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2022-05-16 18:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:47] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2022-05-16 18:58:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2022-05-16 18:58:48] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:48] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2022-05-16 18:58:49] [INFO ] Deduced a trap composed of 98 places in 316 ms of which 6 ms to minimize.
[2022-05-16 18:58:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2022-05-16 18:58:49] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 62 ms.
[2022-05-16 18:58:50] [INFO ] Added : 86 causal constraints over 18 iterations in 1184 ms. Result :sat
Minimization took 133 ms.
[2022-05-16 18:58:50] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:51] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2022-05-16 18:58:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
[2022-05-16 18:58:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:51] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2022-05-16 18:58:51] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 75 ms.
[2022-05-16 18:58:55] [INFO ] Added : 227 causal constraints over 46 iterations in 3274 ms. Result :sat
Minimization took 205 ms.
[2022-05-16 18:58:55] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2022-05-16 18:58:55] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:55] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-05-16 18:58:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2022-05-16 18:58:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2022-05-16 18:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:56] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-05-16 18:58:56] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 67 ms.
[2022-05-16 18:59:00] [INFO ] Added : 271 causal constraints over 55 iterations in 3691 ms. Result :sat
Minimization took 200 ms.
[2022-05-16 18:59:00] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:00] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-05-16 18:59:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:01] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2022-05-16 18:59:01] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 55 ms.
[2022-05-16 18:59:04] [INFO ] Added : 225 causal constraints over 46 iterations in 2770 ms. Result :sat
Minimization took 117 ms.
[2022-05-16 18:59:04] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2022-05-16 18:59:04] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:04] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2022-05-16 18:59:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-05-16 18:59:04] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-16 18:59:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:05] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2022-05-16 18:59:05] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2022-05-16 18:59:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2022-05-16 18:59:05] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 62 ms.
[2022-05-16 18:59:08] [INFO ] Deduced a trap composed of 124 places in 173 ms of which 3 ms to minimize.
[2022-05-16 18:59:08] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 3 ms to minimize.
[2022-05-16 18:59:09] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 1 ms to minimize.
[2022-05-16 18:59:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 710 ms
[2022-05-16 18:59:09] [INFO ] Added : 217 causal constraints over 44 iterations in 3575 ms. Result :sat
Minimization took 188 ms.
[2022-05-16 18:59:09] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-05-16 18:59:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-16 18:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:09] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-16 18:59:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2022-05-16 18:59:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:10] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-05-16 18:59:10] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 59 ms.
[2022-05-16 18:59:14] [INFO ] Added : 269 causal constraints over 54 iterations in 3608 ms. Result :sat
Minimization took 234 ms.
[2022-05-16 18:59:14] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2022-05-16 18:59:14] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-16 18:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:14] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-05-16 18:59:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2022-05-16 18:59:15] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2022-05-16 18:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:15] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2022-05-16 18:59:15] [INFO ] Deduced a trap composed of 169 places in 242 ms of which 1 ms to minimize.
[2022-05-16 18:59:16] [INFO ] Deduced a trap composed of 99 places in 274 ms of which 1 ms to minimize.
[2022-05-16 18:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 649 ms
[2022-05-16 18:59:16] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 62 ms.
[2022-05-16 18:59:17] [INFO ] Added : 89 causal constraints over 18 iterations in 1136 ms. Result :sat
Minimization took 133 ms.
[2022-05-16 18:59:17] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-05-16 18:59:17] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:18] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-05-16 18:59:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 26 ms returned sat
[2022-05-16 18:59:18] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-16 18:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:18] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-05-16 18:59:18] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 54 ms.
[2022-05-16 18:59:22] [INFO ] Added : 278 causal constraints over 57 iterations in 3490 ms. Result :sat
Minimization took 207 ms.
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-05-16 18:59:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2022-05-16 18:59:23] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-16 18:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:23] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-16 18:59:23] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 46 ms.
[2022-05-16 18:59:24] [INFO ] Added : 73 causal constraints over 15 iterations in 804 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 8000 steps, including 133 resets, run finished after 31 ms. (steps per millisecond=258 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 62700 steps, including 546 resets, run finished after 238 ms. (steps per millisecond=263 ) properties (out of 9) seen :2 could not realise parikh vector
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10400 steps, including 164 resets, run finished after 21 ms. (steps per millisecond=495 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 54500 steps, including 480 resets, run finished after 127 ms. (steps per millisecond=429 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 31100 steps, including 275 resets, run finished after 78 ms. (steps per millisecond=398 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 48200 steps, including 393 resets, run finished after 111 ms. (steps per millisecond=434 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 62800 steps, including 532 resets, run finished after 141 ms. (steps per millisecond=445 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 23900 steps, including 184 resets, run finished after 53 ms. (steps per millisecond=450 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10100 steps, including 156 resets, run finished after 19 ms. (steps per millisecond=531 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 525 edges and 453 vertex of which 47 / 453 are part of one of the 16 SCC in 10 ms
Free SCC test removed 31 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 822 edges and 422 vertex of which 409 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.5 ms
Discarding 13 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 409 transition count 319
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 250 rules applied. Total rules applied 472 place count 189 transition count 289
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 486 place count 176 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 487 place count 175 transition count 288
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 487 place count 175 transition count 279
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 505 place count 166 transition count 279
Discarding 56 places :
Symmetric choice reduction at 4 with 56 rule applications. Total rules 561 place count 110 transition count 168
Iterating global reduction 4 with 56 rules applied. Total rules applied 617 place count 110 transition count 168
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 625 place count 102 transition count 152
Iterating global reduction 4 with 8 rules applied. Total rules applied 633 place count 102 transition count 152
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 638 place count 97 transition count 147
Iterating global reduction 4 with 5 rules applied. Total rules applied 643 place count 97 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 644 place count 97 transition count 146
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 646 place count 95 transition count 142
Iterating global reduction 5 with 2 rules applied. Total rules applied 648 place count 95 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 650 place count 93 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 652 place count 93 transition count 138
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 654 place count 91 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 656 place count 91 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 658 place count 91 transition count 132
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 712 place count 64 transition count 104
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 717 place count 64 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 725 place count 60 transition count 141
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 726 place count 60 transition count 140
Free-agglomeration rule applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 745 place count 60 transition count 121
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 764 place count 41 transition count 121
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 770 place count 41 transition count 115
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 771 place count 41 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 772 place count 40 transition count 114
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 782 place count 40 transition count 114
Applied a total of 782 rules in 186 ms. Remains 40 /453 variables (removed 413) and now considering 114/594 (removed 480) transitions.
[2022-05-16 18:59:25] [INFO ] Flow matrix only has 100 transitions (discarded 14 similar events)
// Phase 1: matrix 100 rows 40 cols
[2022-05-16 18:59:25] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-16 18:59:25] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/453 places, 114/594 transitions.
Successfully produced net in file /tmp/petri1000_335298511070535990.dot
Successfully produced net in file /tmp/petri1001_11135878576096785560.dot
Successfully produced net in file /tmp/petri1002_3629786363597178224.dot
Successfully produced net in file /tmp/petri1003_5565903683199130723.dot
Successfully produced net in file /tmp/petri1004_17127580920632943748.dot
Successfully produced net in file /tmp/petri1005_2519386970006681217.dot
Successfully produced net in file /tmp/petri1006_16599563142681371670.dot
Successfully produced net in file /tmp/petri1007_8888445369246939870.dot
Successfully produced net in file /tmp/petri1008_9206900982536472975.dot
Successfully produced net in file /tmp/petri1009_13499709203519089361.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
Normalized transition count is 90 out of 104 initially.
// Phase 1: matrix 90 rows 40 cols
[2022-05-16 18:59:25] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 140478 resets, run finished after 2377 ms. (steps per millisecond=420 ) properties (out of 6) seen :6
FORMULA HealthRecord-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727569107

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is HealthRecord-PT-16, 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 r125-smll-165264481900073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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