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-162106594300152.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 ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594300152
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 19:06 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 364K 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 ShieldRVt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621327031287

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 08:37:16] [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-18 08:37:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 08:37:16] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2021-05-18 08:37:16] [INFO ] Transformed 1503 places.
[2021-05-18 08:37:16] [INFO ] Transformed 1503 transitions.
[2021-05-18 08:37:16] [INFO ] Found NUPN structural information;
[2021-05-18 08:37:16] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 106 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 224 ms. (steps per millisecond=44 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1]
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[0, 0, 1, 0, 0, 0, 0]
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1503 rows 1503 cols
[2021-05-18 08:37:17] [INFO ] Computed 121 place invariants in 80 ms
[2021-05-18 08:37:18] [INFO ] [Real]Absence check using 121 positive place invariants in 262 ms returned sat
[2021-05-18 08:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:22] [INFO ] [Real]Absence check using state equation in 4155 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 08:37:23] [INFO ] [Real]Absence check using 121 positive place invariants in 292 ms returned sat
[2021-05-18 08:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:37:27] [INFO ] [Real]Absence check using state equation in 4266 ms returned (error "Failed to check-sat")
[2021-05-18 08:37:28] [INFO ] [Real]Absence check using 121 positive place invariants in 463 ms returned sat
[2021-05-18 08:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:32] [INFO ] [Real]Absence check using state equation in 4176 ms returned sat
[2021-05-18 08:37:35] [INFO ] Deduced a trap composed of 19 places in 2566 ms
[2021-05-18 08:37:35] [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 s1356 s1357 s1358 s1359 s1360 s1361 s1362 s1363 s1364 s1365 s1366 s1367 s1368 s1369 s1370 s1371) 0)") while checking expression at index 2
[2021-05-18 08:37:36] [INFO ] [Real]Absence check using 121 positive place invariants in 456 ms returned sat
[2021-05-18 08:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:37:40] [INFO ] [Real]Absence check using state equation in 3997 ms returned (error "Failed to check-sat")
[2021-05-18 08:37:40] [INFO ] [Real]Absence check using 121 positive place invariants in 266 ms returned sat
[2021-05-18 08:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:37:45] [INFO ] [Real]Absence check using state equation in 4470 ms returned (error "Failed to check-sat")
Support contains 19 out of 1503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Performed 469 Post agglomeration using F-continuation condition.Transition count delta: 469
Iterating post reduction 0 with 469 rules applied. Total rules applied 469 place count 1503 transition count 1034
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 471 rules applied. Total rules applied 940 place count 1034 transition count 1032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 941 place count 1033 transition count 1032
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 941 place count 1033 transition count 910
Deduced a syphon composed of 122 places in 5 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1185 place count 911 transition count 910
Symmetric choice reduction at 3 with 208 rule applications. Total rules 1393 place count 911 transition count 910
Deduced a syphon composed of 208 places in 4 ms
Reduce places removed 208 places and 208 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 1809 place count 703 transition count 702
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 1809 place count 703 transition count 615
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 1983 place count 616 transition count 615
Performed 261 Post agglomeration using F-continuation condition.Transition count delta: 261
Deduced a syphon composed of 261 places in 1 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 3 with 522 rules applied. Total rules applied 2505 place count 355 transition count 354
Renaming transitions due to excessive name length > 1024 char.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 2675 place count 270 transition count 434
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2676 place count 270 transition count 433
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2677 place count 270 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2678 place count 269 transition count 432
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2679 place count 269 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2680 place count 268 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2681 place count 267 transition count 430
Applied a total of 2681 rules in 1053 ms. Remains 267 /1503 variables (removed 1236) and now considering 430/1503 (removed 1073) transitions.
Finished structural reductions, in 1 iterations. Remains : 267/1503 places, 430/1503 transitions.
Incomplete random walk after 1000000 steps, including 209 resets, run finished after 4625 ms. (steps per millisecond=216 ) properties seen :[1, 1, 1, 1, 0]
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2529 ms. (steps per millisecond=395 ) properties seen :[0]
// Phase 1: matrix 430 rows 267 cols
[2021-05-18 08:37:53] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-18 08:37:53] [INFO ] [Real]Absence check using 120 positive place invariants in 110 ms returned sat
[2021-05-18 08:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:54] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2021-05-18 08:37:54] [INFO ] State equation strengthened by 93 read => feed constraints.
[2021-05-18 08:37:54] [INFO ] [Real]Added 93 Read/Feed constraints in 43 ms returned sat
[2021-05-18 08:37:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:37:54] [INFO ] [Nat]Absence check using 120 positive place invariants in 68 ms returned sat
[2021-05-18 08:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:37:55] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2021-05-18 08:37:55] [INFO ] [Nat]Added 93 Read/Feed constraints in 26 ms returned sat
[2021-05-18 08:37:55] [INFO ] Computed and/alt/rep : 421/2209/421 causal constraints in 62 ms.
[2021-05-18 08:38:06] [INFO ] Added : 375 causal constraints over 76 iterations in 11372 ms. Result :unknown
Incomplete Parikh walk after 48200 steps, including 1000 resets, run finished after 257 ms. (steps per millisecond=187 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 267/267 places, 430/430 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 267 transition count 423
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 260 transition count 423
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 254 transition count 417
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 251 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 250 transition count 419
Applied a total of 33 rules in 47 ms. Remains 250 /267 variables (removed 17) and now considering 419/430 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/267 places, 419/430 transitions.
Incomplete random walk after 1000000 steps, including 258 resets, run finished after 4478 ms. (steps per millisecond=223 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 36 resets, run finished after 2785 ms. (steps per millisecond=359 ) properties seen :[0]
Interrupted probabilistic random walk after 5536875 steps, run timeout after 30001 ms. (steps per millisecond=184 ) properties seen :[0]
Probabilistic random walk after 5536875 steps, saw 664089 distinct states, run finished after 30011 ms. (steps per millisecond=184 ) properties seen :[0]
// Phase 1: matrix 419 rows 250 cols
[2021-05-18 08:38:44] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-18 08:38:44] [INFO ] [Real]Absence check using 120 positive place invariants in 126 ms returned sat
[2021-05-18 08:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:38:45] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2021-05-18 08:38:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-18 08:38:45] [INFO ] [Real]Added 20 Read/Feed constraints in 22 ms returned sat
[2021-05-18 08:38:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:38:45] [INFO ] [Nat]Absence check using 120 positive place invariants in 57 ms returned sat
[2021-05-18 08:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:38:45] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2021-05-18 08:38:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 9 ms returned sat
[2021-05-18 08:38:45] [INFO ] Computed and/alt/rep : 413/1441/413 causal constraints in 42 ms.
[2021-05-18 08:38:57] [INFO ] Added : 362 causal constraints over 73 iterations in 11967 ms. Result :unknown
Incomplete Parikh walk after 45100 steps, including 1000 resets, run finished after 215 ms. (steps per millisecond=209 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 419/419 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 419/419 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 419/419 transitions.
Applied a total of 0 rules in 56 ms. Remains 250 /250 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 250 cols
[2021-05-18 08:38:57] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-18 08:38:58] [INFO ] Implicit Places using invariants in 855 ms returned []
// Phase 1: matrix 419 rows 250 cols
[2021-05-18 08:38:58] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-18 08:38:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-18 08:39:00] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
[2021-05-18 08:39:00] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 419 rows 250 cols
[2021-05-18 08:39:00] [INFO ] Computed 120 place invariants in 1 ms
[2021-05-18 08:39:02] [INFO ] Dead Transitions using invariants and state equation in 1346 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 419/419 transitions.
Incomplete random walk after 100000 steps, including 30 resets, run finished after 516 ms. (steps per millisecond=193 ) properties seen :[0]
// Phase 1: matrix 419 rows 250 cols
[2021-05-18 08:39:02] [INFO ] Computed 120 place invariants in 2 ms
[2021-05-18 08:39:02] [INFO ] [Real]Absence check using 120 positive place invariants in 57 ms returned sat
[2021-05-18 08:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:39:03] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2021-05-18 08:39:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-18 08:39:03] [INFO ] [Real]Added 20 Read/Feed constraints in 9 ms returned sat
[2021-05-18 08:39:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:39:04] [INFO ] [Nat]Absence check using 120 positive place invariants in 381 ms returned sat
[2021-05-18 08:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:39:04] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2021-05-18 08:39:04] [INFO ] [Nat]Added 20 Read/Feed constraints in 14 ms returned sat
[2021-05-18 08:39:04] [INFO ] Computed and/alt/rep : 413/1441/413 causal constraints in 62 ms.
[2021-05-18 08:39:18] [INFO ] Added : 362 causal constraints over 73 iterations in 13627 ms. Result :unknown
Graph (trivial) has 116 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 13 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 836 edges and 248 vertex of which 246 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 113 edges and 244 vertex of which 4 / 244 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 242 transition count 410
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 112 edges and 240 vertex of which 6 / 240 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 237 transition count 401
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 110 edges and 234 vertex of which 8 / 234 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 40 place count 230 transition count 390
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 104 edges and 227 vertex of which 4 / 227 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 16 rules applied. Total rules applied 56 place count 225 transition count 378
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 101 edges and 223 vertex of which 2 / 223 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 4 with 9 rules applied. Total rules applied 65 place count 222 transition count 372
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 70 place count 221 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 73 place count 219 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 77 place count 219 transition count 363
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 79 place count 219 transition count 363
Partial Post-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 105 place count 219 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 106 place count 219 transition count 362
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 131 place count 219 transition count 337
Applied a total of 131 rules in 147 ms. Remains 219 /250 variables (removed 31) and now considering 337/419 (removed 82) transitions.
// Phase 1: matrix 337 rows 219 cols
[2021-05-18 08:39:18] [INFO ] Computed 105 place invariants in 2 ms
[2021-05-18 08:39:18] [INFO ] [Real]Absence check using 105 positive place invariants in 77 ms returned sat
[2021-05-18 08:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:39:19] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2021-05-18 08:39:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-18 08:39:19] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-18 08:39:19] [INFO ] Computed and/alt/rep : 334/1118/334 causal constraints in 40 ms.
[2021-05-18 08:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:39:19] [INFO ] [Nat]Absence check using 105 positive place invariants in 59 ms returned sat
[2021-05-18 08:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:39:19] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2021-05-18 08:39:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-18 08:39:19] [INFO ] Computed and/alt/rep : 334/1118/334 causal constraints in 61 ms.
[2021-05-18 08:39:29] [INFO ] Added : 298 causal constraints over 60 iterations in 9356 ms. Result :unknown
[2021-05-18 08:39:29] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2021-05-18 08:39:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 44 ms.
[2021-05-18 08:39:30] [INFO ] Flatten gal took : 218 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVt-PT-030B @ 3570 seconds

FORMULA ShieldRVt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldRVt-PT-030B

{
"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": "Tue May 18 08:39:32 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20836,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p225) AND (1 <= p52) AND (((1 <= p190)) OR ((1 <= p21)) OR ((1 <= p193) AND (1 <= p165))))))",
"processed_size": 107,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2334,
"conflict_clusters": 71,
"places": 250,
"places_significant": 130,
"singleton_clusters": 0,
"transitions": 419
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 3
},
"type": "reachability",
"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: 669/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 419 transitions, 130 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: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: E (F (((1 <= p225) AND (1 <= p52) AND (((1 <= p190)) OR ((1 <= p21)) OR ((1 <= p193) AND (1 <= p165))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p225) AND (1 <= p52) AND (((1 <= p190)) OR ((1 <= p21)) OR ((1 <= p193) AND (1 <= p165))))))
lola: processed formula length: 107
lola: 1 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: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p225) AND (1 <= p52) AND (((1 <= p190)) OR ((1 <= p21)) OR ((1 <= p193) AND (1 <= p165))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 20836 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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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-162106594300152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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