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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K 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.2K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:50 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 320K 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-050A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621306106474

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 02:48:29] [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:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 02:48:29] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2021-05-18 02:48:29] [INFO ] Transformed 703 places.
[2021-05-18 02:48:29] [INFO ] Transformed 953 transitions.
[2021-05-18 02:48:29] [INFO ] Found NUPN structural information;
[2021-05-18 02:48:29] [INFO ] Parsed PT model containing 703 places and 953 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 213 ms. (steps per millisecond=46 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0]
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 1, 0, 0]
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 1, 0]
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 1]
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 953 rows 703 cols
[2021-05-18 02:48:30] [INFO ] Computed 201 place invariants in 37 ms
[2021-05-18 02:48:30] [INFO ] [Real]Absence check using 201 positive place invariants in 185 ms returned sat
[2021-05-18 02:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:48:32] [INFO ] [Real]Absence check using state equation in 1812 ms returned sat
[2021-05-18 02:48:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:48:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 158 ms returned sat
[2021-05-18 02:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:48:34] [INFO ] [Nat]Absence check using state equation in 1692 ms returned sat
[2021-05-18 02:48:34] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2021-05-18 02:48:34] [INFO ] Deduced a trap composed of 8 places in 74 ms
[2021-05-18 02:48:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2021-05-18 02:48:35] [INFO ] Computed and/alt/rep : 952/7299/952 causal constraints in 115 ms.
[2021-05-18 02:48:37] [INFO ] Added : 210 causal constraints over 42 iterations in 2617 ms. Result :unknown
[2021-05-18 02:48:37] [INFO ] [Real]Absence check using 201 positive place invariants in 142 ms returned sat
[2021-05-18 02:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:48:39] [INFO ] [Real]Absence check using state equation in 1596 ms returned sat
[2021-05-18 02:48:39] [INFO ] Deduced a trap composed of 8 places in 205 ms
[2021-05-18 02:48:39] [INFO ] Deduced a trap composed of 8 places in 161 ms
[2021-05-18 02:48:40] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2021-05-18 02:48:40] [INFO ] Deduced a trap composed of 8 places in 97 ms
[2021-05-18 02:48:40] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2021-05-18 02:48:40] [INFO ] Deduced a trap composed of 12 places in 103 ms
[2021-05-18 02:48:40] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2021-05-18 02:48:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1153 ms
[2021-05-18 02:48:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:48:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 138 ms returned sat
[2021-05-18 02:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:48:42] [INFO ] [Nat]Absence check using state equation in 1559 ms returned sat
[2021-05-18 02:48:42] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2021-05-18 02:48:42] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2021-05-18 02:48:42] [INFO ] Deduced a trap composed of 11 places in 19 ms
[2021-05-18 02:48:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2021-05-18 02:48:42] [INFO ] Computed and/alt/rep : 952/7299/952 causal constraints in 83 ms.
[2021-05-18 02:48:45] [INFO ] Added : 240 causal constraints over 48 iterations in 2939 ms. Result :(error "Failed to check-sat")
[2021-05-18 02:48:45] [INFO ] [Real]Absence check using 201 positive place invariants in 138 ms returned sat
[2021-05-18 02:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:48:47] [INFO ] [Real]Absence check using state equation in 1635 ms returned sat
[2021-05-18 02:48:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:48:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 141 ms returned sat
[2021-05-18 02:48:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:48:49] [INFO ] [Nat]Absence check using state equation in 1605 ms returned sat
[2021-05-18 02:48:49] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2021-05-18 02:48:49] [INFO ] Deduced a trap composed of 7 places in 110 ms
[2021-05-18 02:48:49] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2021-05-18 02:48:50] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2021-05-18 02:48:50] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2021-05-18 02:48:50] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2021-05-18 02:48:50] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2021-05-18 02:48:50] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2021-05-18 02:48:50] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2021-05-18 02:48:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1121 ms
[2021-05-18 02:48:50] [INFO ] Computed and/alt/rep : 952/7299/952 causal constraints in 94 ms.
[2021-05-18 02:48:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t325 0) (and (or (and (> t300 0) (< o300 o325)) (and (> t675 0) (< o675 o325)) (and (> t676 0) (< o676 o325)) (and (> t677 0) (< o677 o325)) (and (> t678 0) (< o678 o325))) (or (and (> t673 0) (< o673 o325)) (and (> t674 0) (< o674 o325))) (or (and (> t266 0) (< o266 o325)) (and (> t267 0) (< o267 o325)) (and (> t684 0) (< o684 o325)) (and (> t686 0) (< o686 o325)) (and (> t728 0) (< o728 o325)) (and (> t729 0) (< o729 o325)))))") while checking expression at index 2
Incomplete Parikh walk after 88400 steps, including 324 resets, run finished after 623 ms. (steps per millisecond=141 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 24 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 98 place count 702 transition count 952
Applied a total of 98 rules in 238 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 1000000 steps, including 1725 resets, run finished after 6046 ms. (steps per millisecond=165 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 194 resets, run finished after 4185 ms. (steps per millisecond=238 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 171 resets, run finished after 4332 ms. (steps per millisecond=230 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2264890 steps, run timeout after 30001 ms. (steps per millisecond=75 ) properties seen :[0, 0]
Probabilistic random walk after 2264890 steps, saw 390676 distinct states, run finished after 30001 ms. (steps per millisecond=75 ) properties seen :[0, 0]
// Phase 1: matrix 952 rows 702 cols
[2021-05-18 02:49:38] [INFO ] Computed 201 place invariants in 14 ms
[2021-05-18 02:49:38] [INFO ] [Real]Absence check using 201 positive place invariants in 147 ms returned sat
[2021-05-18 02:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:49:40] [INFO ] [Real]Absence check using state equation in 1590 ms returned sat
[2021-05-18 02:49:40] [INFO ] Deduced a trap composed of 7 places in 161 ms
[2021-05-18 02:49:40] [INFO ] Deduced a trap composed of 7 places in 222 ms
[2021-05-18 02:49:40] [INFO ] Deduced a trap composed of 7 places in 203 ms
[2021-05-18 02:49:41] [INFO ] Deduced a trap composed of 9 places in 180 ms
[2021-05-18 02:49:41] [INFO ] Deduced a trap composed of 11 places in 225 ms
[2021-05-18 02:49:41] [INFO ] Deduced a trap composed of 11 places in 176 ms
[2021-05-18 02:49:41] [INFO ] Deduced a trap composed of 11 places in 147 ms
[2021-05-18 02:49:41] [INFO ] Deduced a trap composed of 7 places in 147 ms
[2021-05-18 02:49:42] [INFO ] Deduced a trap composed of 7 places in 141 ms
[2021-05-18 02:49:42] [INFO ] Deduced a trap composed of 9 places in 141 ms
[2021-05-18 02:49:42] [INFO ] Deduced a trap composed of 7 places in 152 ms
[2021-05-18 02:49:42] [INFO ] Deduced a trap composed of 11 places in 90 ms
[2021-05-18 02:49:42] [INFO ] Deduced a trap composed of 15 places in 62 ms
[2021-05-18 02:49:42] [INFO ] Deduced a trap composed of 9 places in 66 ms
[2021-05-18 02:49:43] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-18 02:49:43] [INFO ] Deduced a trap composed of 15 places in 62 ms
[2021-05-18 02:49:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3212 ms
[2021-05-18 02:49:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:49:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 215 ms returned sat
[2021-05-18 02:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:49:45] [INFO ] [Nat]Absence check using state equation in 1992 ms returned sat
[2021-05-18 02:49:45] [INFO ] Deduced a trap composed of 7 places in 89 ms
[2021-05-18 02:49:45] [INFO ] Deduced a trap composed of 7 places in 103 ms
[2021-05-18 02:49:46] [INFO ] Deduced a trap composed of 7 places in 115 ms
[2021-05-18 02:49:46] [INFO ] Deduced a trap composed of 7 places in 114 ms
[2021-05-18 02:49:46] [INFO ] Deduced a trap composed of 15 places in 109 ms
[2021-05-18 02:49:46] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2021-05-18 02:49:46] [INFO ] Deduced a trap composed of 7 places in 108 ms
[2021-05-18 02:49:46] [INFO ] Deduced a trap composed of 11 places in 99 ms
[2021-05-18 02:49:47] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2021-05-18 02:49:47] [INFO ] Deduced a trap composed of 7 places in 85 ms
[2021-05-18 02:49:47] [INFO ] Deduced a trap composed of 7 places in 32 ms
[2021-05-18 02:49:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1755 ms
[2021-05-18 02:49:47] [INFO ] Computed and/alt/rep : 951/8465/951 causal constraints in 126 ms.
[2021-05-18 02:50:08] [INFO ] Added : 560 causal constraints over 112 iterations in 20676 ms.(timeout) Result :sat
[2021-05-18 02:50:08] [INFO ] Deduced a trap composed of 7 places in 45 ms
[2021-05-18 02:50:08] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-18 02:50:08] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2021-05-18 02:50:09] [INFO ] Deduced a trap composed of 7 places in 19 ms
[2021-05-18 02:50:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1396 ms
Attempting to minimize the solution found.
Minimization took 204 ms.
[2021-05-18 02:50:10] [INFO ] [Real]Absence check using 201 positive place invariants in 214 ms returned sat
[2021-05-18 02:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:50:12] [INFO ] [Real]Absence check using state equation in 2034 ms returned sat
[2021-05-18 02:50:12] [INFO ] Deduced a trap composed of 11 places in 109 ms
[2021-05-18 02:50:12] [INFO ] Deduced a trap composed of 7 places in 97 ms
[2021-05-18 02:50:12] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2021-05-18 02:50:12] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2021-05-18 02:50:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
[2021-05-18 02:50:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:50:13] [INFO ] [Nat]Absence check using 201 positive place invariants in 158 ms returned sat
[2021-05-18 02:50:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:50:15] [INFO ] [Nat]Absence check using state equation in 1794 ms returned sat
[2021-05-18 02:50:15] [INFO ] Deduced a trap composed of 7 places in 290 ms
[2021-05-18 02:50:15] [INFO ] Deduced a trap composed of 7 places in 228 ms
[2021-05-18 02:50:16] [INFO ] Deduced a trap composed of 7 places in 184 ms
[2021-05-18 02:50:16] [INFO ] Deduced a trap composed of 7 places in 193 ms
[2021-05-18 02:50:16] [INFO ] Deduced a trap composed of 7 places in 150 ms
[2021-05-18 02:50:16] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2021-05-18 02:50:16] [INFO ] Deduced a trap composed of 7 places in 96 ms
[2021-05-18 02:50:16] [INFO ] Deduced a trap composed of 11 places in 72 ms
[2021-05-18 02:50:17] [INFO ] Deduced a trap composed of 12 places in 31 ms
[2021-05-18 02:50:17] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2021-05-18 02:50:17] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2021-05-18 02:50:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2177 ms
[2021-05-18 02:50:17] [INFO ] Computed and/alt/rep : 951/8465/951 causal constraints in 119 ms.
[2021-05-18 02:50:37] [INFO ] Added : 580 causal constraints over 116 iterations in 20540 ms.(timeout) Result :sat
[2021-05-18 02:50:38] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2021-05-18 02:50:38] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2021-05-18 02:50:39] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2021-05-18 02:50:39] [INFO ] Deduced a trap composed of 7 places in 89 ms
[2021-05-18 02:50:39] [INFO ] Deduced a trap composed of 12 places in 85 ms
[2021-05-18 02:50:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2371 ms
Attempting to minimize the solution found.
Minimization took 276 ms.
Incomplete Parikh walk after 124900 steps, including 539 resets, run finished after 1133 ms. (steps per millisecond=110 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 137100 steps, including 523 resets, run finished after 1137 ms. (steps per millisecond=120 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 65 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 41 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2021-05-18 02:50:43] [INFO ] Computed 201 place invariants in 7 ms
[2021-05-18 02:50:44] [INFO ] Implicit Places using invariants in 1570 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2021-05-18 02:50:44] [INFO ] Computed 201 place invariants in 18 ms
[2021-05-18 02:50:52] [INFO ] Implicit Places using invariants and state equation in 7795 ms returned []
Implicit Place search using SMT with State Equation took 9367 ms to find 0 implicit places.
[2021-05-18 02:50:53] [INFO ] Redundant transitions in 1071 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2021-05-18 02:50:53] [INFO ] Computed 201 place invariants in 10 ms
[2021-05-18 02:50:56] [INFO ] Dead Transitions using invariants and state equation in 2579 ms returned []
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Incomplete random walk after 100000 steps, including 172 resets, run finished after 783 ms. (steps per millisecond=127 ) properties seen :[0, 0]
// Phase 1: matrix 952 rows 702 cols
[2021-05-18 02:50:56] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-18 02:50:57] [INFO ] [Real]Absence check using 201 positive place invariants in 136 ms returned sat
[2021-05-18 02:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:50:58] [INFO ] [Real]Absence check using state equation in 1820 ms returned sat
[2021-05-18 02:50:59] [INFO ] Deduced a trap composed of 7 places in 183 ms
[2021-05-18 02:50:59] [INFO ] Deduced a trap composed of 7 places in 249 ms
[2021-05-18 02:50:59] [INFO ] Deduced a trap composed of 7 places in 240 ms
[2021-05-18 02:51:00] [INFO ] Deduced a trap composed of 9 places in 236 ms
[2021-05-18 02:51:00] [INFO ] Deduced a trap composed of 11 places in 195 ms
[2021-05-18 02:51:00] [INFO ] Deduced a trap composed of 11 places in 191 ms
[2021-05-18 02:51:00] [INFO ] Deduced a trap composed of 11 places in 189 ms
[2021-05-18 02:51:00] [INFO ] Deduced a trap composed of 7 places in 184 ms
[2021-05-18 02:51:01] [INFO ] Deduced a trap composed of 7 places in 186 ms
[2021-05-18 02:51:01] [INFO ] Deduced a trap composed of 9 places in 182 ms
[2021-05-18 02:51:01] [INFO ] Deduced a trap composed of 7 places in 181 ms
[2021-05-18 02:51:01] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2021-05-18 02:51:01] [INFO ] Deduced a trap composed of 15 places in 69 ms
[2021-05-18 02:51:02] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2021-05-18 02:51:02] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2021-05-18 02:51:02] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2021-05-18 02:51:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3390 ms
[2021-05-18 02:51:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:51:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 223 ms returned sat
[2021-05-18 02:51:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:51:04] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2021-05-18 02:51:04] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2021-05-18 02:51:04] [INFO ] Deduced a trap composed of 7 places in 68 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 7 places in 93 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 15 places in 107 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 7 places in 111 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 11 places in 99 ms
[2021-05-18 02:51:05] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2021-05-18 02:51:06] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2021-05-18 02:51:06] [INFO ] Deduced a trap composed of 7 places in 24 ms
[2021-05-18 02:51:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1396 ms
[2021-05-18 02:51:06] [INFO ] Computed and/alt/rep : 951/8465/951 causal constraints in 111 ms.
[2021-05-18 02:51:22] [INFO ] Added : 560 causal constraints over 112 iterations in 16210 ms. Result :unknown
[2021-05-18 02:51:22] [INFO ] [Real]Absence check using 201 positive place invariants in 142 ms returned sat
[2021-05-18 02:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:51:24] [INFO ] [Real]Absence check using state equation in 1626 ms returned sat
[2021-05-18 02:51:24] [INFO ] Deduced a trap composed of 11 places in 81 ms
[2021-05-18 02:51:24] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2021-05-18 02:51:24] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2021-05-18 02:51:24] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2021-05-18 02:51:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 458 ms
[2021-05-18 02:51:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:51:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 136 ms returned sat
[2021-05-18 02:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:51:26] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2021-05-18 02:51:26] [INFO ] Deduced a trap composed of 7 places in 230 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 7 places in 170 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 7 places in 144 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 7 places in 138 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 7 places in 118 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 12 places in 113 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 7 places in 70 ms
[2021-05-18 02:51:27] [INFO ] Deduced a trap composed of 11 places in 62 ms
[2021-05-18 02:51:28] [INFO ] Deduced a trap composed of 12 places in 23 ms
[2021-05-18 02:51:28] [INFO ] Deduced a trap composed of 11 places in 32 ms
[2021-05-18 02:51:28] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2021-05-18 02:51:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1547 ms
[2021-05-18 02:51:28] [INFO ] Computed and/alt/rep : 951/8465/951 causal constraints in 76 ms.
[2021-05-18 02:51:44] [INFO ] Added : 600 causal constraints over 120 iterations in 16614 ms. Result :(error "Solver has unexpectedly terminated")
Applied a total of 0 rules in 37 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2021-05-18 02:51:44] [INFO ] Computed 201 place invariants in 6 ms
[2021-05-18 02:51:45] [INFO ] [Real]Absence check using 201 positive place invariants in 142 ms returned sat
[2021-05-18 02:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:51:46] [INFO ] [Real]Absence check using state equation in 1608 ms returned sat
[2021-05-18 02:51:46] [INFO ] Deduced a trap composed of 7 places in 168 ms
[2021-05-18 02:51:47] [INFO ] Deduced a trap composed of 7 places in 161 ms
[2021-05-18 02:51:47] [INFO ] Deduced a trap composed of 7 places in 162 ms
[2021-05-18 02:51:47] [INFO ] Deduced a trap composed of 9 places in 162 ms
[2021-05-18 02:51:47] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2021-05-18 02:51:47] [INFO ] Deduced a trap composed of 11 places in 111 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 11 places in 130 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 7 places in 127 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 7 places in 122 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 9 places in 122 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 7 places in 123 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2021-05-18 02:51:48] [INFO ] Deduced a trap composed of 9 places in 51 ms
[2021-05-18 02:51:49] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2021-05-18 02:51:49] [INFO ] Deduced a trap composed of 15 places in 45 ms
[2021-05-18 02:51:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2384 ms
[2021-05-18 02:51:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:51:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 140 ms returned sat
[2021-05-18 02:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:51:51] [INFO ] [Nat]Absence check using state equation in 1651 ms returned sat
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 7 places in 69 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 7 places in 85 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 7 places in 75 ms
[2021-05-18 02:51:51] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2021-05-18 02:51:52] [INFO ] Deduced a trap composed of 7 places in 47 ms
[2021-05-18 02:51:52] [INFO ] Deduced a trap composed of 7 places in 42 ms
[2021-05-18 02:51:52] [INFO ] Deduced a trap composed of 7 places in 14 ms
[2021-05-18 02:51:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1128 ms
[2021-05-18 02:51:52] [INFO ] Computed and/alt/rep : 951/8465/951 causal constraints in 77 ms.
[2021-05-18 02:52:11] [INFO ] Added : 605 causal constraints over 121 iterations in 19629 ms. Result :sat
[2021-05-18 02:52:12] [INFO ] Deduced a trap composed of 7 places in 159 ms
[2021-05-18 02:52:12] [INFO ] Deduced a trap composed of 7 places in 159 ms
[2021-05-18 02:52:12] [INFO ] Deduced a trap composed of 7 places in 155 ms
[2021-05-18 02:52:13] [INFO ] Deduced a trap composed of 7 places in 152 ms
[2021-05-18 02:52:13] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2021-05-18 02:52:14] [INFO ] Deduced a trap composed of 14 places in 151 ms
[2021-05-18 02:52:14] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2021-05-18 02:52:14] [INFO ] Deduced a trap composed of 16 places in 122 ms
[2021-05-18 02:52:15] [INFO ] Deduced a trap composed of 7 places in 116 ms
[2021-05-18 02:52:15] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2021-05-18 02:52:15] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2021-05-18 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4220 ms
Attempting to minimize the solution found.
Minimization took 200 ms.
[2021-05-18 02:52:16] [INFO ] [Real]Absence check using 201 positive place invariants in 144 ms returned sat
[2021-05-18 02:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:52:18] [INFO ] [Real]Absence check using state equation in 1596 ms returned sat
[2021-05-18 02:52:18] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2021-05-18 02:52:18] [INFO ] Deduced a trap composed of 7 places in 68 ms
[2021-05-18 02:52:18] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2021-05-18 02:52:18] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2021-05-18 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 437 ms
[2021-05-18 02:52:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:52:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 144 ms returned sat
[2021-05-18 02:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:52:20] [INFO ] [Nat]Absence check using state equation in 1620 ms returned sat
[2021-05-18 02:52:20] [INFO ] Deduced a trap composed of 7 places in 222 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 7 places in 162 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 7 places in 120 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 7 places in 141 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 7 places in 118 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 12 places in 25 ms
[2021-05-18 02:52:21] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2021-05-18 02:52:22] [INFO ] Deduced a trap composed of 15 places in 29 ms
[2021-05-18 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1498 ms
[2021-05-18 02:52:22] [INFO ] Computed and/alt/rep : 951/8465/951 causal constraints in 71 ms.
[2021-05-18 02:52:42] [INFO ] Added : 615 causal constraints over 123 iterations in 20172 ms.(timeout) Result :sat
[2021-05-18 02:52:42] [INFO ] Deduced a trap composed of 9 places in 96 ms
[2021-05-18 02:52:42] [INFO ] Deduced a trap composed of 7 places in 93 ms
[2021-05-18 02:52:43] [INFO ] Deduced a trap composed of 7 places in 96 ms
[2021-05-18 02:52:43] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2021-05-18 02:52:43] [INFO ] Deduced a trap composed of 7 places in 99 ms
[2021-05-18 02:52:43] [INFO ] Deduced a trap composed of 7 places in 75 ms
[2021-05-18 02:52:44] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2021-05-18 02:52:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2096 ms
Attempting to minimize the solution found.
Minimization took 143 ms.
[2021-05-18 02:52:44] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2021-05-18 02:52:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 25 ms.
[2021-05-18 02:52:45] [INFO ] Flatten gal took : 303 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-050A @ 3570 seconds

