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-162124171200152.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-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200152
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 8.7K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K 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.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:47 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 48K 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 1621341312144

[2021-05-18 12:35:26] [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:35:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:35:26] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-18 12:35:26] [INFO ] Transformed 154 places.
[2021-05-18 12:35:26] [INFO ] Transformed 319 transitions.
[2021-05-18 12:35:26] [INFO ] Found NUPN structural information;
[2021-05-18 12:35:26] [INFO ] Parsed PT model containing 154 places and 319 transitions in 106 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 498 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1]
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:35:27] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2021-05-18 12:35:27] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:35:27] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2021-05-18 12:35:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:27] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-18 12:35:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:35:27] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:35:27] [INFO ] Deduced a trap composed of 49 places in 196 ms
[2021-05-18 12:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2021-05-18 12:35:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:35:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 12:35:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:27] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:35:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:35:27] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2021-05-18 12:35:28] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2021-05-18 12:35:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2021-05-18 12:35:28] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 27 ms.
[2021-05-18 12:35:29] [INFO ] Added : 148 causal constraints over 31 iterations in 1179 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned unsat
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using state equation in 85 ms returned unsat
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:29] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:35:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:35:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:29] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:35:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:35:29] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 22 ms.
[2021-05-18 12:35:30] [INFO ] Added : 134 causal constraints over 27 iterations in 571 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-18 12:35:30] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:35:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:30] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:35:30] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:35:30] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:35:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:35:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:35:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:30] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:35:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:35:30] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 20 ms.
[2021-05-18 12:35:31] [INFO ] Added : 145 causal constraints over 30 iterations in 952 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-18 12:35:31] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:35:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:31] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:35:31] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:35:32] [INFO ] Deduced a trap composed of 29 places in 36 ms
[2021-05-18 12:35:32] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2021-05-18 12:35:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2021-05-18 12:35:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:35:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2021-05-18 12:35:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:32] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-18 12:35:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:35:32] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 21 ms.
[2021-05-18 12:35:33] [INFO ] Added : 141 causal constraints over 29 iterations in 959 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:35:33] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:35:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:33] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:35:33] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 46 places in 62 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 44 places in 47 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 42 places in 47 ms
[2021-05-18 12:35:33] [INFO ] Deduced a trap composed of 44 places in 50 ms
[2021-05-18 12:35:34] [INFO ] Deduced a trap composed of 44 places in 47 ms
[2021-05-18 12:35:34] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2021-05-18 12:35:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 594 ms
[2021-05-18 12:35:34] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:35:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:34] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:35:34] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:35:34] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 21 ms.
[2021-05-18 12:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:35:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 53 ms returned sat
[2021-05-18 12:35:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:34] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:35:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:35:34] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 17 ms.
[2021-05-18 12:35:35] [INFO ] Added : 136 causal constraints over 28 iterations in 717 ms. Result :sat
[2021-05-18 12:35:35] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-18 12:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-18 12:35:35] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
[2021-05-18 12:35:35] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:35:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:35] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-18 12:35:35] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:35:35] [INFO ] Deduced a trap composed of 40 places in 42 ms
[2021-05-18 12:35:35] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2021-05-18 12:35:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2021-05-18 12:35:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:35:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 59 ms returned sat
[2021-05-18 12:35:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:35:35] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-18 12:35:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:35:36] [INFO ] Deduced a trap composed of 38 places in 68 ms
[2021-05-18 12:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2021-05-18 12:35:36] [INFO ] Computed and/alt/rep : 293/2209/281 causal constraints in 31 ms.
[2021-05-18 12:35:36] [INFO ] Added : 125 causal constraints over 26 iterations in 521 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
FORMULA net-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8500 steps, including 392 resets, run finished after 48 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 10700 steps, including 337 resets, run finished after 40 ms. (steps per millisecond=267 ) properties seen :[0, 1, 1, 1, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14800 steps, including 511 resets, run finished after 69 ms. (steps per millisecond=214 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 13800 steps, including 501 resets, run finished after 37 ms. (steps per millisecond=372 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 12500 steps, including 531 resets, run finished after 33 ms. (steps per millisecond=378 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 16900 steps, including 697 resets, run finished after 81 ms. (steps per millisecond=208 ) properties seen :[1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 212 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 6148 ms
Free SCC test removed 7 places
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (complete) has 636 edges and 147 vertex of which 137 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.170 ms
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 137 transition count 260
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 43 place count 130 transition count 250
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 127 transition count 249
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 127 transition count 245
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 58 place count 120 transition count 245
Symmetric choice reduction at 3 with 70 rule applications. Total rules 128 place count 120 transition count 245
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 140 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 268 place count 50 transition count 105
Symmetric choice reduction at 3 with 9 rule applications. Total rules 277 place count 50 transition count 105
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 295 place count 41 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 304 place count 41 transition count 78
Symmetric choice reduction at 4 with 2 rule applications. Total rules 306 place count 41 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 6 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 310 place count 39 transition count 72
Symmetric choice reduction at 4 with 1 rule applications. Total rules 311 place count 39 transition count 72
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 313 place count 38 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 315 place count 38 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 323 place count 34 transition count 98
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 325 place count 34 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 327 place count 32 transition count 96
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 340 place count 32 transition count 96
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 341 place count 32 transition count 96
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 342 place count 32 transition count 96
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 347 place count 32 transition count 91
Applied a total of 347 rules in 6361 ms. Remains 32 /154 variables (removed 122) and now considering 91/294 (removed 203) transitions.
[2021-05-18 12:35:43] [INFO ] Flow matrix only has 83 transitions (discarded 8 similar events)
// Phase 1: matrix 83 rows 32 cols
[2021-05-18 12:35:43] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-18 12:35:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned [88, 89]
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions :[89, 88]
Starting structural reductions, iteration 1 : 32/154 places, 89/294 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 133 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Applied a total of 1 rules in 4 ms. Remains 31 /32 variables (removed 1) and now considering 89/89 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/154 places, 89/294 transitions.
Incomplete random walk after 1000000 steps, including 167079 resets, run finished after 2055 ms. (steps per millisecond=486 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 35278 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties seen :[0]
Finished probabilistic random walk after 1478 steps, run visited all 1 properties in 9 ms. (steps per millisecond=164 )
Probabilistic random walk after 1478 steps, saw 382 distinct states, run finished after 9 ms. (steps per millisecond=164 ) properties seen :[1]
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341347022

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

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