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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.4K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 12:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 12:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 528K 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 ShieldPPPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621168627091

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 12:37:08] [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-16 12:37:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:37:08] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2021-05-16 12:37:09] [INFO ] Transformed 2043 places.
[2021-05-16 12:37:09] [INFO ] Transformed 1893 transitions.
[2021-05-16 12:37:09] [INFO ] Found NUPN structural information;
[2021-05-16 12:37:09] [INFO ] Parsed PT model containing 2043 places and 1893 transitions in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 58 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[1, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0]
// Phase 1: matrix 1893 rows 2043 cols
[2021-05-16 12:37:09] [INFO ] Computed 331 place invariants in 66 ms
[2021-05-16 12:37:10] [INFO ] [Real]Absence check using 331 positive place invariants in 385 ms returned sat
[2021-05-16 12:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:37:14] [INFO ] [Real]Absence check using state equation in 4269 ms returned (error "Solver has unexpectedly terminated")
Support contains 9 out of 2043 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 2043 transition count 1682
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1832 transition count 1682
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1832 transition count 1532
Deduced a syphon composed of 150 places in 6 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1682 transition count 1532
Symmetric choice reduction at 2 with 209 rule applications. Total rules 931 place count 1682 transition count 1532
Deduced a syphon composed of 209 places in 9 ms
Reduce places removed 209 places and 209 transitions.
Iterating global reduction 2 with 418 rules applied. Total rules applied 1349 place count 1473 transition count 1323
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 1349 place count 1473 transition count 1234
Deduced a syphon composed of 89 places in 7 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1527 place count 1384 transition count 1234
Performed 444 Post agglomeration using F-continuation condition.Transition count delta: 444
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 2 with 888 rules applied. Total rules applied 2415 place count 940 transition count 790
Partial Free-agglomeration rule applied 264 times.
Drop transitions removed 264 transitions
Iterating global reduction 2 with 264 rules applied. Total rules applied 2679 place count 940 transition count 790
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2681 place count 940 transition count 790
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2682 place count 939 transition count 789
Applied a total of 2682 rules in 1092 ms. Remains 939 /2043 variables (removed 1104) and now considering 789/1893 (removed 1104) transitions.
Finished structural reductions, in 1 iterations. Remains : 939/2043 places, 789/1893 transitions.
Incomplete random walk after 1000000 steps, including 194 resets, run finished after 9109 ms. (steps per millisecond=109 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 4458 ms. (steps per millisecond=224 ) properties seen :[0]
Interrupted probabilistic random walk after 2787315 steps, run timeout after 30001 ms. (steps per millisecond=92 ) properties seen :[0]
Probabilistic random walk after 2787315 steps, saw 133866 distinct states, run finished after 30001 ms. (steps per millisecond=92 ) properties seen :[0]
// Phase 1: matrix 789 rows 939 cols
[2021-05-16 12:37:59] [INFO ] Computed 331 place invariants in 32 ms
[2021-05-16 12:37:59] [INFO ] [Real]Absence check using 315 positive place invariants in 172 ms returned sat
[2021-05-16 12:37:59] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 9 ms returned sat
[2021-05-16 12:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:38:01] [INFO ] [Real]Absence check using state equation in 1651 ms returned sat
[2021-05-16 12:38:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:38:01] [INFO ] [Nat]Absence check using 315 positive place invariants in 205 ms returned sat
[2021-05-16 12:38:01] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2021-05-16 12:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:38:03] [INFO ] [Nat]Absence check using state equation in 1680 ms returned sat
[2021-05-16 12:38:03] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2021-05-16 12:38:03] [INFO ] Deduced a trap composed of 5 places in 228 ms
[2021-05-16 12:38:04] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2021-05-16 12:38:04] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2021-05-16 12:38:04] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2021-05-16 12:38:04] [INFO ] Deduced a trap composed of 8 places in 219 ms
[2021-05-16 12:38:05] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2021-05-16 12:38:05] [INFO ] Deduced a trap composed of 4 places in 209 ms
[2021-05-16 12:38:05] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2021-05-16 12:38:05] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2021-05-16 12:38:05] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2021-05-16 12:38:06] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2021-05-16 12:38:06] [INFO ] Deduced a trap composed of 8 places in 182 ms
[2021-05-16 12:38:06] [INFO ] Deduced a trap composed of 8 places in 171 ms
[2021-05-16 12:38:06] [INFO ] Deduced a trap composed of 8 places in 162 ms
[2021-05-16 12:38:06] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2021-05-16 12:38:07] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2021-05-16 12:38:07] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2021-05-16 12:38:07] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2021-05-16 12:38:07] [INFO ] Deduced a trap composed of 6 places in 169 ms
[2021-05-16 12:38:07] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 8 places in 109 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 10 places in 90 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2021-05-16 12:38:08] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2021-05-16 12:38:09] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2021-05-16 12:38:09] [INFO ] Deduced a trap composed of 19 places in 85 ms
[2021-05-16 12:38:09] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2021-05-16 12:38:09] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6107 ms
[2021-05-16 12:38:09] [INFO ] Computed and/alt/rep : 785/3215/785 causal constraints in 50 ms.
[2021-05-16 12:38:29] [INFO ] Added : 732 causal constraints over 147 iterations in 20423 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
Incomplete Parikh walk after 53600 steps, including 768 resets, run finished after 446 ms. (steps per millisecond=120 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 939 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 939/939 places, 789/789 transitions.
Applied a total of 0 rules in 24 ms. Remains 939 /939 variables (removed 0) and now considering 789/789 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 939/939 places, 789/789 transitions.
Starting structural reductions, iteration 0 : 939/939 places, 789/789 transitions.
Applied a total of 0 rules in 23 ms. Remains 939 /939 variables (removed 0) and now considering 789/789 (removed 0) transitions.
// Phase 1: matrix 789 rows 939 cols
[2021-05-16 12:38:30] [INFO ] Computed 331 place invariants in 24 ms
[2021-05-16 12:38:32] [INFO ] Implicit Places using invariants in 2338 ms returned []
// Phase 1: matrix 789 rows 939 cols
[2021-05-16 12:38:32] [INFO ] Computed 331 place invariants in 19 ms
[2021-05-16 12:38:41] [INFO ] Implicit Places using invariants and state equation in 9271 ms returned []
Implicit Place search using SMT with State Equation took 11615 ms to find 0 implicit places.
[2021-05-16 12:38:42] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 789 rows 939 cols
[2021-05-16 12:38:42] [INFO ] Computed 331 place invariants in 7 ms
[2021-05-16 12:38:43] [INFO ] Dead Transitions using invariants and state equation in 1918 ms returned []
Finished structural reductions, in 1 iterations. Remains : 939/939 places, 789/789 transitions.
Incomplete random walk after 100000 steps, including 19 resets, run finished after 899 ms. (steps per millisecond=111 ) properties seen :[0]
// Phase 1: matrix 789 rows 939 cols
[2021-05-16 12:38:44] [INFO ] Computed 331 place invariants in 7 ms
[2021-05-16 12:38:45] [INFO ] [Real]Absence check using 315 positive place invariants in 184 ms returned sat
[2021-05-16 12:38:45] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2021-05-16 12:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:38:46] [INFO ] [Real]Absence check using state equation in 1672 ms returned sat
[2021-05-16 12:38:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:38:47] [INFO ] [Nat]Absence check using 315 positive place invariants in 176 ms returned sat
[2021-05-16 12:38:47] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2021-05-16 12:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:38:48] [INFO ] [Nat]Absence check using state equation in 1693 ms returned sat
[2021-05-16 12:38:49] [INFO ] Deduced a trap composed of 5 places in 218 ms
[2021-05-16 12:38:49] [INFO ] Deduced a trap composed of 5 places in 216 ms
[2021-05-16 12:38:49] [INFO ] Deduced a trap composed of 4 places in 222 ms
[2021-05-16 12:38:49] [INFO ] Deduced a trap composed of 6 places in 216 ms
[2021-05-16 12:38:50] [INFO ] Deduced a trap composed of 4 places in 211 ms
[2021-05-16 12:38:50] [INFO ] Deduced a trap composed of 8 places in 203 ms
[2021-05-16 12:38:50] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2021-05-16 12:38:50] [INFO ] Deduced a trap composed of 4 places in 205 ms
[2021-05-16 12:38:51] [INFO ] Deduced a trap composed of 6 places in 234 ms
[2021-05-16 12:38:51] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2021-05-16 12:38:51] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2021-05-16 12:38:51] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2021-05-16 12:38:52] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2021-05-16 12:38:52] [INFO ] Deduced a trap composed of 8 places in 181 ms
[2021-05-16 12:38:52] [INFO ] Deduced a trap composed of 8 places in 162 ms
[2021-05-16 12:38:52] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2021-05-16 12:38:52] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2021-05-16 12:38:52] [INFO ] Deduced a trap composed of 20 places in 130 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 9 places in 121 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2021-05-16 12:38:53] [INFO ] Deduced a trap composed of 10 places in 88 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2021-05-16 12:38:54] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2021-05-16 12:38:54] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5857 ms
[2021-05-16 12:38:54] [INFO ] Computed and/alt/rep : 785/3215/785 causal constraints in 55 ms.
[2021-05-16 12:39:06] [INFO ] Added : 640 causal constraints over 128 iterations in 12124 ms. Result :unknown
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 939 transition count 789
Applied a total of 2 rules in 59 ms. Remains 939 /939 variables (removed 0) and now considering 789/789 (removed 0) transitions.
// Phase 1: matrix 789 rows 939 cols
[2021-05-16 12:39:06] [INFO ] Computed 331 place invariants in 7 ms
[2021-05-16 12:39:07] [INFO ] [Real]Absence check using 316 positive place invariants in 170 ms returned sat
[2021-05-16 12:39:07] [INFO ] [Real]Absence check using 316 positive and 15 generalized place invariants in 9 ms returned sat
[2021-05-16 12:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:39:09] [INFO ] [Real]Absence check using state equation in 1700 ms returned sat
[2021-05-16 12:39:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:39:09] [INFO ] [Nat]Absence check using 316 positive place invariants in 177 ms returned sat
[2021-05-16 12:39:09] [INFO ] [Nat]Absence check using 316 positive and 15 generalized place invariants in 9 ms returned sat
[2021-05-16 12:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:39:11] [INFO ] [Nat]Absence check using state equation in 1732 ms returned sat
[2021-05-16 12:39:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 12:39:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2021-05-16 12:39:11] [INFO ] Deduced a trap composed of 5 places in 161 ms
[2021-05-16 12:39:11] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2021-05-16 12:39:11] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2021-05-16 12:39:11] [INFO ] Deduced a trap composed of 5 places in 134 ms
[2021-05-16 12:39:11] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2021-05-16 12:39:12] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2021-05-16 12:39:12] [INFO ] Deduced a trap composed of 9 places in 140 ms
[2021-05-16 12:39:12] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2021-05-16 12:39:12] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2021-05-16 12:39:12] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2021-05-16 12:39:12] [INFO ] Deduced a trap composed of 8 places in 131 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 7 places in 115 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2021-05-16 12:39:13] [INFO ] Deduced a trap composed of 7 places in 103 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 8 places in 103 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 6 places in 103 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2021-05-16 12:39:14] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 10 places in 67 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 10 places in 48 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2021-05-16 12:39:15] [INFO ] Deduced a trap composed of 8 places in 73 ms
[2021-05-16 12:39:15] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4534 ms
[2021-05-16 12:39:15] [INFO ] Computed and/alt/rep : 785/3224/785 causal constraints in 51 ms.
[2021-05-16 12:39:36] [INFO ] Added : 729 causal constraints over 146 iterations in 20582 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 68 ms.
[2021-05-16 12:39:36] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 1 ms.
[2021-05-16 12:39:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 32 ms.
[2021-05-16 12:39:36] [INFO ] Flatten gal took : 133 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-030B @ 3570 seconds
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ ShieldPPPs-PT-030B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 12:39:37 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 25172,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p626) AND (1 <= p503) AND (1 <= p91) AND ((p723 <= 0)) AND ((p205 <= 0) OR (p221 <= 0)) AND (((1 <= p147)) OR ((1 <= p672)) OR ((1 <= p1))))))",
"processed_size": 158,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3668,
"conflict_clusters": 161,
"places": 939,
"places_significant": 608,
"singleton_clusters": 0,
"transitions": 789
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 36,
"problems": 6
},
"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: 1728/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 939
lola: finding significant places
lola: 939 places, 789 transitions, 608 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: (p626 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p723 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p672 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: E (F (((1 <= p626) AND (1 <= p503) AND (1 <= p91) AND ((p723 <= 0)) AND ((p205 <= 0) OR (p221 <= 0)) AND (((1 <= p147)) OR ((1 <= p672)) OR ((1 <= p1))))))
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 <= p626) AND (1 <= p503) AND (1 <= p91) AND ((p723 <= 0)) AND ((p205 <= 0) OR (p221 <= 0)) AND (((1 <= p147)) OR ((1 <= p672)) OR ((1 <= p1))))))
lola: processed formula length: 158
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: 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 <= p626) AND (1 <= p503) AND (1 <= p91) AND ((p723 <= 0)) AND ((p205 <= 0) OR (p221 <= 0)) AND (((1 <= p147)) OR ((1 <= p672)) OR ((1 <= p1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 6 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 25172 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
sara: try reading problem file ReachabilityFireability-0.sara.
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="ShieldPPPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ShieldPPPs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098231200320"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;