FORMULA ShieldRVs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-050A-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3524
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-050A

{
"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",
"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:52:46 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p108) AND (1 <= p114) AND (1 <= p121) AND ((p655 <= 0)) AND (1 <= p402) AND (1 <= p406) AND (1 <= p415) AND ((p185 <= 0) OR (p200 <= 0) OR (p212 <= 0)))))",
"processed_size": 169,
"rewrites": 1
},
"result":
{
"edges": 118,
"markings": 119,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p619) OR (p619 <= 0) OR (p634 <= 0) OR (p646 <= 0) OR (p418 <= 0) OR (p420 <= 0) OR (2 <= p429) OR (p429 <= 0) OR ((1 <= p106) AND (1 <= p111)) OR (((p390 <= 0) OR (p392 <= 0) OR (p401 <= 0)) AND ((p500 <= 0) OR (p504 <= 0) OR (p513 <= 0))))))",
"processed_size": 269,
"rewrites": 2
},
"result":
{
"edges": 66,
"markings": 67,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 48,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 36728,
"runtime": 46.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 4790,
"conflict_clusters": 52,
"places": 702,
"places_significant": 501,
"singleton_clusters": 0,
"transitions": 952
},
"result":
{
"preliminary_value": "yes no ",
"value": "yes no "
},
"task":
{
"type": "compound"
}
}
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: 1654/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 702
lola: finding significant places
lola: 702 places, 952 transitions, 501 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: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p655 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p634 <= 1)
lola: LP says that atomic proposition is always true: (p646 <= 1)
lola: LP says that atomic proposition is always true: (p418 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p500 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p513 <= 1)
lola: E (F (((1 <= p108) AND (1 <= p114) AND (1 <= p121) AND ((p655 <= 0)) AND (1 <= p402) AND (1 <= p406) AND (1 <= p415) AND ((p185 <= 0) OR (p200 <= 0) OR (p212 <= 0))))) : A (G (((2 <= p619) OR (p619 <= 0) OR (p634 <= 0) OR (p646 <= 0) OR (p418 <= 0) OR (p420 <= 0) OR (2 <= p429) OR (p429 <= 0) OR ((1 <= p106) AND (1 <= p111)) OR (((p390 <= 0) OR (p392 <= 0) OR (p401 <= 0)) AND ((p500 <= 0) OR (p504 <= 0) OR (p513 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p108) AND (1 <= p114) AND (1 <= p121) AND ((p655 <= 0)) AND (1 <= p402) AND (1 <= p406) AND (1 <= p415) AND ((p185 <= 0) OR (p200 <= 0) OR (p212 <= 0)))))
lola: ========================================
lola: SUBTASK
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 <= p108) AND (1 <= p114) AND (1 <= p121) AND ((p655 <= 0)) AND (1 <= p402) AND (1 <= p406) AND (1 <= p415) AND ((p185 <= 0) OR (p200 <= 0) OR (p212 <= 0)))))
lola: processed formula length: 169
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: 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 <= p108) AND (1 <= p114) AND (1 <= p121) AND ((p655 <= 0)) AND (1 <= p402) AND (1 <= p406) AND (1 <= p415) AND ((p185 <= 0) OR (p200 <= 0) OR (p212 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 119 markings, 118 edges
lola: ========================================
lola: subprocess 1 will run for 3524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p619) OR (p619 <= 0) OR (p634 <= 0) OR (p646 <= 0) OR (p418 <= 0) OR (p420 <= 0) OR (2 <= p429) OR (p429 <= 0) OR ((1 <= p106) AND (1 <= p111)) OR (((p390 <= 0) OR (p392 <= 0) OR (p401 <= 0)) AND ((p500 <= 0) OR (p504 <= 0) OR (p513 <= 0))))))
lola: ========================================
lola: SUBTASK
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 (((2 <= p619) OR (p619 <= 0) OR (p634 <= 0) OR (p646 <= 0) OR (p418 <= 0) OR (p420 <= 0) OR (2 <= p429) OR (p429 <= 0) OR ((1 <= p106) AND (1 <= p111)) OR (((p390 <= 0) OR (p392 <= 0) OR (p401 <= 0)) AND ((p500 <= 0) OR (p504 <= 0) OR (p513 <= 0))))))
lola: processed formula length: 269
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p619 <= 1) AND (1 <= p619) AND (1 <= p634) AND (1 <= p646) AND (1 <= p418) AND (1 <= p420) AND (p429 <= 1) AND (1 <= p429) AND ((p106 <= 0) OR (p111 <= 0)) AND (((1 <= p390) AND (1 <= p392) AND (1 <= p401)) OR ((1 <= p500) AND (1 <= p504) AND (1 <= p513))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 36728 KB
lola: time consumption: 46 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050A"
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-050A, 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-162106594200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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