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.r075-tall-162039097100039.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 DES-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 5 16:58 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.2K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 79K May 5 16:51 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 DES-PT-10b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620506086114

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:34:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 20:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:34:47] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-08 20:34:47] [INFO ] Transformed 320 places.
[2021-05-08 20:34:47] [INFO ] Transformed 271 transitions.
[2021-05-08 20:34:47] [INFO ] Found NUPN structural information;
[2021-05-08 20:34:47] [INFO ] Parsed PT model containing 320 places and 271 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1]
FORMULA DES-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 1, 0]
FORMULA DES-PT-10b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 271 rows 320 cols
[2021-05-08 20:34:48] [INFO ] Computed 65 place invariants in 19 ms
[2021-05-08 20:34:48] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 20:34:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2021-05-08 20:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:34:48] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2021-05-08 20:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:34:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2021-05-08 20:34:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2021-05-08 20:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:34:49] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2021-05-08 20:34:49] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2021-05-08 20:34:49] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2021-05-08 20:34:49] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-08 20:34:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 264 ms
[2021-05-08 20:34:49] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 15 ms.
[2021-05-08 20:34:50] [INFO ] Added : 257 causal constraints over 52 iterations in 1266 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-08 20:34:50] [INFO ] [Real]Absence check using 39 positive place invariants in 27 ms returned sat
[2021-05-08 20:34:50] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2021-05-08 20:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:34:50] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2021-05-08 20:34:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:34:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2021-05-08 20:34:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2021-05-08 20:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:34:51] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-08 20:34:51] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2021-05-08 20:34:51] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2021-05-08 20:34:51] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2021-05-08 20:34:51] [INFO ] Deduced a trap composed of 17 places in 33 ms
[2021-05-08 20:34:51] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2021-05-08 20:34:51] [INFO ] Deduced a trap composed of 14 places in 45 ms
[2021-05-08 20:34:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 292 ms
[2021-05-08 20:34:51] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 17 ms.
[2021-05-08 20:34:52] [INFO ] Added : 240 causal constraints over 49 iterations in 1078 ms. Result :sat
[2021-05-08 20:34:52] [INFO ] Deduced a trap composed of 55 places in 100 ms
[2021-05-08 20:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 85600 steps, including 910 resets, run finished after 307 ms. (steps per millisecond=278 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 117900 steps, including 1288 resets, run finished after 323 ms. (steps per millisecond=365 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 271/271 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 309 transition count 243
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 288 transition count 243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 45 place count 288 transition count 235
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 61 place count 280 transition count 235
Symmetric choice reduction at 2 with 19 rule applications. Total rules 80 place count 280 transition count 235
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 118 place count 261 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 261 transition count 215
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 260 transition count 215
Symmetric choice reduction at 2 with 15 rule applications. Total rules 135 place count 260 transition count 215
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 245 transition count 200
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 180 place count 245 transition count 185
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 183 place count 243 transition count 184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 183 place count 243 transition count 181
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 189 place count 240 transition count 181
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 335 place count 167 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 339 place count 165 transition count 110
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 164 transition count 109
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 164 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 343 place count 163 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 162 transition count 108
Applied a total of 344 rules in 108 ms. Remains 162 /320 variables (removed 158) and now considering 108/271 (removed 163) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/320 places, 108/271 transitions.
Incomplete random walk after 1000000 steps, including 42712 resets, run finished after 2921 ms. (steps per millisecond=342 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7140 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties seen :[0, 1]
FORMULA DES-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 108 rows 162 cols
[2021-05-08 20:34:57] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 20:34:57] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:34:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:34:57] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-08 20:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:34:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:34:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 20:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:34:58] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-08 20:34:58] [INFO ] Deduced a trap composed of 10 places in 18 ms
[2021-05-08 20:34:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-08 20:34:58] [INFO ] Computed and/alt/rep : 103/341/103 causal constraints in 6 ms.
[2021-05-08 20:34:58] [INFO ] Added : 96 causal constraints over 20 iterations in 217 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 45900 steps, including 3000 resets, run finished after 142 ms. (steps per millisecond=323 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 108/108 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 161 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 160 transition count 106
Applied a total of 3 rules in 14 ms. Remains 160 /162 variables (removed 2) and now considering 106/108 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/162 places, 106/108 transitions.
Incomplete random walk after 1000000 steps, including 45109 resets, run finished after 2785 ms. (steps per millisecond=359 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7687 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties seen :[0]
Interrupted probabilistic random walk after 18897435 steps, run timeout after 30001 ms. (steps per millisecond=629 ) properties seen :[0]
Probabilistic random walk after 18897435 steps, saw 2497037 distinct states, run finished after 30001 ms. (steps per millisecond=629 ) properties seen :[0]
// Phase 1: matrix 106 rows 160 cols
[2021-05-08 20:35:32] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:35:32] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:35:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-08 20:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:32] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 20:35:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:35:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 26 ms returned sat
[2021-05-08 20:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:32] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-08 20:35:32] [INFO ] Computed and/alt/rep : 102/332/102 causal constraints in 7 ms.
[2021-05-08 20:35:33] [INFO ] Added : 95 causal constraints over 19 iterations in 201 ms. Result :sat
[2021-05-08 20:35:33] [INFO ] Deduced a trap composed of 10 places in 18 ms
[2021-05-08 20:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 44800 steps, including 3157 resets, run finished after 141 ms. (steps per millisecond=317 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 160 cols
[2021-05-08 20:35:33] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:35:33] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 106 rows 160 cols
[2021-05-08 20:35:33] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:35:34] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2021-05-08 20:35:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 106 rows 160 cols
[2021-05-08 20:35:34] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:35:34] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 106/106 transitions.
Incomplete random walk after 100000 steps, including 4457 resets, run finished after 284 ms. (steps per millisecond=352 ) properties seen :[0]
// Phase 1: matrix 106 rows 160 cols
[2021-05-08 20:35:34] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:35:34] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:34] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-08 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:35:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2021-05-08 20:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:34] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-08 20:35:34] [INFO ] Computed and/alt/rep : 102/332/102 causal constraints in 7 ms.
[2021-05-08 20:35:35] [INFO ] Added : 95 causal constraints over 19 iterations in 196 ms. Result :sat
[2021-05-08 20:35:35] [INFO ] Deduced a trap composed of 10 places in 19 ms
[2021-05-08 20:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 160 transition count 106
Applied a total of 1 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 160 cols
[2021-05-08 20:35:35] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 20:35:35] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:35:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-08 20:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:35] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-08 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-08 20:35:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 26 ms returned sat
[2021-05-08 20:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:35] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-08 20:35:35] [INFO ] Computed and/alt/rep : 102/332/102 causal constraints in 7 ms.
[2021-05-08 20:35:35] [INFO ] Added : 95 causal constraints over 19 iterations in 207 ms. Result :sat
[2021-05-08 20:35:35] [INFO ] Deduced a trap composed of 16 places in 11 ms
[2021-05-08 20:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-08 20:35:35] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-08 20:35:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
[2021-05-08 20:35:35] [INFO ] Flatten gal took : 44 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-10b @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ DES-PT-10b

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 20:35:36 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18260,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((p95 <= 0)) AND ((1 <= p13)) AND ((p79 <= 0)) AND (((p100 <= 0)) OR ((1 <= p102))))))",
"processed_size": 94,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 526,
"conflict_clusters": 50,
"places": 160,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 106
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"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: 266/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160
lola: finding significant places
lola: 160 places, 106 transitions, 100 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: E (F ((((p95 <= 0)) AND ((1 <= p13)) AND ((p79 <= 0)) AND (((p100 <= 0)) OR ((1 <= p102))))))
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 ((((p95 <= 0)) AND ((1 <= p13)) AND ((p79 <= 0)) AND (((p100 <= 0)) OR ((1 <= p102))))))
lola: processed formula length: 94
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (((p95 <= 0)) AND ((1 <= p13)) AND ((p79 <= 0)) AND (((p100 <= 0)) OR ((1 <= p102))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: local time limit reached - aborting
lola: memory consumption: 18260 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="DES-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;