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-162106594300135.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-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594300135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:01 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 119K 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-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621320952553

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 06:55:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 06:55:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:55:56] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2021-05-18 06:55:56] [INFO ] Transformed 503 places.
[2021-05-18 06:55:56] [INFO ] Transformed 503 transitions.
[2021-05-18 06:55:56] [INFO ] Found NUPN structural information;
[2021-05-18 06:55:56] [INFO ] Parsed PT model containing 503 places and 503 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 72 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1]
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0]
// Phase 1: matrix 503 rows 503 cols
[2021-05-18 06:55:56] [INFO ] Computed 41 place invariants in 27 ms
[2021-05-18 06:55:56] [INFO ] [Real]Absence check using 41 positive place invariants in 82 ms returned sat
[2021-05-18 06:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:55:57] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2021-05-18 06:55:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:55:57] [INFO ] [Nat]Absence check using 41 positive place invariants in 79 ms returned sat
[2021-05-18 06:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:55:58] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2021-05-18 06:55:59] [INFO ] Deduced a trap composed of 20 places in 371 ms
[2021-05-18 06:55:59] [INFO ] Deduced a trap composed of 38 places in 325 ms
[2021-05-18 06:55:59] [INFO ] Deduced a trap composed of 23 places in 335 ms
[2021-05-18 06:56:00] [INFO ] Deduced a trap composed of 23 places in 293 ms
[2021-05-18 06:56:00] [INFO ] Deduced a trap composed of 32 places in 321 ms
[2021-05-18 06:56:00] [INFO ] Deduced a trap composed of 29 places in 234 ms
[2021-05-18 06:56:00] [INFO ] Deduced a trap composed of 36 places in 219 ms
[2021-05-18 06:56:01] [INFO ] Deduced a trap composed of 28 places in 225 ms
[2021-05-18 06:56:01] [INFO ] Deduced a trap composed of 25 places in 211 ms
[2021-05-18 06:56:01] [INFO ] Deduced a trap composed of 25 places in 189 ms
[2021-05-18 06:56:01] [INFO ] Deduced a trap composed of 36 places in 282 ms
[2021-05-18 06:56:02] [INFO ] Deduced a trap composed of 25 places in 150 ms
[2021-05-18 06:56:02] [INFO ] Deduced a trap composed of 26 places in 136 ms
[2021-05-18 06:56:02] [INFO ] Deduced a trap composed of 33 places in 168 ms
[2021-05-18 06:56:02] [INFO ] Deduced a trap composed of 25 places in 117 ms
[2021-05-18 06:56:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4031 ms
[2021-05-18 06:56:02] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints in 46 ms.
[2021-05-18 06:56:02] [INFO ] Added : 0 causal constraints over 0 iterations in 75 ms. Result :(error "Failed to check-sat")
[2021-05-18 06:56:03] [INFO ] [Real]Absence check using 41 positive place invariants in 62 ms returned sat
[2021-05-18 06:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:56:03] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2021-05-18 06:56:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:56:04] [INFO ] [Nat]Absence check using 41 positive place invariants in 68 ms returned sat
[2021-05-18 06:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:56:04] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2021-05-18 06:56:05] [INFO ] Deduced a trap composed of 24 places in 278 ms
[2021-05-18 06:56:05] [INFO ] Deduced a trap composed of 24 places in 500 ms
[2021-05-18 06:56:06] [INFO ] Deduced a trap composed of 36 places in 486 ms
[2021-05-18 06:56:06] [INFO ] Deduced a trap composed of 38 places in 375 ms
[2021-05-18 06:56:06] [INFO ] Deduced a trap composed of 42 places in 209 ms
[2021-05-18 06:56:07] [INFO ] Deduced a trap composed of 45 places in 385 ms
[2021-05-18 06:56:07] [INFO ] Deduced a trap composed of 25 places in 294 ms
[2021-05-18 06:56:07] [INFO ] Deduced a trap composed of 32 places in 234 ms
[2021-05-18 06:56:08] [INFO ] Deduced a trap composed of 36 places in 212 ms
[2021-05-18 06:56:08] [INFO ] Deduced a trap composed of 24 places in 224 ms
[2021-05-18 06:56:08] [INFO ] Deduced a trap composed of 56 places in 224 ms
[2021-05-18 06:56:09] [INFO ] Deduced a trap composed of 25 places in 405 ms
[2021-05-18 06:56:09] [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 s356 s357 s361 s362 s363 s364 s365 s366 s367 s368 s369 s384 s385 s386 s387 s388 s389 s390 s391 s394 s403 s404) 0)") while checking expression at index 1
Support contains 16 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 503/503 transitions.
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 503 transition count 352
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 352 transition count 352
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 302 place count 352 transition count 314
Deduced a syphon composed of 38 places in 8 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 378 place count 314 transition count 314
Symmetric choice reduction at 2 with 65 rule applications. Total rules 443 place count 314 transition count 314
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 65 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 573 place count 249 transition count 249
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 2 with 2 rules applied. Total rules applied 575 place count 249 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 576 place count 248 transition count 247
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 576 place count 248 transition count 223
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 624 place count 224 transition count 223
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 806 place count 133 transition count 132
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 856 place count 108 transition count 151
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 857 place count 108 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 859 place count 108 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 861 place count 106 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 105 transition count 147
Applied a total of 862 rules in 269 ms. Remains 105 /503 variables (removed 398) and now considering 147/503 (removed 356) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/503 places, 147/503 transitions.
Incomplete random walk after 1000000 steps, including 530 resets, run finished after 2237 ms. (steps per millisecond=447 ) properties seen :[1, 0]
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 114 resets, run finished after 1310 ms. (steps per millisecond=763 ) properties seen :[0]
// Phase 1: matrix 147 rows 105 cols
[2021-05-18 06:56:12] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-18 06:56:12] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-18 06:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:56:12] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-18 06:56:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:56:13] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2021-05-18 06:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:56:13] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-18 06:56:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-18 06:56:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2021-05-18 06:56:13] [INFO ] Computed and/alt/rep : 139/511/139 causal constraints in 12 ms.
[2021-05-18 06:56:19] [INFO ] Added : 122 causal constraints over 25 iterations in 6414 ms. Result :unknown
Incomplete Parikh walk after 22200 steps, including 1000 resets, run finished after 78 ms. (steps per millisecond=284 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 147/147 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 143
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 101 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 101 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 99 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 97 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 94 transition count 142
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 94 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 93 transition count 141
Applied a total of 24 rules in 38 ms. Remains 93 /105 variables (removed 12) and now considering 141/147 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 141/147 transitions.
Incomplete random walk after 1000000 steps, including 290 resets, run finished after 2095 ms. (steps per millisecond=477 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 100 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties seen :[0]
Interrupted probabilistic random walk after 15954845 steps, run timeout after 30001 ms. (steps per millisecond=531 ) properties seen :[0]
Probabilistic random walk after 15954845 steps, saw 1593750 distinct states, run finished after 30002 ms. (steps per millisecond=531 ) properties seen :[0]
// Phase 1: matrix 141 rows 93 cols
[2021-05-18 06:56:52] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-18 06:56:52] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2021-05-18 06:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:56:53] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-18 06:56:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:56:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2021-05-18 06:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:56:53] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-18 06:56:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-18 06:56:53] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2021-05-18 06:56:53] [INFO ] Computed and/alt/rep : 135/497/135 causal constraints in 10 ms.
[2021-05-18 06:56:59] [INFO ] Added : 113 causal constraints over 23 iterations in 6356 ms. Result :unknown
Incomplete Parikh walk after 17700 steps, including 1000 resets, run finished after 50 ms. (steps per millisecond=354 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 141/141 transitions.
Starting structural reductions, iteration 0 : 93/93 places, 141/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 93 cols
[2021-05-18 06:56:59] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-18 06:56:59] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 141 rows 93 cols
[2021-05-18 06:56:59] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-18 06:56:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-18 06:57:00] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2021-05-18 06:57:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 141 rows 93 cols
[2021-05-18 06:57:00] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-18 06:57:00] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 141/141 transitions.
Incomplete random walk after 100000 steps, including 30 resets, run finished after 230 ms. (steps per millisecond=434 ) properties seen :[0]
// Phase 1: matrix 141 rows 93 cols
[2021-05-18 06:57:00] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-18 06:57:00] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2021-05-18 06:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:00] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-18 06:57:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:57:00] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-18 06:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:00] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-18 06:57:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-18 06:57:00] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2021-05-18 06:57:00] [INFO ] Computed and/alt/rep : 135/497/135 causal constraints in 11 ms.
[2021-05-18 06:57:07] [INFO ] Added : 113 causal constraints over 23 iterations in 6374 ms. Result :unknown
Graph (trivial) has 36 edges and 93 vertex of which 4 / 93 are part of one of the 2 SCC in 32 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 279 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 33 edges and 87 vertex of which 4 / 87 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 85 transition count 132
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 30 edges and 84 vertex of which 2 / 84 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 83 transition count 125
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 29 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 27 place count 81 transition count 122
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 3 with 5 rules applied. Total rules applied 32 place count 80 transition count 118
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 4 with 3 rules applied. Total rules applied 35 place count 78 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 39 place count 78 transition count 113
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 41 place count 78 transition count 113
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 49 place count 78 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 78 transition count 111
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 58 place count 78 transition count 104
Applied a total of 58 rules in 63 ms. Remains 78 /93 variables (removed 15) and now considering 104/141 (removed 37) transitions.
// Phase 1: matrix 104 rows 78 cols
[2021-05-18 06:57:07] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-18 06:57:07] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-18 06:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:07] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-18 06:57:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:57:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-18 06:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:07] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-18 06:57:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-18 06:57:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-18 06:57:07] [INFO ] Computed and/alt/rep : 101/309/101 causal constraints in 51 ms.
[2021-05-18 06:57:13] [INFO ] Added : 89 causal constraints over 18 iterations in 6237 ms. Result :unknown
[2021-05-18 06:57:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2021-05-18 06:57:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-18 06:57:13] [INFO ] Flatten gal took : 92 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldRVt-PT-010B @ 3570 seconds

FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityCardinality @ ShieldRVt-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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 06:57:15 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19260,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"JSON": "ReachabilityCardinality.json",
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((p48 <= 0)) OR ((1 <= p54)) OR ((1 <= p58)) OR ((p84 <= 0)) OR ((1 <= p66)) OR ((p1 <= 0)) OR ((1 <= p30)))))",
"processed_size": 123,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 730,
"conflict_clusters": 34,
"places": 93,
"places_significant": 53,
"singleton_clusters": 0,
"transitions": 141
},
"result":
{
"edges": 5,
"markings": 6,
"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": 7,
"problems": 7
},
"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: 234/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 93
lola: finding significant places
lola: 93 places, 141 transitions, 53 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: A (G ((((p48 <= 0)) OR ((1 <= p54)) OR ((1 <= p58)) OR ((p84 <= 0)) OR ((1 <= p66)) OR ((p1 <= 0)) OR ((1 <= p30)))))
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 ((((p48 <= 0)) OR ((1 <= p54)) OR ((1 <= p58)) OR ((p84 <= 0)) OR ((1 <= p66)) OR ((p1 <= 0)) OR ((1 <= p30)))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: local time limit reached - aborting
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: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p48)) AND ((p54 <= 0)) AND ((p58 <= 0)) AND ((1 <= p84)) AND ((p66 <= 0)) AND ((1 <= p1)) AND ((p30 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: memory consumption: 19260 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: memory consumption: 19260 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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-010B"
export BK_EXAMINATION="ReachabilityCardinality"
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-010B, examination is ReachabilityCardinality"
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-162106594300135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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