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-162098231000216.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 ShieldIIPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231000216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 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 167K 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 ShieldIIPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621145279402

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 06:08:01] [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 06:08:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 06:08:01] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2021-05-16 06:08:01] [INFO ] Transformed 703 places.
[2021-05-16 06:08:01] [INFO ] Transformed 653 transitions.
[2021-05-16 06:08:01] [INFO ] Found NUPN structural information;
[2021-05-16 06:08:01] [INFO ] Parsed PT model containing 703 places and 653 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=117 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 FALSE 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 :[1, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 653 rows 703 cols
[2021-05-16 06:08:01] [INFO ] Computed 91 place invariants in 17 ms
[2021-05-16 06:08:02] [INFO ] [Real]Absence check using 91 positive place invariants in 65 ms returned sat
[2021-05-16 06:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:02] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2021-05-16 06:08:03] [INFO ] Deduced a trap composed of 13 places in 281 ms
[2021-05-16 06:08:03] [INFO ] Deduced a trap composed of 17 places in 214 ms
[2021-05-16 06:08:03] [INFO ] Deduced a trap composed of 21 places in 198 ms
[2021-05-16 06:08:04] [INFO ] Deduced a trap composed of 26 places in 198 ms
[2021-05-16 06:08:04] [INFO ] Deduced a trap composed of 20 places in 196 ms
[2021-05-16 06:08:04] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2021-05-16 06:08:04] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2021-05-16 06:08:04] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2021-05-16 06:08:04] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 19 places in 124 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 21 places in 123 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 31 places in 106 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 24 places in 104 ms
[2021-05-16 06:08:05] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 22 places in 113 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 26 places in 102 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2021-05-16 06:08:06] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2021-05-16 06:08:06] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3838 ms
[2021-05-16 06:08:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:08:07] [INFO ] [Nat]Absence check using 91 positive place invariants in 80 ms returned sat
[2021-05-16 06:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:07] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2021-05-16 06:08:08] [INFO ] Deduced a trap composed of 23 places in 223 ms
[2021-05-16 06:08:08] [INFO ] Deduced a trap composed of 23 places in 215 ms
[2021-05-16 06:08:08] [INFO ] Deduced a trap composed of 23 places in 186 ms
[2021-05-16 06:08:08] [INFO ] Deduced a trap composed of 17 places in 166 ms
[2021-05-16 06:08:09] [INFO ] Deduced a trap composed of 24 places in 167 ms
[2021-05-16 06:08:09] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2021-05-16 06:08:09] [INFO ] Deduced a trap composed of 17 places in 154 ms
[2021-05-16 06:08:09] [INFO ] Deduced a trap composed of 17 places in 155 ms
[2021-05-16 06:08:09] [INFO ] Deduced a trap composed of 29 places in 158 ms
[2021-05-16 06:08:09] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 21 places in 137 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 21 places in 133 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 24 places in 126 ms
[2021-05-16 06:08:10] [INFO ] Deduced a trap composed of 23 places in 118 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 21 places in 112 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 24 places in 120 ms
[2021-05-16 06:08:11] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2021-05-16 06:08:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s496 s497 s498 s499 s500 s501 s502 s503 s504 s555 s556 s557 s558 s559 s560 s561 s562 s563) 0)") while checking expression at index 0
[2021-05-16 06:08:12] [INFO ] [Real]Absence check using 91 positive place invariants in 69 ms returned sat
[2021-05-16 06:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:13] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2021-05-16 06:08:13] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2021-05-16 06:08:13] [INFO ] Deduced a trap composed of 17 places in 176 ms
[2021-05-16 06:08:13] [INFO ] Deduced a trap composed of 17 places in 157 ms
[2021-05-16 06:08:13] [INFO ] Deduced a trap composed of 19 places in 147 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 32 places in 138 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 15 places in 134 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 26 places in 134 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 20 places in 117 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 20 places in 122 ms
[2021-05-16 06:08:14] [INFO ] Deduced a trap composed of 30 places in 112 ms
[2021-05-16 06:08:15] [INFO ] Deduced a trap composed of 22 places in 107 ms
[2021-05-16 06:08:15] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2021-05-16 06:08:15] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2021-05-16 06:08:15] [INFO ] Deduced a trap composed of 21 places in 101 ms
[2021-05-16 06:08:15] [INFO ] Deduced a trap composed of 27 places in 88 ms
[2021-05-16 06:08:15] [INFO ] Deduced a trap composed of 46 places in 86 ms
[2021-05-16 06:08:15] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2554 ms
[2021-05-16 06:08:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:08:15] [INFO ] [Nat]Absence check using 91 positive place invariants in 71 ms returned sat
[2021-05-16 06:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:16] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2021-05-16 06:08:16] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2021-05-16 06:08:17] [INFO ] Deduced a trap composed of 21 places in 175 ms
[2021-05-16 06:08:17] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2021-05-16 06:08:17] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2021-05-16 06:08:17] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2021-05-16 06:08:17] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 17 places in 134 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 25 places in 134 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 25 places in 138 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 23 places in 113 ms
[2021-05-16 06:08:18] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 24 places in 97 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 28 places in 93 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 29 places in 78 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2021-05-16 06:08:19] [INFO ] Deduced a trap composed of 24 places in 65 ms
[2021-05-16 06:08:19] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2864 ms
[2021-05-16 06:08:19] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 35 ms.
[2021-05-16 06:08:20] [INFO ] Added : 165 causal constraints over 33 iterations in 1075 ms. Result :(error "Failed to check-sat")
[2021-05-16 06:08:20] [INFO ] [Real]Absence check using 91 positive place invariants in 66 ms returned sat
[2021-05-16 06:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:21] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2021-05-16 06:08:22] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2021-05-16 06:08:22] [INFO ] Deduced a trap composed of 28 places in 208 ms
[2021-05-16 06:08:22] [INFO ] Deduced a trap composed of 25 places in 196 ms
[2021-05-16 06:08:22] [INFO ] Deduced a trap composed of 19 places in 194 ms
[2021-05-16 06:08:22] [INFO ] Deduced a trap composed of 32 places in 174 ms
[2021-05-16 06:08:23] [INFO ] Deduced a trap composed of 42 places in 165 ms
[2021-05-16 06:08:23] [INFO ] Deduced a trap composed of 42 places in 145 ms
[2021-05-16 06:08:23] [INFO ] Deduced a trap composed of 32 places in 147 ms
[2021-05-16 06:08:23] [INFO ] Deduced a trap composed of 18 places in 143 ms
[2021-05-16 06:08:23] [INFO ] Deduced a trap composed of 18 places in 140 ms
[2021-05-16 06:08:23] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 24 places in 132 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 15 places in 139 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 19 places in 127 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 21 places in 131 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 23 places in 116 ms
[2021-05-16 06:08:24] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 32 places in 108 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 24 places in 95 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2021-05-16 06:08:25] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2021-05-16 06:08:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s82 s83 s84 s85 s86 s93 s94 s95 s96 s97 s100 s101 s102 s106 s115 s116 s117) 0)") while checking expression at index 2
[2021-05-16 06:08:25] [INFO ] [Real]Absence check using 91 positive place invariants in 58 ms returned sat
[2021-05-16 06:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:26] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2021-05-16 06:08:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:08:26] [INFO ] [Nat]Absence check using 91 positive place invariants in 62 ms returned sat
[2021-05-16 06:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:27] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 23 places in 150 ms
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 24 places in 140 ms
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2021-05-16 06:08:28] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2021-05-16 06:08:29] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2021-05-16 06:08:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1266 ms
[2021-05-16 06:08:29] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 32 ms.
[2021-05-16 06:08:31] [INFO ] Added : 445 causal constraints over 89 iterations in 2704 ms. Result :(error "Failed to check-sat")
Support contains 30 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 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 703 transition count 497
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 314 place count 547 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 546 transition count 495
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 315 place count 546 transition count 451
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 403 place count 502 transition count 451
Symmetric choice reduction at 3 with 64 rule applications. Total rules 467 place count 502 transition count 451
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 595 place count 438 transition count 387
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 595 place count 438 transition count 360
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 649 place count 411 transition count 360
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 953 place count 259 transition count 208
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1003 place count 234 transition count 222
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1004 place count 234 transition count 221
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1005 place count 234 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1006 place count 233 transition count 220
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1016 place count 233 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1017 place count 232 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1019 place count 230 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1019 place count 230 transition count 218
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1021 place count 229 transition count 218
Applied a total of 1021 rules in 244 ms. Remains 229 /703 variables (removed 474) and now considering 218/653 (removed 435) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/703 places, 218/653 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3559 ms. (steps per millisecond=280 ) properties seen :[1, 0, 0, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties seen :[1, 0, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1589 ms. (steps per millisecond=629 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1717 ms. (steps per millisecond=582 ) properties seen :[0, 0]
// Phase 1: matrix 218 rows 229 cols
[2021-05-16 06:08:40] [INFO ] Computed 89 place invariants in 2 ms
[2021-05-16 06:08:40] [INFO ] [Real]Absence check using 89 positive place invariants in 26 ms returned sat
[2021-05-16 06:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:40] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-16 06:08:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2021-05-16 06:08:40] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2021-05-16 06:08:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:08:40] [INFO ] [Nat]Absence check using 89 positive place invariants in 27 ms returned sat
[2021-05-16 06:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:41] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-16 06:08:41] [INFO ] [Nat]Added 24 Read/Feed constraints in 5 ms returned sat
[2021-05-16 06:08:41] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2021-05-16 06:08:41] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2021-05-16 06:08:41] [INFO ] Deduced a trap composed of 3 places in 15 ms
[2021-05-16 06:08:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 81 ms
[2021-05-16 06:08:41] [INFO ] Computed and/alt/rep : 206/536/206 causal constraints in 11 ms.
[2021-05-16 06:08:44] [INFO ] Added : 193 causal constraints over 40 iterations in 2976 ms. Result :unsat
[2021-05-16 06:08:44] [INFO ] [Real]Absence check using 89 positive place invariants in 26 ms returned sat
[2021-05-16 06:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:44] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-16 06:08:44] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2021-05-16 06:08:44] [INFO ] Computed and/alt/rep : 206/536/206 causal constraints in 11 ms.
[2021-05-16 06:08:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:08:44] [INFO ] [Nat]Absence check using 89 positive place invariants in 27 ms returned sat
[2021-05-16 06:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:08:44] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-16 06:08:44] [INFO ] [Nat]Added 24 Read/Feed constraints in 5 ms returned sat
[2021-05-16 06:08:44] [INFO ] Computed and/alt/rep : 206/536/206 causal constraints in 11 ms.
[2021-05-16 06:08:45] [INFO ] Added : 188 causal constraints over 39 iterations in 556 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 33500 steps, including 311 resets, run finished after 164 ms. (steps per millisecond=204 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 218/218 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 229 transition count 214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 225 transition count 214
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 225 transition count 210
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 221 transition count 210
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 221 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 220 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 220 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 219 transition count 208
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 37 place count 211 transition count 200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 207 transition count 203
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 207 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 206 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 205 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 204 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 203 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 202 transition count 198
Applied a total of 51 rules in 58 ms. Remains 202 /229 variables (removed 27) and now considering 198/218 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/229 places, 198/218 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3410 ms. (steps per millisecond=293 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties seen :[0]
Interrupted probabilistic random walk after 12625126 steps, run timeout after 30001 ms. (steps per millisecond=420 ) properties seen :[0]
Probabilistic random walk after 12625126 steps, saw 1727630 distinct states, run finished after 30001 ms. (steps per millisecond=420 ) properties seen :[0]
// Phase 1: matrix 198 rows 202 cols
[2021-05-16 06:09:20] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-16 06:09:20] [INFO ] [Real]Absence check using 89 positive place invariants in 28 ms returned sat
[2021-05-16 06:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:20] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-16 06:09:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-16 06:09:20] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2021-05-16 06:09:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:20] [INFO ] [Nat]Absence check using 89 positive place invariants in 25 ms returned sat
[2021-05-16 06:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:20] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-16 06:09:20] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2021-05-16 06:09:20] [INFO ] Deduced a trap composed of 3 places in 19 ms
[2021-05-16 06:09:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-16 06:09:20] [INFO ] Computed and/alt/rep : 190/466/190 causal constraints in 10 ms.
[2021-05-16 06:09:21] [INFO ] Added : 168 causal constraints over 35 iterations in 404 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Finished Parikh walk after 10366 steps, including 50 resets, run visited all 1 properties in 42 ms. (steps per millisecond=246 )
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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