fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r246-smll-162106594300136
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldRVt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
244.615 3600000.00 47532.00 380.90 TFFTFFFTTTFTTTFT normal

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-162106594300136.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594300136
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621321052161

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 06:57:34] [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 06:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:57:34] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2021-05-18 06:57:34] [INFO ] Transformed 503 places.
[2021-05-18 06:57:34] [INFO ] Transformed 503 transitions.
[2021-05-18 06:57:34] [INFO ] Found NUPN structural information;
[2021-05-18 06:57:34] [INFO ] Parsed PT model containing 503 places and 503 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1]
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 1, 0]
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 1]
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 503 rows 503 cols
[2021-05-18 06:57:35] [INFO ] Computed 41 place invariants in 21 ms
[2021-05-18 06:57:35] [INFO ] [Real]Absence check using 41 positive place invariants in 72 ms returned sat
[2021-05-18 06:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:36] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2021-05-18 06:57:36] [INFO ] Deduced a trap composed of 33 places in 337 ms
[2021-05-18 06:57:37] [INFO ] Deduced a trap composed of 35 places in 333 ms
[2021-05-18 06:57:37] [INFO ] Deduced a trap composed of 26 places in 281 ms
[2021-05-18 06:57:37] [INFO ] Deduced a trap composed of 37 places in 269 ms
[2021-05-18 06:57:38] [INFO ] Deduced a trap composed of 21 places in 276 ms
[2021-05-18 06:57:38] [INFO ] Deduced a trap composed of 24 places in 267 ms
[2021-05-18 06:57:38] [INFO ] Deduced a trap composed of 31 places in 241 ms
[2021-05-18 06:57:38] [INFO ] Deduced a trap composed of 21 places in 229 ms
[2021-05-18 06:57:39] [INFO ] Deduced a trap composed of 20 places in 230 ms
[2021-05-18 06:57:39] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2021-05-18 06:57:39] [INFO ] Deduced a trap composed of 29 places in 231 ms
[2021-05-18 06:57:39] [INFO ] Deduced a trap composed of 35 places in 191 ms
[2021-05-18 06:57:40] [INFO ] Deduced a trap composed of 41 places in 159 ms
[2021-05-18 06:57:40] [INFO ] Deduced a trap composed of 32 places in 153 ms
1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
[2021-05-18 06:57:40] [INFO ] Deduced a trap composed of 15 places in 355 ms
[2021-05-18 06:57:40] [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 s405 s406 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453) 0)") while checking expression at index 0
[2021-05-18 06:57:40] [INFO ] [Real]Absence check using 41 positive place invariants in 44 ms returned sat
[2021-05-18 06:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:41] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2021-05-18 06:57:41] [INFO ] Deduced a trap composed of 31 places in 257 ms
[2021-05-18 06:57:42] [INFO ] Deduced a trap composed of 25 places in 232 ms
[2021-05-18 06:57:42] [INFO ] Deduced a trap composed of 34 places in 222 ms
[2021-05-18 06:57:42] [INFO ] Deduced a trap composed of 20 places in 216 ms
[2021-05-18 06:57:42] [INFO ] Deduced a trap composed of 29 places in 187 ms
[2021-05-18 06:57:42] [INFO ] Deduced a trap composed of 29 places in 185 ms
[2021-05-18 06:57:43] [INFO ] Deduced a trap composed of 29 places in 188 ms
[2021-05-18 06:57:43] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2021-05-18 06:57:43] [INFO ] Deduced a trap composed of 31 places in 176 ms
[2021-05-18 06:57:43] [INFO ] Deduced a trap composed of 23 places in 150 ms
[2021-05-18 06:57:43] [INFO ] Deduced a trap composed of 40 places in 153 ms
[2021-05-18 06:57:44] [INFO ] Deduced a trap composed of 21 places in 113 ms
[2021-05-18 06:57:44] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2021-05-18 06:57:44] [INFO ] Deduced a trap composed of 22 places in 126 ms
[2021-05-18 06:57:44] [INFO ] Deduced a trap composed of 33 places in 127 ms
[2021-05-18 06:57:44] [INFO ] Deduced a trap composed of 29 places in 117 ms
[2021-05-18 06:57:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3227 ms
[2021-05-18 06:57:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:57:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 88 ms returned sat
[2021-05-18 06:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:45] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2021-05-18 06:57:45] [INFO ] Deduced a trap composed of 44 places in 230 ms
[2021-05-18 06:57:46] [INFO ] Deduced a trap composed of 43 places in 186 ms
[2021-05-18 06:57:46] [INFO ] Deduced a trap composed of 42 places in 186 ms
[2021-05-18 06:57:46] [INFO ] Deduced a trap composed of 23 places in 178 ms
[2021-05-18 06:57:46] [INFO ] Deduced a trap composed of 30 places in 199 ms
[2021-05-18 06:57:46] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2021-05-18 06:57:47] [INFO ] Deduced a trap composed of 29 places in 224 ms
[2021-05-18 06:57:47] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2021-05-18 06:57:47] [INFO ] Deduced a trap composed of 49 places in 195 ms
[2021-05-18 06:57:47] [INFO ] Deduced a trap composed of 33 places in 195 ms
[2021-05-18 06:57:48] [INFO ] Deduced a trap composed of 35 places in 188 ms
[2021-05-18 06:57:48] [INFO ] Deduced a trap composed of 36 places in 224 ms
[2021-05-18 06:57:48] [INFO ] Deduced a trap composed of 36 places in 178 ms
[2021-05-18 06:57:48] [INFO ] Deduced a trap composed of 25 places in 150 ms
[2021-05-18 06:57:48] [INFO ] Deduced a trap composed of 28 places in 139 ms
[2021-05-18 06:57:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3224 ms
[2021-05-18 06:57:48] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints in 35 ms.
[2021-05-18 06:57:49] [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 (=> (> t174 0) (and (> t173 0) (< o173 o174)))") while checking expression at index 1
[2021-05-18 06:57:49] [INFO ] [Real]Absence check using 41 positive place invariants in 41 ms returned sat
[2021-05-18 06:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:50] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2021-05-18 06:57:50] [INFO ] Deduced a trap composed of 29 places in 257 ms
[2021-05-18 06:57:51] [INFO ] Deduced a trap composed of 21 places in 241 ms
[2021-05-18 06:57:51] [INFO ] Deduced a trap composed of 28 places in 246 ms
[2021-05-18 06:57:51] [INFO ] Deduced a trap composed of 31 places in 228 ms
[2021-05-18 06:57:51] [INFO ] Deduced a trap composed of 20 places in 213 ms
[2021-05-18 06:57:52] [INFO ] Deduced a trap composed of 21 places in 203 ms
[2021-05-18 06:57:52] [INFO ] Deduced a trap composed of 35 places in 155 ms
[2021-05-18 06:57:52] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2021-05-18 06:57:52] [INFO ] Deduced a trap composed of 32 places in 144 ms
[2021-05-18 06:57:52] [INFO ] Deduced a trap composed of 22 places in 112 ms
[2021-05-18 06:57:52] [INFO ] Deduced a trap composed of 28 places in 122 ms
[2021-05-18 06:57:53] [INFO ] Deduced a trap composed of 29 places in 120 ms
[2021-05-18 06:57:53] [INFO ] Deduced a trap composed of 27 places in 100 ms
[2021-05-18 06:57:53] [INFO ] Deduced a trap composed of 31 places in 82 ms
[2021-05-18 06:57:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2705 ms
[2021-05-18 06:57:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:57:53] [INFO ] [Nat]Absence check using 41 positive place invariants in 68 ms returned sat
[2021-05-18 06:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:57:54] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2021-05-18 06:57:54] [INFO ] Deduced a trap composed of 34 places in 222 ms
[2021-05-18 06:57:54] [INFO ] Deduced a trap composed of 31 places in 234 ms
[2021-05-18 06:57:54] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2021-05-18 06:57:55] [INFO ] Deduced a trap composed of 36 places in 218 ms
[2021-05-18 06:57:55] [INFO ] Deduced a trap composed of 37 places in 196 ms
[2021-05-18 06:57:55] [INFO ] Deduced a trap composed of 22 places in 225 ms
[2021-05-18 06:57:55] [INFO ] Deduced a trap composed of 36 places in 234 ms
[2021-05-18 06:57:56] [INFO ] Deduced a trap composed of 27 places in 186 ms
[2021-05-18 06:57:56] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2021-05-18 06:57:56] [INFO ] Deduced a trap composed of 37 places in 168 ms
[2021-05-18 06:57:56] [INFO ] Deduced a trap composed of 29 places in 164 ms
[2021-05-18 06:57:56] [INFO ] Deduced a trap composed of 31 places in 159 ms
[2021-05-18 06:57:57] [INFO ] Deduced a trap composed of 29 places in 167 ms
[2021-05-18 06:57:57] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2021-05-18 06:57:57] [INFO ] Deduced a trap composed of 33 places in 168 ms
[2021-05-18 06:57:57] [INFO ] Deduced a trap composed of 26 places in 151 ms
[2021-05-18 06:57:57] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2021-05-18 06:57:57] [INFO ] Deduced a trap composed of 38 places in 153 ms
[2021-05-18 06:57:58] [INFO ] Deduced a trap composed of 25 places in 144 ms
[2021-05-18 06:57:58] [INFO ] Deduced a trap composed of 28 places in 114 ms
[2021-05-18 06:57:58] [INFO ] Deduced a trap composed of 31 places in 128 ms
[2021-05-18 06:57:58] [INFO ] Deduced a trap composed of 31 places in 135 ms
[2021-05-18 06: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 s7 s8 s62 s63 s68 s69 s70 s71 s72 s73 s74 s75 s89 s90 s91 s92 s93 s94 s95 s96 s97 s100 s109 s110) 0)") while checking expression at index 2
Support contains 24 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.
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 153 rules applied. Total rules applied 304 place count 352 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 305 place count 351 transition count 350
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 305 place count 351 transition count 310
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 385 place count 311 transition count 310
Symmetric choice reduction at 3 with 60 rule applications. Total rules 445 place count 311 transition count 310
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 60 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 565 place count 251 transition count 250
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 565 place count 251 transition count 228
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 609 place count 229 transition count 228
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 785 place count 141 transition count 140
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 829 place count 119 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 830 place count 118 transition count 155
Applied a total of 830 rules in 142 ms. Remains 118 /503 variables (removed 385) and now considering 155/503 (removed 348) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/503 places, 155/503 transitions.
Incomplete random walk after 1000000 steps, including 15 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties seen :[0, 0, 1]
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 1249 ms. (steps per millisecond=800 ) properties seen :[1, 0]
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 1 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties seen :[0]
// Phase 1: matrix 155 rows 118 cols
[2021-05-18 06:58:02] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-18 06:58:03] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned sat
[2021-05-18 06:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:03] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-18 06:58:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:03] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-18 06:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:03] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-18 06:58:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-18 06:58:03] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2021-05-18 06:58:03] [INFO ] Computed and/alt/rep : 151/671/151 causal constraints in 12 ms.
[2021-05-18 06:58:03] [INFO ] Added : 139 causal constraints over 28 iterations in 529 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Finished Parikh walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

--------------------
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="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-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-162106594300136"
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 [ "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 ;