fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171200132
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for HealthRecord-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
240.760 9064.00 16247.00 259.20 FTTFTFTTFFTFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171200132.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is HealthRecord-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.8K May 11 18:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 33K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621340954026

[2021-05-18 12:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:29:15] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-18 12:29:15] [INFO ] Transformed 117 places.
[2021-05-18 12:29:15] [INFO ] Transformed 218 transitions.
[2021-05-18 12:29:15] [INFO ] Found NUPN structural information;
[2021-05-18 12:29:15] [INFO ] Parsed PT model containing 117 places and 218 transitions in 87 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 516 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1]
FORMULA net-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA net-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0]
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:29:16] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2021-05-18 12:29:16] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 12:29:16] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-18 12:29:16] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:16] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-18 12:29:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:29:16] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:29:16] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 17 ms.
[2021-05-18 12:29:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2021-05-18 12:29:16] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:16] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-18 12:29:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:16] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 14 ms.
[2021-05-18 12:29:17] [INFO ] Added : 100 causal constraints over 21 iterations in 542 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:17] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 20 ms.
[2021-05-18 12:29:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:17] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:29:17] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 26 ms.
[2021-05-18 12:29:17] [INFO ] Added : 103 causal constraints over 21 iterations in 389 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using state equation in 77 ms returned unsat
[2021-05-18 12:29:17] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:18] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:18] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-18 12:29:18] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:18] [INFO ] Deduced a trap composed of 29 places in 61 ms
[2021-05-18 12:29:18] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2021-05-18 12:29:18] [INFO ] Deduced a trap composed of 31 places in 52 ms
[2021-05-18 12:29:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2021-05-18 12:29:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-18 12:29:18] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:18] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-18 12:29:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:18] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2021-05-18 12:29:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-18 12:29:18] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 14 ms.
[2021-05-18 12:29:18] [INFO ] Added : 102 causal constraints over 21 iterations in 506 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-18 12:29:19] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:29:19] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-18 12:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:19] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-18 12:29:19] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:19] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 15 ms.
[2021-05-18 12:29:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 286 ms returned sat
[2021-05-18 12:29:19] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:19] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-18 12:29:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:19] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 19 ms.
[2021-05-18 12:29:19] [INFO ] Added : 98 causal constraints over 21 iterations in 350 ms. Result :sat
[2021-05-18 12:29:19] [INFO ] Deduced a trap composed of 34 places in 47 ms
[2021-05-18 12:29:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:20] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-18 12:29:20] [INFO ] Deduced a trap composed of 32 places in 33 ms
[2021-05-18 12:29:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2021-05-18 12:29:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:20] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:29:20] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 10 ms.
[2021-05-18 12:29:20] [INFO ] Added : 97 causal constraints over 20 iterations in 434 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned unsat
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:20] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-18 12:29:21] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:21] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2021-05-18 12:29:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-18 12:29:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:29:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-18 12:29:21] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-18 12:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:29:21] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-18 12:29:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:29:21] [INFO ] Computed and/alt/rep : 212/1228/204 causal constraints in 11 ms.
[2021-05-18 12:29:21] [INFO ] Added : 97 causal constraints over 21 iterations in 349 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 10400 steps, including 392 resets, run finished after 44 ms. (steps per millisecond=236 ) properties seen :[1, 0, 1, 1, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6900 steps, including 193 resets, run finished after 24 ms. (steps per millisecond=287 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 316 resets, run finished after 35 ms. (steps per millisecond=291 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 7500 steps, including 223 resets, run finished after 24 ms. (steps per millisecond=312 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 8100 steps, including 309 resets, run finished after 18 ms. (steps per millisecond=450 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 10900 steps, including 316 resets, run finished after 26 ms. (steps per millisecond=419 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 117/117 places, 213/213 transitions.
Graph (trivial) has 122 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Graph (complete) has 401 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 102 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 101 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 100 transition count 187
Symmetric choice reduction at 3 with 47 rule applications. Total rules 69 place count 100 transition count 187
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 93 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 163 place count 53 transition count 94
Symmetric choice reduction at 3 with 11 rule applications. Total rules 174 place count 53 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 22 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 196 place count 42 transition count 72
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 201 place count 42 transition count 67
Symmetric choice reduction at 4 with 3 rule applications. Total rules 204 place count 42 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 210 place count 39 transition count 58
Symmetric choice reduction at 4 with 3 rule applications. Total rules 213 place count 39 transition count 58
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 36 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 222 place count 36 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 35 transition count 50
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 232 place count 35 transition count 42
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 245 place count 27 transition count 37
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 252 place count 27 transition count 37
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 27 transition count 37
Applied a total of 253 rules in 39 ms. Remains 27 /117 variables (removed 90) and now considering 37/213 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/117 places, 37/213 transitions.
Finished random walk after 237322 steps, including 26262 resets, run visited all 1 properties in 402 ms. (steps per millisecond=590 )
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621340963090

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is HealthRecord-PT-01, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171200132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;