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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:46 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 498K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621303530271

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 02:05:32] [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 02:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 02:05:33] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2021-05-18 02:05:33] [INFO ] Transformed 1603 places.
[2021-05-18 02:05:33] [INFO ] Transformed 1803 transitions.
[2021-05-18 02:05:33] [INFO ] Found NUPN structural information;
[2021-05-18 02:05:33] [INFO ] Parsed PT model containing 1603 places and 1803 transitions in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 80 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 113 ms. (steps per millisecond=88 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1803 rows 1603 cols
[2021-05-18 02:05:33] [INFO ] Computed 161 place invariants in 72 ms
[2021-05-18 02:05:34] [INFO ] [Real]Absence check using 161 positive place invariants in 269 ms returned sat
[2021-05-18 02:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:05:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 02:05:38] [INFO ] [Real]Absence check using state equation in 4237 ms returned (error "Failed to check-sat")
[2021-05-18 02:05:39] [INFO ] [Real]Absence check using 161 positive place invariants in 241 ms returned sat
[2021-05-18 02:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:05:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 02:05:43] [INFO ] [Real]Absence check using state equation in 4436 ms returned (error "Failed to check-sat")
[2021-05-18 02:05:44] [INFO ] [Real]Absence check using 161 positive place invariants in 238 ms returned sat
[2021-05-18 02:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:05:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 02:05:48] [INFO ] [Real]Absence check using state equation in 4504 ms returned (error "Failed to check-sat")
[2021-05-18 02:05:49] [INFO ] [Real]Absence check using 161 positive place invariants in 252 ms returned sat
[2021-05-18 02:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:05:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 02:05:53] [INFO ] [Real]Absence check using state equation in 4473 ms returned (error "Failed to check-sat")
Support contains 30 out of 1603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 1603 transition count 1647
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 1 with 156 rules applied. Total rules applied 312 place count 1447 transition count 1647
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 312 place count 1447 transition count 1450
Deduced a syphon composed of 197 places in 5 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 706 place count 1250 transition count 1450
Symmetric choice reduction at 2 with 271 rule applications. Total rules 977 place count 1250 transition count 1450
Deduced a syphon composed of 271 places in 8 ms
Reduce places removed 271 places and 271 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1519 place count 979 transition count 1179
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 1519 place count 979 transition count 1067
Deduced a syphon composed of 112 places in 7 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 1743 place count 867 transition count 1067
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 278
Deduced a syphon composed of 278 places in 4 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 2 with 556 rules applied. Total rules applied 2299 place count 589 transition count 789
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 76 times.
Drop transitions removed 76 transitions
Iterating global reduction 2 with 76 rules applied. Total rules applied 2375 place count 589 transition count 789
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2376 place count 588 transition count 788
Applied a total of 2376 rules in 704 ms. Remains 588 /1603 variables (removed 1015) and now considering 788/1803 (removed 1015) transitions.
Finished structural reductions, in 1 iterations. Remains : 588/1603 places, 788/1803 transitions.
Incomplete random walk after 1000000 steps, including 1974 resets, run finished after 6734 ms. (steps per millisecond=148 ) properties seen :[0, 0, 0, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 232 resets, run finished after 3548 ms. (steps per millisecond=281 ) properties seen :[1, 0, 0]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 212 resets, run finished after 3060 ms. (steps per millisecond=326 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 199 resets, run finished after 3858 ms. (steps per millisecond=259 ) properties seen :[0, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 788 rows 588 cols
[2021-05-18 02:06:11] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-18 02:06:11] [INFO ] [Real]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-18 02:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:06:13] [INFO ] [Real]Absence check using state equation in 1480 ms returned sat
[2021-05-18 02:06:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:06:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 105 ms returned sat
[2021-05-18 02:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:06:15] [INFO ] [Nat]Absence check using state equation in 1360 ms returned sat
[2021-05-18 02:06:15] [INFO ] Deduced a trap composed of 9 places in 513 ms
[2021-05-18 02:06:15] [INFO ] Deduced a trap composed of 10 places in 129 ms
[2021-05-18 02:06:15] [INFO ] Deduced a trap composed of 6 places in 114 ms
[2021-05-18 02:06:16] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2021-05-18 02:06:16] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2021-05-18 02:06:16] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2021-05-18 02:06:16] [INFO ] Deduced a trap composed of 10 places in 102 ms
[2021-05-18 02:06:16] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2021-05-18 02:06:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1608 ms
[2021-05-18 02:06:16] [INFO ] Computed and/alt/rep : 777/4130/777 causal constraints in 114 ms.
[2021-05-18 02:06:36] [INFO ] Added : 550 causal constraints over 110 iterations in 20154 ms.(timeout) Result :sat
[2021-05-18 02:06:37] [INFO ] Deduced a trap composed of 24 places in 152 ms
[2021-05-18 02:06:37] [INFO ] Deduced a trap composed of 14 places in 124 ms
[2021-05-18 02:06:37] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2021-05-18 02:06:37] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2021-05-18 02:06:37] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2021-05-18 02:06:38] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-18 02:06:38] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2021-05-18 02:06:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1491 ms
Attempting to minimize the solution found.
Minimization took 71 ms.
Incomplete Parikh walk after 92400 steps, including 605 resets, run finished after 563 ms. (steps per millisecond=164 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 588 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 588/588 places, 788/788 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 588 transition count 784
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 584 transition count 784
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 8 place count 584 transition count 777
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 577 transition count 777
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 568 transition count 768
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 568 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 567 transition count 767
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 566 transition count 766
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 565 transition count 765
Applied a total of 51 rules in 257 ms. Remains 565 /588 variables (removed 23) and now considering 765/788 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 565/588 places, 765/788 transitions.
Incomplete random walk after 1000000 steps, including 2126 resets, run finished after 5879 ms. (steps per millisecond=170 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 236 resets, run finished after 3265 ms. (steps per millisecond=306 ) properties seen :[0]
Interrupted probabilistic random walk after 2500915 steps, run timeout after 30001 ms. (steps per millisecond=83 ) properties seen :[0]
Probabilistic random walk after 2500915 steps, saw 401160 distinct states, run finished after 30001 ms. (steps per millisecond=83 ) properties seen :[0]
// Phase 1: matrix 765 rows 565 cols
[2021-05-18 02:07:18] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-18 02:07:18] [INFO ] [Real]Absence check using 161 positive place invariants in 133 ms returned sat
[2021-05-18 02:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:20] [INFO ] [Real]Absence check using state equation in 1251 ms returned sat
[2021-05-18 02:07:20] [INFO ] Deduced a trap composed of 7 places in 157 ms
[2021-05-18 02:07:20] [INFO ] Deduced a trap composed of 11 places in 147 ms
[2021-05-18 02:07:20] [INFO ] Deduced a trap composed of 10 places in 104 ms
[2021-05-18 02:07:20] [INFO ] Deduced a trap composed of 14 places in 198 ms
[2021-05-18 02:07:21] [INFO ] Deduced a trap composed of 9 places in 316 ms
[2021-05-18 02:07:21] [INFO ] Deduced a trap composed of 23 places in 266 ms
[2021-05-18 02:07:21] [INFO ] Deduced a trap composed of 14 places in 69 ms
[2021-05-18 02:07:21] [INFO ] Deduced a trap composed of 22 places in 83 ms
[2021-05-18 02:07:21] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2021-05-18 02:07:21] [INFO ] Deduced a trap composed of 10 places in 78 ms
[2021-05-18 02:07:22] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2021-05-18 02:07:22] [INFO ] Deduced a trap composed of 15 places in 61 ms
[2021-05-18 02:07:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2042 ms
[2021-05-18 02:07:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:07:22] [INFO ] [Nat]Absence check using 161 positive place invariants in 142 ms returned sat
[2021-05-18 02:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:23] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2021-05-18 02:07:23] [INFO ] Deduced a trap composed of 7 places in 111 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 9 places in 122 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 10 places in 142 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 12 places in 129 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 10 places in 129 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 14 places in 141 ms
[2021-05-18 02:07:24] [INFO ] Deduced a trap composed of 10 places in 86 ms
[2021-05-18 02:07:25] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2021-05-18 02:07:25] [INFO ] Deduced a trap composed of 11 places in 79 ms
[2021-05-18 02:07:25] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2021-05-18 02:07:25] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2021-05-18 02:07:25] [INFO ] Deduced a trap composed of 10 places in 35 ms
[2021-05-18 02:07:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1789 ms
[2021-05-18 02:07:25] [INFO ] Computed and/alt/rep : 763/4045/763 causal constraints in 72 ms.
[2021-05-18 02:07:45] [INFO ] Added : 645 causal constraints over 129 iterations in 20327 ms.(timeout) Result :sat
[2021-05-18 02:07:45] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2021-05-18 02:07:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
Attempting to minimize the solution found.
Minimization took 110 ms.
Incomplete Parikh walk after 81100 steps, including 997 resets, run finished after 487 ms. (steps per millisecond=166 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 565 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 565/565 places, 765/765 transitions.
Applied a total of 0 rules in 19 ms. Remains 565 /565 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 565/565 places, 765/765 transitions.
Starting structural reductions, iteration 0 : 565/565 places, 765/765 transitions.
Applied a total of 0 rules in 18 ms. Remains 565 /565 variables (removed 0) and now considering 765/765 (removed 0) transitions.
// Phase 1: matrix 765 rows 565 cols
[2021-05-18 02:07:46] [INFO ] Computed 161 place invariants in 6 ms
[2021-05-18 02:07:47] [INFO ] Implicit Places using invariants in 1249 ms returned []
// Phase 1: matrix 765 rows 565 cols
[2021-05-18 02:07:47] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-18 02:07:52] [INFO ] Implicit Places using invariants and state equation in 4223 ms returned []
Implicit Place search using SMT with State Equation took 5474 ms to find 0 implicit places.
[2021-05-18 02:07:52] [INFO ] Redundant transitions in 446 ms returned []
// Phase 1: matrix 765 rows 565 cols
[2021-05-18 02:07:52] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-18 02:07:54] [INFO ] Dead Transitions using invariants and state equation in 1549 ms returned []
Finished structural reductions, in 1 iterations. Remains : 565/565 places, 765/765 transitions.
Incomplete random walk after 100000 steps, including 212 resets, run finished after 521 ms. (steps per millisecond=191 ) properties seen :[0]
// Phase 1: matrix 765 rows 565 cols
[2021-05-18 02:07:54] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-18 02:07:54] [INFO ] [Real]Absence check using 161 positive place invariants in 98 ms returned sat
[2021-05-18 02:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:56] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 11 places in 113 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 10 places in 112 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 14 places in 107 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 23 places in 62 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 14 places in 60 ms
[2021-05-18 02:07:56] [INFO ] Deduced a trap composed of 22 places in 61 ms
[2021-05-18 02:07:57] [INFO ] Deduced a trap composed of 10 places in 56 ms
[2021-05-18 02:07:57] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2021-05-18 02:07:57] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2021-05-18 02:07:57] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2021-05-18 02:07:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1294 ms
[2021-05-18 02:07:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:07:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 96 ms returned sat
[2021-05-18 02:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:07:58] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2021-05-18 02:07:58] [INFO ] Deduced a trap composed of 7 places in 98 ms
[2021-05-18 02:07:58] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 10 places in 112 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 12 places in 112 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 10 places in 114 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 11 places in 106 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 14 places in 107 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 10 places in 67 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 21 places in 60 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2021-05-18 02:07:59] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-18 02:08:00] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2021-05-18 02:08:00] [INFO ] Deduced a trap composed of 10 places in 30 ms
[2021-05-18 02:08:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1471 ms
[2021-05-18 02:08:00] [INFO ] Computed and/alt/rep : 763/4045/763 causal constraints in 51 ms.
[2021-05-18 02:08:17] [INFO ] Added : 625 causal constraints over 125 iterations in 17264 ms. Result :(error "Failed to check-sat")
Applied a total of 0 rules in 27 ms. Remains 565 /565 variables (removed 0) and now considering 765/765 (removed 0) transitions.
// Phase 1: matrix 765 rows 565 cols
[2021-05-18 02:08:17] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-18 02:08:18] [INFO ] [Real]Absence check using 161 positive place invariants in 267 ms returned sat
[2021-05-18 02:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:08:19] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2021-05-18 02:08:19] [INFO ] Deduced a trap composed of 7 places in 298 ms
[2021-05-18 02:08:19] [INFO ] Deduced a trap composed of 11 places in 124 ms
[2021-05-18 02:08:19] [INFO ] Deduced a trap composed of 10 places in 152 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 23 places in 85 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 14 places in 92 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 22 places in 95 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 10 places in 98 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 10 places in 82 ms
[2021-05-18 02:08:20] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2021-05-18 02:08:21] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2021-05-18 02:08:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1908 ms
[2021-05-18 02:08:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:08:21] [INFO ] [Nat]Absence check using 161 positive place invariants in 105 ms returned sat
[2021-05-18 02:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:08:22] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2021-05-18 02:08:22] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2021-05-18 02:08:22] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2021-05-18 02:08:22] [INFO ] Deduced a trap composed of 10 places in 106 ms
[2021-05-18 02:08:22] [INFO ] Deduced a trap composed of 12 places in 107 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 11 places in 102 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 14 places in 107 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 10 places in 64 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 21 places in 61 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2021-05-18 02:08:23] [INFO ] Deduced a trap composed of 10 places in 32 ms
[2021-05-18 02:08:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1426 ms
[2021-05-18 02:08:23] [INFO ] Computed and/alt/rep : 763/4045/763 causal constraints in 49 ms.
[2021-05-18 02:08:44] [INFO ] Added : 640 causal constraints over 128 iterations in 20223 ms.(timeout) Result :sat
[2021-05-18 02:08:44] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-18 02:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
Attempting to minimize the solution found.
Minimization took 100 ms.
[2021-05-18 02:08:44] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-18 02:08:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 32 ms.
[2021-05-18 02:08:45] [INFO ] Flatten gal took : 261 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-040B @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-040B

{
"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 02:08:46 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 23280,
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p172) AND (1 <= p452) AND (1 <= p146))))",
"processed_size": 53,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3691,
"conflict_clusters": 44,
"places": 565,
"places_significant": 404,
"singleton_clusters": 0,
"transitions": 765
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"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: 1330/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 565
lola: finding significant places
lola: 565 places, 765 transitions, 404 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: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p452 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: E (F (((1 <= p172) AND (1 <= p452) AND (1 <= p146))))
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 <= p172) AND (1 <= p452) AND (1 <= p146))))
lola: processed formula length: 53
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 <= p172) AND (1 <= p452) AND (1 <= p146))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 23280 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
sara: try reading problem file ReachabilityFireability-0.sara.
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ShieldRVs-PT-040B, 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-162106594200072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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