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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K 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.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 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 119K 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 1621343803975

[2021-05-18 13:16:45] [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 13:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 13:16:45] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-18 13:16:45] [INFO ] Transformed 624 places.
[2021-05-18 13:16:45] [INFO ] Transformed 828 transitions.
[2021-05-18 13:16:45] [INFO ] Found NUPN structural information;
[2021-05-18 13:16:45] [INFO ] Parsed PT model containing 624 places and 828 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0]
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 828 rows 624 cols
[2021-05-18 13:16:46] [INFO ] Computed 18 place invariants in 20 ms
[2021-05-18 13:16:46] [INFO ] [Real]Absence check using 10 positive place invariants in 39 ms returned sat
[2021-05-18 13:16:46] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 13:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:16:47] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2021-05-18 13:16:47] [INFO ] Deduced a trap composed of 138 places in 200 ms
[2021-05-18 13:16:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2021-05-18 13:16:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:16:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 182 ms returned sat
[2021-05-18 13:16:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 13:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:16:49] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2021-05-18 13:16:49] [INFO ] Deduced a trap composed of 138 places in 161 ms
[2021-05-18 13:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2021-05-18 13:16:49] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 47 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-18 13:16:52] [INFO ] Added : 475 causal constraints over 95 iterations in 3487 ms. Result :(error "Failed to check-sat")
[2021-05-18 13:16:52] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 13:16:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-18 13:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:16:53] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2021-05-18 13:16:54] [INFO ] Deduced a trap composed of 130 places in 267 ms
[2021-05-18 13:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 285 ms
[2021-05-18 13:16:54] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 13:16:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 13:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:16:55] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2021-05-18 13:16:55] [INFO ] Deduced a trap composed of 199 places in 234 ms
[2021-05-18 13:16:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2021-05-18 13:16:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:16:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 175 ms returned sat
[2021-05-18 13:16:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 13:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:16:56] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2021-05-18 13:16:57] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 51 ms.
[2021-05-18 13:17:00] [INFO ] Added : 515 causal constraints over 103 iterations in 3721 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 13:17:00] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2021-05-18 13:17:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 13:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:01] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2021-05-18 13:17:02] [INFO ] Deduced a trap composed of 138 places in 199 ms
[2021-05-18 13:17:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2021-05-18 13:17:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:17:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 582 ms returned sat
[2021-05-18 13:17:02] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 13:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:03] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2021-05-18 13:17:03] [INFO ] Deduced a trap composed of 138 places in 176 ms
[2021-05-18 13:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2021-05-18 13:17:04] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 78 ms.
[2021-05-18 13:17:07] [INFO ] Added : 415 causal constraints over 83 iterations in 3118 ms. Result :(error "Failed to check-sat")
[2021-05-18 13:17:07] [INFO ] [Real]Absence check using 10 positive place invariants in 41 ms returned sat
[2021-05-18 13:17:07] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 13:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:08] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2021-05-18 13:17:08] [INFO ] Deduced a trap composed of 136 places in 106 ms
[2021-05-18 13:17:08] [INFO ] Deduced a trap composed of 133 places in 101 ms
[2021-05-18 13:17:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2021-05-18 13:17:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:17:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 469 ms returned sat
[2021-05-18 13:17:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 13:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:10] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2021-05-18 13:17:10] [INFO ] Deduced a trap composed of 132 places in 144 ms
[2021-05-18 13:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2021-05-18 13:17:10] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 48 ms.
[2021-05-18 13:17:13] [INFO ] Added : 440 causal constraints over 88 iterations in 3278 ms. Result :unknown
[2021-05-18 13:17:13] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned sat
[2021-05-18 13:17:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 13:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:14] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2021-05-18 13:17:14] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 45 ms.
[2021-05-18 13:17:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:17:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 174 ms returned sat
[2021-05-18 13:17:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 13:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:16] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2021-05-18 13:17:16] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 48 ms.
[2021-05-18 13:17:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t630 0) (and (> t526 0) (< o526 o630)))") while checking expression at index 5
[2021-05-18 13:17:20] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 13:17:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 13:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:21] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2021-05-18 13:17:21] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 43 ms.
[2021-05-18 13:17:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:17:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 602 ms returned sat
[2021-05-18 13:17:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-18 13:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:23] [INFO ] [Nat]Absence check using state equation in 1009 ms returned sat
[2021-05-18 13:17:23] [INFO ] Deduced a trap composed of 108 places in 123 ms
[2021-05-18 13:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2021-05-18 13:17:23] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 39 ms.
[2021-05-18 13:17:26] [INFO ] Added : 435 causal constraints over 87 iterations in 3120 ms. Result :unknown
[2021-05-18 13:17:26] [INFO ] [Real]Absence check using 10 positive place invariants in 27 ms returned sat
[2021-05-18 13:17:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 13:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:27] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2021-05-18 13:17:27] [INFO ] Deduced a trap composed of 118 places in 236 ms
[2021-05-18 13:17:27] [INFO ] Deduced a trap composed of 121 places in 213 ms
[2021-05-18 13:17:28] [INFO ] Deduced a trap composed of 185 places in 211 ms
[2021-05-18 13:17:28] [INFO ] Deduced a trap composed of 135 places in 175 ms
[2021-05-18 13:17:28] [INFO ] Deduced a trap composed of 163 places in 190 ms
[2021-05-18 13:17:28] [INFO ] Deduced a trap composed of 152 places in 160 ms
[2021-05-18 13:17:28] [INFO ] Deduced a trap composed of 114 places in 159 ms
[2021-05-18 13:17:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1578 ms
[2021-05-18 13:17:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:17:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 586 ms returned sat
[2021-05-18 13:17:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 13:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:30] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2021-05-18 13:17:30] [INFO ] Deduced a trap composed of 114 places in 206 ms
[2021-05-18 13:17:31] [INFO ] Deduced a trap composed of 116 places in 227 ms
[2021-05-18 13:17:31] [INFO ] Deduced a trap composed of 117 places in 196 ms
[2021-05-18 13:17:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 717 ms
[2021-05-18 13:17:31] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 42 ms.
[2021-05-18 13:17:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t616 0) (and (> t615 0) (< o615 o616)))") while checking expression at index 7
[2021-05-18 13:17:34] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 13:17:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-18 13:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:35] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2021-05-18 13:17:35] [INFO ] Deduced a trap composed of 138 places in 171 ms
[2021-05-18 13:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2021-05-18 13:17:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 13:17:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 529 ms returned sat
[2021-05-18 13:17:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 13:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 13:17:37] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2021-05-18 13:17:37] [INFO ] Deduced a trap composed of 138 places in 181 ms
[2021-05-18 13:17:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2021-05-18 13:17:37] [INFO ] Computed and/alt/rep : 827/2955/827 causal constraints in 42 ms.
[2021-05-18 13:17:40] [INFO ] Added : 420 causal constraints over 84 iterations in 3188 ms. Result :(error "Failed to check-sat")
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 125800 steps, including 1000 resets, run finished after 370 ms. (steps per millisecond=340 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 124800 steps, including 1000 resets, run finished after 344 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 20 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 689 edges and 624 vertex of which 83 / 624 are part of one of the 19 SCC in 25 ms
Free SCC test removed 64 places
Discarding 18 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Graph (complete) has 1204 edges and 560 vertex of which 542 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.14 ms
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Iterating post reduction 0 with 343 rules applied. Total rules applied 345 place count 542 transition count 457
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 313 rules applied. Total rules applied 658 place count 271 transition count 415
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 673 place count 256 transition count 415
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 673 place count 256 transition count 406
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 691 place count 247 transition count 406
Symmetric choice reduction at 3 with 82 rule applications. Total rules 773 place count 247 transition count 406
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 146 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 937 place count 165 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 938 place count 165 transition count 259
Symmetric choice reduction at 4 with 11 rule applications. Total rules 949 place count 165 transition count 259
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 22 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 971 place count 154 transition count 237
Symmetric choice reduction at 4 with 8 rule applications. Total rules 979 place count 154 transition count 237
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 995 place count 146 transition count 221
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1004 place count 146 transition count 221
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1022 place count 137 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1028 place count 137 transition count 206
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1029 place count 137 transition count 206
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1031 place count 136 transition count 204
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1089 place count 107 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1091 place count 107 transition count 173
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1092 place count 107 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1094 place count 106 transition count 172
Performed 12 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1118 place count 94 transition count 253
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1129 place count 94 transition count 242
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1149 place count 94 transition count 222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1169 place count 74 transition count 222
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1170 place count 74 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1171 place count 73 transition count 222
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1172 place count 73 transition count 222
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1179 place count 73 transition count 215
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1180 place count 73 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1181 place count 72 transition count 214
Applied a total of 1181 rules in 281 ms. Remains 72 /624 variables (removed 552) and now considering 214/828 (removed 614) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/624 places, 214/828 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1766 ms. (steps per millisecond=566 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1704 ms. (steps per millisecond=586 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1711 ms. (steps per millisecond=584 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1716 ms. (steps per millisecond=582 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1713 ms. (steps per millisecond=583 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1733 ms. (steps per millisecond=577 ) properties seen :[0, 0, 0, 0, 0, 0]
Finished probabilistic random walk after 264784 steps, run visited all 6 properties in 384 ms. (steps per millisecond=689 )
Probabilistic random walk after 264784 steps, saw 47245 distinct states, run finished after 384 ms. (steps per millisecond=689 ) properties seen :[1, 1, 1, 1, 1, 1]
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA net-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621343873913

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

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