About the Execution of 2020-gold for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4273.859 | 3600000.00 | 140470.00 | 510.20 | FTFFFTFFTTFFTFFF | normal |
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-162039097100047.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-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100047
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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 25K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 91K 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-20b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620506348991
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:39:10] [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:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:39:10] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2021-05-08 20:39:10] [INFO ] Transformed 360 places.
[2021-05-08 20:39:10] [INFO ] Transformed 311 transitions.
[2021-05-08 20:39:10] [INFO ] Found NUPN structural information;
[2021-05-08 20:39:10] [INFO ] Parsed PT model containing 360 places and 311 transitions in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0]
FORMULA DES-PT-20b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 311 rows 360 cols
[2021-05-08 20:39:11] [INFO ] Computed 65 place invariants in 26 ms
[2021-05-08 20:39:11] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 20:39:11] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2021-05-08 20:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:11] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-08 20:39:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:11] [INFO ] [Nat]Absence check using 39 positive place invariants in 40 ms returned sat
[2021-05-08 20:39:11] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2021-05-08 20:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:12] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2021-05-08 20:39:12] [INFO ] Deduced a trap composed of 51 places in 145 ms
[2021-05-08 20:39:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2021-05-08 20:39:12] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 19 ms.
[2021-05-08 20:39:13] [INFO ] Added : 254 causal constraints over 51 iterations in 1592 ms. Result :sat
[2021-05-08 20:39:14] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2021-05-08 20:39:14] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2021-05-08 20:39:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 20:39:14] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2021-05-08 20:39:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 20:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:14] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-08 20:39:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 20:39:14] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2021-05-08 20:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:15] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2021-05-08 20:39:15] [INFO ] Deduced a trap composed of 8 places in 110 ms
[2021-05-08 20:39:15] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2021-05-08 20:39:15] [INFO ] Deduced a trap composed of 27 places in 106 ms
[2021-05-08 20:39:15] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2021-05-08 20:39:15] [INFO ] Deduced a trap composed of 37 places in 82 ms
[2021-05-08 20:39:15] [INFO ] Deduced a trap composed of 32 places in 75 ms
[2021-05-08 20:39:16] [INFO ] Deduced a trap composed of 14 places in 73 ms
[2021-05-08 20:39:16] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2021-05-08 20:39:16] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2021-05-08 20:39:16] [INFO ] Deduced a trap composed of 35 places in 80 ms
[2021-05-08 20:39:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1045 ms
[2021-05-08 20:39:16] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 17 ms.
[2021-05-08 20:39:17] [INFO ] Added : 251 causal constraints over 51 iterations in 1580 ms. Result :sat
[2021-05-08 20:39:18] [INFO ] Deduced a trap composed of 56 places in 108 ms
[2021-05-08 20:39:18] [INFO ] Deduced a trap composed of 45 places in 101 ms
[2021-05-08 20:39:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 20:39:18] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2021-05-08 20:39:18] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2021-05-08 20:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:18] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2021-05-08 20:39:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 28 ms returned sat
[2021-05-08 20:39:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2021-05-08 20:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:19] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2021-05-08 20:39:19] [INFO ] Deduced a trap composed of 8 places in 71 ms
[2021-05-08 20:39:19] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2021-05-08 20:39:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2021-05-08 20:39:19] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 13 ms.
[2021-05-08 20:39:20] [INFO ] Added : 303 causal constraints over 62 iterations in 1522 ms. Result :sat
[2021-05-08 20:39:21] [INFO ] Deduced a trap composed of 33 places in 95 ms
[2021-05-08 20:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 20:39:21] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2021-05-08 20:39:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2021-05-08 20:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:21] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-08 20:39:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2021-05-08 20:39:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2021-05-08 20:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:22] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-08 20:39:22] [INFO ] Deduced a trap composed of 8 places in 104 ms
[2021-05-08 20:39:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2021-05-08 20:39:22] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 15 ms.
[2021-05-08 20:39:23] [INFO ] Added : 258 causal constraints over 52 iterations in 1624 ms. Result :sat
[2021-05-08 20:39:23] [INFO ] Deduced a trap composed of 42 places in 81 ms
[2021-05-08 20:39:23] [INFO ] Deduced a trap composed of 59 places in 67 ms
[2021-05-08 20:39:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 20:39:24] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2021-05-08 20:39:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2021-05-08 20:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:24] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2021-05-08 20:39:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2021-05-08 20:39:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2021-05-08 20:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:25] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2021-05-08 20:39:25] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2021-05-08 20:39:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-08 20:39:25] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 20 ms.
[2021-05-08 20:39:26] [INFO ] Added : 304 causal constraints over 62 iterations in 1490 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 286000 steps, including 3018 resets, run finished after 845 ms. (steps per millisecond=338 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 28200 steps, including 375 resets, run finished after 88 ms. (steps per millisecond=320 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 309700 steps, including 3253 resets, run finished after 871 ms. (steps per millisecond=355 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 101500 steps, including 1266 resets, run finished after 289 ms. (steps per millisecond=351 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 151600 steps, including 1654 resets, run finished after 420 ms. (steps per millisecond=360 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 25 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 741 edges and 360 vertex of which 353 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 353 transition count 285
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 333 transition count 285
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 43 place count 333 transition count 279
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 327 transition count 279
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 327 transition count 279
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 100 place count 312 transition count 264
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 312 transition count 264
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 133 place count 301 transition count 253
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 143 place count 301 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 300 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 300 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 299 transition count 242
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 276 place count 234 transition count 177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 282 place count 231 transition count 179
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 231 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 229 transition count 177
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 229 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 290 place count 227 transition count 175
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 291 place count 227 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 292 place count 226 transition count 174
Applied a total of 292 rules in 139 ms. Remains 226 /360 variables (removed 134) and now considering 174/311 (removed 137) transitions.
Finished structural reductions, in 1 iterations. Remains : 226/360 places, 174/311 transitions.
Incomplete random walk after 1000000 steps, including 22005 resets, run finished after 2848 ms. (steps per millisecond=351 ) properties seen :[0, 0, 0, 0, 1]
FORMULA DES-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3748 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3634 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3664 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3438 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 174 rows 226 cols
[2021-05-08 20:39:36] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-08 20:39:36] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:39:36] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-08 20:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:36] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-08 20:39:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-08 20:39:36] [INFO ] [Nat]Absence check using 35 positive and 29 generalized place invariants in 59 ms returned sat
[2021-05-08 20:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:36] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2021-05-08 20:39:36] [INFO ] Computed and/alt/rep : 170/658/170 causal constraints in 12 ms.
[2021-05-08 20:39:37] [INFO ] Added : 133 causal constraints over 27 iterations in 562 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:39:37] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:39:37] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-08 20:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:37] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-08 20:39:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2021-05-08 20:39:37] [INFO ] [Nat]Absence check using 35 positive and 29 generalized place invariants in 57 ms returned sat
[2021-05-08 20:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:38] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-08 20:39:38] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2021-05-08 20:39:38] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-08 20:39:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2021-05-08 20:39:38] [INFO ] Computed and/alt/rep : 170/658/170 causal constraints in 10 ms.
[2021-05-08 20:39:38] [INFO ] Added : 134 causal constraints over 27 iterations in 486 ms. Result :sat
[2021-05-08 20:39:38] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2021-05-08 20:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 20:39:38] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:39:38] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-08 20:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:38] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-08 20:39:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-08 20:39:39] [INFO ] [Nat]Absence check using 35 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-08 20:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:39] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2021-05-08 20:39:39] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2021-05-08 20:39:39] [INFO ] Deduced a trap composed of 34 places in 37 ms
[2021-05-08 20:39:39] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2021-05-08 20:39:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2021-05-08 20:39:39] [INFO ] Computed and/alt/rep : 170/658/170 causal constraints in 9 ms.
[2021-05-08 20:39:40] [INFO ] Added : 164 causal constraints over 33 iterations in 679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:39:40] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-08 20:39:40] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 20 ms returned sat
[2021-05-08 20:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:40] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-08 20:39:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:39:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-08 20:39:40] [INFO ] [Nat]Absence check using 35 positive and 29 generalized place invariants in 61 ms returned sat
[2021-05-08 20:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:39:40] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-08 20:39:40] [INFO ] Deduced a trap composed of 7 places in 22 ms
[2021-05-08 20:39:40] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2021-05-08 20:39:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2021-05-08 20:39:40] [INFO ] Computed and/alt/rep : 170/658/170 causal constraints in 9 ms.
[2021-05-08 20:39:41] [INFO ] Added : 123 causal constraints over 25 iterations in 445 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 88700 steps, including 1952 resets, run finished after 263 ms. (steps per millisecond=337 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 118100 steps, including 2883 resets, run finished after 345 ms. (steps per millisecond=342 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 90200 steps, including 2060 resets, run finished after 260 ms. (steps per millisecond=346 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA DES-PT-20b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 71700 steps, including 1304 resets, run finished after 208 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 174/174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 225 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 225 transition count 172
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 4 place count 224 transition count 172
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 224 transition count 172
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 222 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 222 transition count 169
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 36 place count 209 transition count 157
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 209 transition count 157
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 208 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 42 place count 208 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 208 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 207 transition count 148
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 207 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 206 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 49 place count 206 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 50 place count 206 transition count 146
Symmetric choice reduction at 7 with 1 rule applications. Total rules 51 place count 206 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 53 place count 205 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 54 place count 205 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 55 place count 204 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 56 place count 203 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 57 place count 202 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 58 place count 201 transition count 140
Applied a total of 58 rules in 83 ms. Remains 201 /226 variables (removed 25) and now considering 140/174 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/226 places, 140/174 transitions.
Incomplete random walk after 1000000 steps, including 40048 resets, run finished after 2661 ms. (steps per millisecond=375 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7804 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7588 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7477 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 18489667 steps, run timeout after 30001 ms. (steps per millisecond=616 ) properties seen :[0, 0, 0]
Probabilistic random walk after 18489667 steps, saw 2241682 distinct states, run finished after 30001 ms. (steps per millisecond=616 ) properties seen :[0, 0, 0]
// Phase 1: matrix 140 rows 201 cols
[2021-05-08 20:40:18] [INFO ] Computed 63 place invariants in 4 ms
[2021-05-08 20:40:18] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:40:18] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2021-05-08 20:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:18] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-08 20:40:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:40:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:40:18] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2021-05-08 20:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:18] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-08 20:40:18] [INFO ] Computed and/alt/rep : 137/329/137 causal constraints in 7 ms.
[2021-05-08 20:40:18] [INFO ] Added : 105 causal constraints over 21 iterations in 255 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:40:18] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:40:18] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2021-05-08 20:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:19] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-08 20:40:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:40:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:40:19] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2021-05-08 20:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:19] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-08 20:40:19] [INFO ] Computed and/alt/rep : 137/329/137 causal constraints in 7 ms.
[2021-05-08 20:40:19] [INFO ] Added : 101 causal constraints over 21 iterations in 285 ms. Result :sat
[2021-05-08 20:40:19] [INFO ] Deduced a trap composed of 16 places in 33 ms
[2021-05-08 20:40:19] [INFO ] Deduced a trap composed of 17 places in 33 ms
[2021-05-08 20:40:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:40:19] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:40:19] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2021-05-08 20:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:19] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-08 20:40:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:40:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:40:20] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2021-05-08 20:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:20] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-08 20:40:20] [INFO ] Computed and/alt/rep : 137/329/137 causal constraints in 6 ms.
[2021-05-08 20:40:20] [INFO ] Added : 77 causal constraints over 16 iterations in 198 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 69300 steps, including 2994 resets, run finished after 191 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 37900 steps, including 1474 resets, run finished after 105 ms. (steps per millisecond=360 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 74000 steps, including 3074 resets, run finished after 201 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 140/140 transitions.
Starting structural reductions, iteration 0 : 201/201 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 201 cols
[2021-05-08 20:40:20] [INFO ] Computed 63 place invariants in 4 ms
[2021-05-08 20:40:21] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 140 rows 201 cols
[2021-05-08 20:40:21] [INFO ] Computed 63 place invariants in 4 ms
[2021-05-08 20:40:22] [INFO ] Implicit Places using invariants and state equation in 748 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1131 ms to find 1 implicit places.
[2021-05-08 20:40:22] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:40:22] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:40:22] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Starting structural reductions, iteration 1 : 200/201 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2021-05-08 20:40:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:40:22] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:40:22] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 140/140 transitions.
Incomplete random walk after 1000000 steps, including 40336 resets, run finished after 2650 ms. (steps per millisecond=377 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7757 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7549 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7574 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 18431982 steps, run timeout after 30001 ms. (steps per millisecond=614 ) properties seen :[0, 0, 0]
Probabilistic random walk after 18431982 steps, saw 2234448 distinct states, run finished after 30001 ms. (steps per millisecond=614 ) properties seen :[0, 0, 0]
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:40:58] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:40:58] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:40:58] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:58] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-08 20:40:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:40:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:40:58] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 35 ms returned sat
[2021-05-08 20:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:58] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-08 20:40:58] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:40:59] [INFO ] Added : 104 causal constraints over 21 iterations in 334 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:40:59] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:40:59] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:59] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-08 20:40:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:40:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:40:59] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 16 ms returned sat
[2021-05-08 20:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:40:59] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-08 20:40:59] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:40:59] [INFO ] Added : 84 causal constraints over 17 iterations in 224 ms. Result :sat
[2021-05-08 20:40:59] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-08 20:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:40:59] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:40:59] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:00] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 20:41:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:00] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 55 ms returned sat
[2021-05-08 20:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:00] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-08 20:41:00] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 8 ms.
[2021-05-08 20:41:00] [INFO ] Added : 133 causal constraints over 27 iterations in 307 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 93800 steps, including 3935 resets, run finished after 252 ms. (steps per millisecond=372 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 45900 steps, including 1933 resets, run finished after 125 ms. (steps per millisecond=367 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 72800 steps, including 3030 resets, run finished after 196 ms. (steps per millisecond=371 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 140/140 transitions.
Starting structural reductions, iteration 0 : 200/200 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:41:01] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:41:01] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:41:01] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:41:02] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2021-05-08 20:41:02] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:41:02] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:41:02] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 140/140 transitions.
Incomplete random walk after 100000 steps, including 3999 resets, run finished after 267 ms. (steps per millisecond=374 ) properties seen :[0, 0, 0]
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:41:02] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:41:02] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:02] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:02] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-08 20:41:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:03] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 34 ms returned sat
[2021-05-08 20:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:03] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-08 20:41:03] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:41:03] [INFO ] Added : 104 causal constraints over 21 iterations in 333 ms. Result :sat
[2021-05-08 20:41:03] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:03] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:03] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-08 20:41:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:41:03] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-08 20:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:03] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-08 20:41:03] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 6 ms.
[2021-05-08 20:41:04] [INFO ] Added : 84 causal constraints over 17 iterations in 222 ms. Result :sat
[2021-05-08 20:41:04] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-08 20:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-08 20:41:04] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:04] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:04] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-08 20:41:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:04] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 53 ms returned sat
[2021-05-08 20:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:04] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-08 20:41:04] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:41:04] [INFO ] Added : 133 causal constraints over 27 iterations in 300 ms. Result :sat
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 200 cols
[2021-05-08 20:41:04] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 20:41:05] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:05] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:05] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-08 20:41:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:05] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 35 ms returned sat
[2021-05-08 20:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:05] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-08 20:41:05] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:41:05] [INFO ] Added : 104 causal constraints over 21 iterations in 333 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:41:05] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:05] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:06] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-08 20:41:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:41:06] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 16 ms returned sat
[2021-05-08 20:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:06] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-08 20:41:06] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:41:06] [INFO ] Added : 84 causal constraints over 17 iterations in 230 ms. Result :sat
[2021-05-08 20:41:06] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-08 20:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:41:06] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:41:06] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 20:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:06] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 20:41:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-08 20:41:06] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 53 ms returned sat
[2021-05-08 20:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:06] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-08 20:41:06] [INFO ] Computed and/alt/rep : 137/328/137 causal constraints in 7 ms.
[2021-05-08 20:41:07] [INFO ] Added : 133 causal constraints over 27 iterations in 303 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:41:07] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2021-05-08 20:41:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
[2021-05-08 20:41:07] [INFO ] Flatten gal took : 59 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-20b @ 3570 seconds
FORMULA DES-PT-20b-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-20b-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ DES-PT-20b
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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:41:08 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p15))))",
"processed_size": 20,
"rewrites": 1
},
"result":
{
"edges": 536,
"markings": 476,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p42)) AND ((p8 <= 0)))))",
"processed_size": 38,
"rewrites": 1
},
"result":
{
"edges": 937,
"markings": 936,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p76)) AND ((p95 <= 0)) AND ((p3 <= 0)))))",
"processed_size": 55,
"rewrites": 1
},
"result":
{
"edges": 9375,
"markings": 8425,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19088,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 49,
"places": 200,
"places_significant": 138,
"singleton_clusters": 0,
"transitions": 140
},
"result":
{
"preliminary_value": "yes yes yes ",
"value": "yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 340/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 200
lola: finding significant places
lola: 200 places, 140 transitions, 138 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: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: E (F ((((1 <= p76)) AND ((p95 <= 0)) AND ((p3 <= 0))))) : E (F (((1 <= p15)))) : E (F ((((1 <= p42)) AND ((p8 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p15))))
lola: processed formula length: 20
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: 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 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 476 markings, 536 edges
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p42)) AND ((p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p42)) AND ((p8 <= 0)))))
lola: processed formula length: 38
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: 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 <= p42)) AND ((p8 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 936 markings, 937 edges
lola: ========================================
lola: subprocess 2 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p76)) AND ((p95 <= 0)) AND ((p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p76)) AND ((p95 <= 0)) AND ((p3 <= 0)))))
lola: processed formula length: 55
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: 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 <= p76)) AND ((p95 <= 0)) AND ((p3 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
sara: error: :251: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8425 markings, 9375 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes
lola:
preliminary result: yes yes yes
lola: memory consumption: 19088 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-20b"
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-20b, 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-162039097100047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b 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 '
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 ;