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.r246-smll-162106594200048.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldRVs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594200048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 122K May 5 16:52 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 ShieldRVs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621288652782

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 21:57:35] [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, -timeout, 3600, -rebuildPNML]
[2021-05-17 21:57:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 21:57:36] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-17 21:57:36] [INFO ] Transformed 403 places.
[2021-05-17 21:57:36] [INFO ] Transformed 453 transitions.
[2021-05-17 21:57:36] [INFO ] Found NUPN structural information;
[2021-05-17 21:57:36] [INFO ] Parsed PT model containing 403 places and 453 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 22 resets, run finished after 105 ms. (steps per millisecond=95 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1]
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 453 rows 403 cols
[2021-05-17 21:57:36] [INFO ] Computed 41 place invariants in 20 ms
[2021-05-17 21:57:37] [INFO ] [Real]Absence check using 41 positive place invariants in 61 ms returned sat
[2021-05-17 21:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:57:37] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2021-05-17 21:57:38] [INFO ] Deduced a trap composed of 35 places in 323 ms
[2021-05-17 21:57:38] [INFO ] Deduced a trap composed of 28 places in 291 ms
[2021-05-17 21:57:38] [INFO ] Deduced a trap composed of 24 places in 251 ms
[2021-05-17 21:57:39] [INFO ] Deduced a trap composed of 25 places in 279 ms
[2021-05-17 21:57:39] [INFO ] Deduced a trap composed of 28 places in 366 ms
[2021-05-17 21:57:39] [INFO ] Deduced a trap composed of 37 places in 238 ms
[2021-05-17 21:57:40] [INFO ] Deduced a trap composed of 19 places in 315 ms
[2021-05-17 21:57:40] [INFO ] Deduced a trap composed of 21 places in 335 ms
[2021-05-17 21:57:40] [INFO ] Deduced a trap composed of 21 places in 270 ms
[2021-05-17 21:57:41] [INFO ] Deduced a trap composed of 29 places in 261 ms
[2021-05-17 21:57:41] [INFO ] Deduced a trap composed of 21 places in 228 ms
[2021-05-17 21:57:41] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2021-05-17 21:57:41] [INFO ] Deduced a trap composed of 22 places in 229 ms
[2021-05-17 21:57:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 21:57:42] [INFO ] Deduced a trap composed of 11 places in 412 ms
[2021-05-17 21:57:42] [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 (> (+ s0 s1 s2 s286 s287 s288 s289 s300 s301 s302 s303) 0)") while checking expression at index 0
[2021-05-17 21:57:42] [INFO ] [Real]Absence check using 41 positive place invariants in 45 ms returned sat
[2021-05-17 21:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:57:43] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2021-05-17 21:57:43] [INFO ] Deduced a trap composed of 26 places in 325 ms
[2021-05-17 21:57:44] [INFO ] Deduced a trap composed of 32 places in 379 ms
[2021-05-17 21:57:44] [INFO ] Deduced a trap composed of 29 places in 347 ms
[2021-05-17 21:57:44] [INFO ] Deduced a trap composed of 22 places in 339 ms
[2021-05-17 21:57:45] [INFO ] Deduced a trap composed of 37 places in 376 ms
[2021-05-17 21:57:45] [INFO ] Deduced a trap composed of 22 places in 536 ms
[2021-05-17 21:57:46] [INFO ] Deduced a trap composed of 21 places in 286 ms
[2021-05-17 21:57:46] [INFO ] Deduced a trap composed of 26 places in 440 ms
[2021-05-17 21:57:46] [INFO ] Deduced a trap composed of 34 places in 316 ms
[2021-05-17 21:57:47] [INFO ] Deduced a trap composed of 28 places in 337 ms
[2021-05-17 21:57:47] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s12 s19 s20 s22 s23 s58 s59 s61 s62 s96 s97 s98 s99 s100 s101 s102 s103) 0)") while checking expression at index 1
[2021-05-17 21:57:47] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned unsat
[2021-05-17 21:57:47] [INFO ] [Real]Absence check using 41 positive place invariants in 59 ms returned sat
[2021-05-17 21:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:57:48] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2021-05-17 21:57:48] [INFO ] Deduced a trap composed of 27 places in 353 ms
[2021-05-17 21:57:49] [INFO ] Deduced a trap composed of 25 places in 418 ms
[2021-05-17 21:57:49] [INFO ] Deduced a trap composed of 23 places in 303 ms
[2021-05-17 21:57:49] [INFO ] Deduced a trap composed of 43 places in 349 ms
[2021-05-17 21:57:50] [INFO ] Deduced a trap composed of 37 places in 314 ms
[2021-05-17 21:57:50] [INFO ] Deduced a trap composed of 35 places in 279 ms
[2021-05-17 21:57:50] [INFO ] Deduced a trap composed of 20 places in 256 ms
[2021-05-17 21:57:51] [INFO ] Deduced a trap composed of 37 places in 242 ms
[2021-05-17 21:57:51] [INFO ] Deduced a trap composed of 31 places in 208 ms
[2021-05-17 21:57:51] [INFO ] Deduced a trap composed of 24 places in 164 ms
[2021-05-17 21:57:51] [INFO ] Deduced a trap composed of 45 places in 198 ms
[2021-05-17 21:57:52] [INFO ] Deduced a trap composed of 25 places in 202 ms
[2021-05-17 21:57:52] [INFO ] Deduced a trap composed of 27 places in 217 ms
[2021-05-17 21:57:52] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2021-05-17 21:57:52] [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 (> (+ s0 s1 s2 s3 s247 s248 s252 s253 s257 s258 s259 s262 s264 s275 s276 s277 s278 s280 s283 s284 s285 s292 s294 s295 s305 s306 s310 s311 s312 s330 s331 s332 s333 s334 s335 s336 s337) 0)") while checking expression at index 3
[2021-05-17 21:57:52] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned unsat
[2021-05-17 21:57:52] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned sat
[2021-05-17 21:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:57:53] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2021-05-17 21:57:53] [INFO ] Deduced a trap composed of 19 places in 213 ms
[2021-05-17 21:57:54] [INFO ] Deduced a trap composed of 26 places in 428 ms
[2021-05-17 21:57:54] [INFO ] Deduced a trap composed of 36 places in 261 ms
[2021-05-17 21:57:54] [INFO ] Deduced a trap composed of 28 places in 257 ms
[2021-05-17 21:57:54] [INFO ] Deduced a trap composed of 24 places in 253 ms
[2021-05-17 21:57:55] [INFO ] Deduced a trap composed of 28 places in 501 ms
[2021-05-17 21:57:55] [INFO ] Deduced a trap composed of 26 places in 267 ms
[2021-05-17 21:57:55] [INFO ] Deduced a trap composed of 26 places in 267 ms
[2021-05-17 21:57:56] [INFO ] Deduced a trap composed of 24 places in 271 ms
[2021-05-17 21:57:56] [INFO ] Deduced a trap composed of 28 places in 259 ms
[2021-05-17 21:57:56] [INFO ] Deduced a trap composed of 31 places in 279 ms
[2021-05-17 21:57:57] [INFO ] Deduced a trap composed of 34 places in 313 ms
[2021-05-17 21:57:58] [INFO ] Deduced a trap composed of 21 places in 711 ms
[2021-05-17 21:57:58] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s130 s131 s132 s133 s134 s135 s136 s140 s141 s142 s143 s145 s146 s147) 0)") while checking expression at index 5
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 28 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 453/453 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 403 transition count 416
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 366 transition count 416
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 74 place count 366 transition count 366
Deduced a syphon composed of 50 places in 15 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 174 place count 316 transition count 366
Symmetric choice reduction at 2 with 65 rule applications. Total rules 239 place count 316 transition count 366
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 65 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 369 place count 251 transition count 301
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 369 place count 251 transition count 277
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 417 place count 227 transition count 277
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 539 place count 166 transition count 216
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 557 place count 166 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 558 place count 165 transition count 215
Applied a total of 558 rules in 276 ms. Remains 165 /403 variables (removed 238) and now considering 215/453 (removed 238) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/403 places, 215/453 transitions.
Incomplete random walk after 1000000 steps, including 5910 resets, run finished after 2674 ms. (steps per millisecond=373 ) properties seen :[0, 1, 1, 0]
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1002 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1019 resets, run finished after 1357 ms. (steps per millisecond=736 ) properties seen :[0, 0]
// Phase 1: matrix 215 rows 165 cols
[2021-05-17 21:58:03] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 21:58:03] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2021-05-17 21:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:58:03] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-17 21:58:03] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2021-05-17 21:58:04] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2021-05-17 21:58:04] [INFO ] Deduced a trap composed of 10 places in 57 ms
[2021-05-17 21:58:04] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2021-05-17 21:58:04] [INFO ] Deduced a trap composed of 14 places in 49 ms
[2021-05-17 21:58:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 334 ms
[2021-05-17 21:58:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:58:04] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2021-05-17 21:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:58:04] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-17 21:58:04] [INFO ] Computed and/alt/rep : 211/1423/211 causal constraints in 32 ms.
[2021-05-17 21:58:06] [INFO ] Added : 175 causal constraints over 35 iterations in 2221 ms. Result :unsat
[2021-05-17 21:58:06] [INFO ] [Real]Absence check using 41 positive place invariants in 37 ms returned sat
[2021-05-17 21:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:58:06] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 10 places in 66 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 10 places in 80 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 11 places in 33 ms
[2021-05-17 21:58:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 465 ms
[2021-05-17 21:58:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:58:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2021-05-17 21:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:58:07] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 7 places in 49 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2021-05-17 21:58:07] [INFO ] Deduced a trap composed of 11 places in 21 ms
[2021-05-17 21:58:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 231 ms
[2021-05-17 21:58:07] [INFO ] Computed and/alt/rep : 211/1423/211 causal constraints in 20 ms.
[2021-05-17 21:58:17] [INFO ] Added : 196 causal constraints over 42 iterations in 9842 ms. Result :unknown
FORMULA ShieldRVs-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 12800 steps, including 421 resets, run finished after 41 ms. (steps per millisecond=312 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 165 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 165/165 places, 215/215 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 165 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 163 transition count 213
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 163 transition count 208
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 158 transition count 208
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 158 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 157 transition count 207
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 35 place count 148 transition count 198
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 148 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 147 transition count 197
Applied a total of 37 rules in 70 ms. Remains 147 /165 variables (removed 18) and now considering 197/215 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/165 places, 197/215 transitions.
Incomplete random walk after 1000000 steps, including 7115 resets, run finished after 2275 ms. (steps per millisecond=439 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1262 resets, run finished after 1280 ms. (steps per millisecond=781 ) properties seen :[0]
Interrupted probabilistic random walk after 10169800 steps, run timeout after 30001 ms. (steps per millisecond=338 ) properties seen :[0]
Probabilistic random walk after 10169800 steps, saw 1701739 distinct states, run finished after 30001 ms. (steps per millisecond=338 ) properties seen :[0]
// Phase 1: matrix 197 rows 147 cols
[2021-05-17 21:58:51] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-17 21:58:51] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2021-05-17 21:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:58:51] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-17 21:58:51] [INFO ] Deduced a trap composed of 7 places in 40 ms
[2021-05-17 21:58:51] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2021-05-17 21:58:51] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2021-05-17 21:58:51] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2021-05-17 21:58:51] [INFO ] Deduced a trap composed of 9 places in 27 ms
[2021-05-17 21:58:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 265 ms
[2021-05-17 21:58:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:58:52] [INFO ] [Nat]Absence check using 41 positive place invariants in 21 ms returned sat
[2021-05-17 21:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:58:52] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-17 21:58:52] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2021-05-17 21:58:52] [INFO ] Deduced a trap composed of 7 places in 39 ms
[2021-05-17 21:58:52] [INFO ] Deduced a trap composed of 10 places in 31 ms
[2021-05-17 21:58:52] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2021-05-17 21:58:52] [INFO ] Deduced a trap composed of 9 places in 27 ms
[2021-05-17 21:58:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 211 ms
[2021-05-17 21:58:52] [INFO ] Computed and/alt/rep : 194/1029/194 causal constraints in 16 ms.
[2021-05-17 21:58:59] [INFO ] Added : 187 causal constraints over 38 iterations in 7303 ms. Result :unknown
Incomplete Parikh walk after 30900 steps, including 868 resets, run finished after 94 ms. (steps per millisecond=328 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 197/197 transitions.
Applied a total of 0 rules in 23 ms. Remains 147 /147 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 197/197 transitions.
Starting structural reductions, iteration 0 : 147/147 places, 197/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 147 cols
[2021-05-17 21:58:59] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 21:59:00] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 197 rows 147 cols
[2021-05-17 21:59:00] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 21:59:00] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2021-05-17 21:59:00] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 197 rows 147 cols
[2021-05-17 21:59:00] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 21:59:00] [INFO ] Dead Transitions using invariants and state equation in 245 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 197/197 transitions.
Incomplete random walk after 100000 steps, including 709 resets, run finished after 215 ms. (steps per millisecond=465 ) properties seen :[0]
// Phase 1: matrix 197 rows 147 cols
[2021-05-17 21:59:01] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-17 21:59:01] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-17 21:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:59:01] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-17 21:59:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 228 ms
[2021-05-17 21:59:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:59:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 20 ms returned sat
[2021-05-17 21:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:59:01] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 7 places in 38 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 10 places in 33 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2021-05-17 21:59:01] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2021-05-17 21:59:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 242 ms
[2021-05-17 21:59:01] [INFO ] Computed and/alt/rep : 194/1029/194 causal constraints in 15 ms.
[2021-05-17 21:59:09] [INFO ] Added : 187 causal constraints over 38 iterations in 7221 ms. Result :unknown
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 147 cols
[2021-05-17 21:59:09] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-17 21:59:09] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-17 21:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:59:09] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 7 places in 37 ms
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 9 places in 27 ms
[2021-05-17 21:59:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 246 ms
[2021-05-17 21:59:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 21:59:09] [INFO ] [Nat]Absence check using 41 positive place invariants in 18 ms returned sat
[2021-05-17 21:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 21:59:09] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 7 places in 50 ms
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 7 places in 41 ms
[2021-05-17 21:59:09] [INFO ] Deduced a trap composed of 10 places in 31 ms
[2021-05-17 21:59:10] [INFO ] Deduced a trap composed of 12 places in 27 ms
[2021-05-17 21:59:10] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-17 21:59:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 240 ms
[2021-05-17 21:59:10] [INFO ] Computed and/alt/rep : 194/1029/194 causal constraints in 15 ms.
[2021-05-17 21:59:17] [INFO ] Added : 187 causal constraints over 38 iterations in 7209 ms. Result :unknown
[2021-05-17 21:59:17] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-17 21:59:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
[2021-05-17 21:59:17] [INFO ] Flatten gal took : 112 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-010B @ 3570 seconds

FORMULA ShieldRVs-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-010B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 21:59:18 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20368,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"JSON": "ReachabilityFireability.json",
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p89 <= 0) OR (p130 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p76 <= 0) OR (p78 <= 0) OR (p83 <= 0))))",
"processed_size": 126,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 929,
"conflict_clusters": 17,
"places": 147,
"places_significant": 106,
"singleton_clusters": 0,
"transitions": 197
},
"result":
{
"edges": 126,
"markings": 127,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 344/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 147
lola: finding significant places
lola: 147 places, 197 transitions, 106 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: A (G (((p89 <= 0) OR (p130 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p76 <= 0) OR (p78 <= 0) OR (p83 <= 0))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p89 <= 0) OR (p130 <= 0) OR (p23 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p76 <= 0) OR (p78 <= 0) OR (p83 <= 0))))
lola: processed formula length: 126
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p89) AND (1 <= p130) AND (1 <= p23) AND (1 <= p28) AND (1 <= p37) AND (1 <= p76) AND (1 <= p78) AND (1 <= p83))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 127 markings, 126 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: memory consumption: 20368 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: memory consumption: 20368 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="ShieldRVs-PT-010B"
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 ShieldRVs-PT-010B, 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 r246-smll-162106594200048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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