About the Execution of ITS-LoLa for DES-PT-40b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.200 | 3600000.00 | 694416.00 | 384.60 | FFTTFTTTTFTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900000303.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000303
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 115K Mar 24 05:37 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-40b-ReachabilityFireability-00
FORMULA_NAME DES-PT-40b-ReachabilityFireability-01
FORMULA_NAME DES-PT-40b-ReachabilityFireability-02
FORMULA_NAME DES-PT-40b-ReachabilityFireability-03
FORMULA_NAME DES-PT-40b-ReachabilityFireability-04
FORMULA_NAME DES-PT-40b-ReachabilityFireability-05
FORMULA_NAME DES-PT-40b-ReachabilityFireability-06
FORMULA_NAME DES-PT-40b-ReachabilityFireability-07
FORMULA_NAME DES-PT-40b-ReachabilityFireability-08
FORMULA_NAME DES-PT-40b-ReachabilityFireability-09
FORMULA_NAME DES-PT-40b-ReachabilityFireability-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591195015020
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 14:36:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 14:36:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 14:36:58] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2020-06-03 14:36:58] [INFO ] Transformed 439 places.
[2020-06-03 14:36:58] [INFO ] Transformed 390 transitions.
[2020-06-03 14:36:58] [INFO ] Found NUPN structural information;
[2020-06-03 14:36:58] [INFO ] Parsed PT model containing 439 places and 390 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 80 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0]
FORMULA DES-PT-40b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 390 rows 439 cols
[2020-06-03 14:36:59] [INFO ] Computed 65 place invariants in 67 ms
[2020-06-03 14:36:59] [INFO ] [Real]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-06-03 14:36:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 73 ms returned sat
[2020-06-03 14:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:01] [INFO ] [Real]Absence check using state equation in 1614 ms returned sat
[2020-06-03 14:37:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:37:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 177 ms returned sat
[2020-06-03 14:37:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 104 ms returned sat
[2020-06-03 14:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:02] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2020-06-03 14:37:03] [INFO ] Deduced a trap composed of 8 places in 634 ms
[2020-06-03 14:37:03] [INFO ] Deduced a trap composed of 14 places in 255 ms
[2020-06-03 14:37:04] [INFO ] Deduced a trap composed of 30 places in 230 ms
[2020-06-03 14:37:04] [INFO ] Deduced a trap composed of 19 places in 124 ms
[2020-06-03 14:37:04] [INFO ] Deduced a trap composed of 27 places in 114 ms
[2020-06-03 14:37:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1653 ms
[2020-06-03 14:37:04] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 54 ms.
[2020-06-03 14:37:06] [INFO ] Added : 130 causal constraints over 26 iterations in 1804 ms. Result :unknown
[2020-06-03 14:37:06] [INFO ] [Real]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-06-03 14:37:06] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 14:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:07] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2020-06-03 14:37:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:37:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 115 ms returned sat
[2020-06-03 14:37:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 69 ms returned sat
[2020-06-03 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:10] [INFO ] [Nat]Absence check using state equation in 1779 ms returned sat
[2020-06-03 14:37:10] [INFO ] Deduced a trap composed of 8 places in 302 ms
[2020-06-03 14:37:10] [INFO ] Deduced a trap composed of 15 places in 162 ms
[2020-06-03 14:37:10] [INFO ] Deduced a trap composed of 10 places in 186 ms
[2020-06-03 14:37:10] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-06-03 14:37:11] [INFO ] Deduced a trap composed of 12 places in 149 ms
[2020-06-03 14:37:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1208 ms
[2020-06-03 14:37:11] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 46 ms.
[2020-06-03 14:37:12] [INFO ] Added : 70 causal constraints over 14 iterations in 1756 ms. Result :unknown
[2020-06-03 14:37:13] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 14:37:13] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 14:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:14] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2020-06-03 14:37:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:37:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 98 ms returned sat
[2020-06-03 14:37:14] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-06-03 14:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:15] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2020-06-03 14:37:16] [INFO ] Deduced a trap composed of 8 places in 331 ms
[2020-06-03 14:37:16] [INFO ] Deduced a trap composed of 12 places in 211 ms
[2020-06-03 14:37:16] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2020-06-03 14:37:16] [INFO ] Deduced a trap composed of 28 places in 143 ms
[2020-06-03 14:37:16] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2020-06-03 14:37:16] [INFO ] Deduced a trap composed of 29 places in 105 ms
[2020-06-03 14:37:17] [INFO ] Deduced a trap composed of 30 places in 124 ms
[2020-06-03 14:37:17] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2020-06-03 14:37:17] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2020-06-03 14:37:17] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-06-03 14:37:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1844 ms
[2020-06-03 14:37:17] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 48 ms.
[2020-06-03 14:37:19] [INFO ] Added : 85 causal constraints over 17 iterations in 1662 ms. Result :(error "Failed to check-sat")
[2020-06-03 14:37:19] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-06-03 14:37:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 14:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:20] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2020-06-03 14:37:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:37:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 173 ms returned sat
[2020-06-03 14:37:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 81 ms returned sat
[2020-06-03 14:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:22] [INFO ] [Nat]Absence check using state equation in 1564 ms returned sat
[2020-06-03 14:37:22] [INFO ] Deduced a trap composed of 47 places in 194 ms
[2020-06-03 14:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2020-06-03 14:37:22] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 45 ms.
[2020-06-03 14:37:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t217 0) (and (and (> t218 0) (< o218 o217)) (or (and (> t14 0) (< o14 o217)) (and (> t17 0) (< o17 o217)))))") while checking expression at index 3
[2020-06-03 14:37:25] [INFO ] [Real]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-06-03 14:37:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 108 ms returned sat
[2020-06-03 14:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:37:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 14:37:30] [INFO ] [Real]Absence check using state equation in 4716 ms returned unknown
Incomplete Parikh walk after 142300 steps, including 1512 resets, run finished after 891 ms. (steps per millisecond=159 ) properties seen :[0, 1, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 555000 steps, including 5908 resets, run finished after 2192 ms. (steps per millisecond=253 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 23 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 390/390 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.35 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 428 transition count 366
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 410 transition count 366
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 38 place count 410 transition count 357
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 56 place count 401 transition count 357
Symmetric choice reduction at 2 with 18 rule applications. Total rules 74 place count 401 transition count 357
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 110 place count 383 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 110 place count 383 transition count 338
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 382 transition count 338
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 382 transition count 338
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 154 place count 368 transition count 324
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 168 place count 368 transition count 310
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 366 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 171 place count 366 transition count 307
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 364 transition count 307
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 303 place count 300 transition count 243
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 311 place count 296 transition count 252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 312 place count 296 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 295 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 314 place count 294 transition count 250
Applied a total of 314 rules in 547 ms. Remains 294 /439 variables (removed 145) and now considering 250/390 (removed 140) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/439 places, 250/390 transitions.
Incomplete random walk after 1000000 steps, including 30119 resets, run finished after 5029 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5327 resets, run finished after 2664 ms. (steps per millisecond=375 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5232 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5257 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5573 resets, run finished after 2709 ms. (steps per millisecond=369 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 7507198 steps, run timeout after 30001 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 7507198 steps, saw 945914 distinct states, run finished after 30005 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 250 rows 294 cols
[2020-06-03 14:38:19] [INFO ] Computed 60 place invariants in 23 ms
[2020-06-03 14:38:19] [INFO ] [Real]Absence check using 34 positive place invariants in 78 ms returned sat
[2020-06-03 14:38:19] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 78 ms returned sat
[2020-06-03 14:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:20] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2020-06-03 14:38:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:38:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-06-03 14:38:20] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 40 ms returned sat
[2020-06-03 14:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:22] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2020-06-03 14:38:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2020-06-03 14:38:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2020-06-03 14:38:22] [INFO ] Deduced a trap composed of 6 places in 425 ms
[2020-06-03 14:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2020-06-03 14:38:22] [INFO ] Computed and/alt/rep : 248/1821/248 causal constraints in 42 ms.
[2020-06-03 14:38:26] [INFO ] Added : 236 causal constraints over 48 iterations in 3862 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 82 ms.
[2020-06-03 14:38:26] [INFO ] [Real]Absence check using 34 positive place invariants in 64 ms returned sat
[2020-06-03 14:38:26] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 79 ms returned sat
[2020-06-03 14:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:28] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2020-06-03 14:38:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:38:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 101 ms returned sat
[2020-06-03 14:38:28] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-03 14:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:29] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2020-06-03 14:38:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 27 ms returned sat
[2020-06-03 14:38:30] [INFO ] Deduced a trap composed of 15 places in 285 ms
[2020-06-03 14:38:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2020-06-03 14:38:30] [INFO ] Computed and/alt/rep : 248/1821/248 causal constraints in 27 ms.
[2020-06-03 14:38:32] [INFO ] Added : 178 causal constraints over 36 iterations in 2875 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 14:38:33] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 14:38:33] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 33 ms returned sat
[2020-06-03 14:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:33] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2020-06-03 14:38:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:38:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 14:38:33] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 39 ms returned sat
[2020-06-03 14:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:34] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2020-06-03 14:38:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2020-06-03 14:38:34] [INFO ] Computed and/alt/rep : 248/1821/248 causal constraints in 42 ms.
[2020-06-03 14:38:38] [INFO ] Added : 242 causal constraints over 49 iterations in 3371 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-06-03 14:38:38] [INFO ] [Real]Absence check using 34 positive place invariants in 101 ms returned sat
[2020-06-03 14:38:38] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 75 ms returned sat
[2020-06-03 14:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:40] [INFO ] [Real]Absence check using state equation in 1979 ms returned sat
[2020-06-03 14:38:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:38:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 14:38:40] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 333 ms returned sat
[2020-06-03 14:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:38:42] [INFO ] [Nat]Absence check using state equation in 1557 ms returned sat
[2020-06-03 14:38:42] [INFO ] [Nat]Added 16 Read/Feed constraints in 194 ms returned sat
[2020-06-03 14:38:42] [INFO ] Computed and/alt/rep : 248/1821/248 causal constraints in 61 ms.
[2020-06-03 14:38:45] [INFO ] Added : 120 causal constraints over 24 iterations in 2316 ms. Result :unsat
FORMULA DES-PT-40b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 224300 steps, including 5339 resets, run finished after 1030 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 152700 steps, including 3752 resets, run finished after 697 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 207200 steps, including 4869 resets, run finished after 916 ms. (steps per millisecond=226 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 250/250 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 291 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 290 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 289 transition count 246
Applied a total of 8 rules in 71 ms. Remains 289 /294 variables (removed 5) and now considering 246/250 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/294 places, 246/250 transitions.
Incomplete random walk after 1000000 steps, including 34402 resets, run finished after 4472 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5718 resets, run finished after 2445 ms. (steps per millisecond=408 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5731 resets, run finished after 2028 ms. (steps per millisecond=493 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5979 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 7653382 steps, run timeout after 30001 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0]
Probabilistic random walk after 7653382 steps, saw 957913 distinct states, run finished after 30001 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0]
// Phase 1: matrix 246 rows 289 cols
[2020-06-03 14:39:28] [INFO ] Computed 59 place invariants in 21 ms
[2020-06-03 14:39:29] [INFO ] [Real]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-06-03 14:39:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 14:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:39:30] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2020-06-03 14:39:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:39:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 85 ms returned sat
[2020-06-03 14:39:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 158 ms returned sat
[2020-06-03 14:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:39:31] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2020-06-03 14:39:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-03 14:39:31] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2020-06-03 14:39:31] [INFO ] Computed and/alt/rep : 243/1656/243 causal constraints in 31 ms.
[2020-06-03 14:39:37] [INFO ] Added : 233 causal constraints over 47 iterations in 5802 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 14:39:37] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 14:39:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-06-03 14:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:39:38] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2020-06-03 14:39:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:39:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 93 ms returned sat
[2020-06-03 14:39:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 118 ms returned sat
[2020-06-03 14:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:39:40] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2020-06-03 14:39:40] [INFO ] [Nat]Added 12 Read/Feed constraints in 8 ms returned sat
[2020-06-03 14:39:40] [INFO ] Computed and/alt/rep : 243/1656/243 causal constraints in 27 ms.
[2020-06-03 14:39:46] [INFO ] Added : 205 causal constraints over 44 iterations in 5510 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
[2020-06-03 14:39:46] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 14:39:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-06-03 14:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:39:47] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2020-06-03 14:39:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:39:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 62 ms returned sat
[2020-06-03 14:39:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 82 ms returned sat
[2020-06-03 14:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:39:48] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2020-06-03 14:39:48] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2020-06-03 14:39:48] [INFO ] Computed and/alt/rep : 243/1656/243 causal constraints in 36 ms.
[2020-06-03 14:39:51] [INFO ] Added : 241 causal constraints over 49 iterations in 2880 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 223800 steps, including 8743 resets, run finished after 1101 ms. (steps per millisecond=203 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 151600 steps, including 6014 resets, run finished after 750 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 198500 steps, including 7840 resets, run finished after 899 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 289/289 places, 246/246 transitions.
Applied a total of 0 rules in 46 ms. Remains 289 /289 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 246/246 transitions.
Starting structural reductions, iteration 0 : 289/289 places, 246/246 transitions.
Applied a total of 0 rules in 20 ms. Remains 289 /289 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 289 cols
[2020-06-03 14:39:54] [INFO ] Computed 59 place invariants in 6 ms
[2020-06-03 14:39:55] [INFO ] Implicit Places using invariants in 1256 ms returned []
// Phase 1: matrix 246 rows 289 cols
[2020-06-03 14:39:55] [INFO ] Computed 59 place invariants in 15 ms
[2020-06-03 14:39:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-03 14:39:57] [INFO ] Implicit Places using invariants and state equation in 2373 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
[2020-06-03 14:39:57] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 246 rows 289 cols
[2020-06-03 14:39:57] [INFO ] Computed 59 place invariants in 8 ms
[2020-06-03 14:39:59] [INFO ] Dead Transitions using invariants and state equation in 1394 ms returned []
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 246/246 transitions.
Incomplete random walk after 100000 steps, including 3461 resets, run finished after 429 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0]
// Phase 1: matrix 246 rows 289 cols
[2020-06-03 14:39:59] [INFO ] Computed 59 place invariants in 5 ms
[2020-06-03 14:39:59] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 14:39:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 14:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:00] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2020-06-03 14:40:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:40:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 14:40:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 100 ms returned sat
[2020-06-03 14:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:01] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2020-06-03 14:40:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-03 14:40:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2020-06-03 14:40:01] [INFO ] Computed and/alt/rep : 243/1656/243 causal constraints in 92 ms.
[2020-06-03 14:40:07] [INFO ] Added : 233 causal constraints over 47 iterations in 6384 ms. Result :sat
[2020-06-03 14:40:08] [INFO ] [Real]Absence check using 34 positive place invariants in 50 ms returned sat
[2020-06-03 14:40:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2020-06-03 14:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:08] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2020-06-03 14:40:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:40:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 123 ms returned sat
[2020-06-03 14:40:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 168 ms returned sat
[2020-06-03 14:40:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:10] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2020-06-03 14:40:10] [INFO ] [Nat]Added 12 Read/Feed constraints in 21 ms returned sat
[2020-06-03 14:40:11] [INFO ] Computed and/alt/rep : 243/1656/243 causal constraints in 101 ms.
[2020-06-03 14:40:16] [INFO ] Added : 205 causal constraints over 44 iterations in 5920 ms. Result :sat
[2020-06-03 14:40:17] [INFO ] [Real]Absence check using 34 positive place invariants in 170 ms returned sat
[2020-06-03 14:40:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 14:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:17] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-06-03 14:40:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:40:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 14:40:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 14:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:18] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2020-06-03 14:40:18] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2020-06-03 14:40:18] [INFO ] Computed and/alt/rep : 243/1656/243 causal constraints in 36 ms.
[2020-06-03 14:40:21] [INFO ] Added : 241 causal constraints over 49 iterations in 2789 ms. Result :sat
Applied a total of 0 rules in 30 ms. Remains 289 /289 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 289 cols
[2020-06-03 14:40:21] [INFO ] Computed 59 place invariants in 8 ms
[2020-06-03 14:40:22] [INFO ] [Real]Absence check using 34 positive place invariants in 121 ms returned sat
[2020-06-03 14:40:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 14:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:22] [INFO ] [Real]Absence check using state equation in 892 ms returned sat
[2020-06-03 14:40:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:40:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 14:40:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 177 ms returned sat
[2020-06-03 14:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:24] [INFO ] [Nat]Absence check using state equation in 1428 ms returned sat
[2020-06-03 14:40:24] [INFO ] Deduced a trap composed of 5 places in 108 ms
[2020-06-03 14:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-03 14:40:24] [INFO ] Computed and/alt/rep : 243/1616/243 causal constraints in 57 ms.
[2020-06-03 14:40:28] [INFO ] Added : 232 causal constraints over 47 iterations in 3667 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
[2020-06-03 14:40:28] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 14:40:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-06-03 14:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:29] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-06-03 14:40:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:40:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 14:40:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 72 ms returned sat
[2020-06-03 14:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:30] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2020-06-03 14:40:30] [INFO ] Computed and/alt/rep : 243/1616/243 causal constraints in 30 ms.
[2020-06-03 14:40:34] [INFO ] Added : 190 causal constraints over 38 iterations in 3717 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2020-06-03 14:40:34] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 14:40:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-06-03 14:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:35] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2020-06-03 14:40:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:40:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 14:40:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 14:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:40:36] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2020-06-03 14:40:36] [INFO ] Computed and/alt/rep : 243/1616/243 causal constraints in 29 ms.
[2020-06-03 14:40:40] [INFO ] Added : 241 causal constraints over 49 iterations in 3770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 115 ms.
[2020-06-03 14:40:40] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2020-06-03 14:40:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 56 ms.
[2020-06-03 14:40:40] [INFO ] Flatten gal took : 152 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-40b @ 3570 seconds
FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-40b-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3155
rslt: Output for ReachabilityFireability @ DES-PT-40b
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 14:40:41 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 <= p53) AND (1 <= p284))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 23911793,
"markings": 19583390,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1723
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p170) AND (1 <= p120) AND (1 <= p164) AND (1 <= p210))))",
"processed_size": 69,
"rewrites": 1
},
"result":
{
"edges": 3440156,
"markings": 2050255,
"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": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p5 <= 0) OR (p200 <= 0) OR ((1 <= p203) AND (1 <= p279) AND (((1 <= p182)) OR ((1 <= p223) AND (1 <= p240)))) OR ((1 <= p118) AND (1 <= p195) AND (1 <= p180)))))",
"processed_size": 173,
"rewrites": 2
},
"result":
{
"edges": 55161406,
"markings": 40879812,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 54,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 23128,
"runtime": 415.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1149,
"conflict_clusters": 60,
"places": 289,
"places_significant": 230,
"singleton_clusters": 0,
"transitions": 246
},
"result":
{
"preliminary_value": "no yes yes ",
"value": "no 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: 535/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 289
lola: finding significant places
lola: 289 places, 246 transitions, 230 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: A (G (((p5 <= 0) OR (p200 <= 0) OR ((1 <= p203) AND (1 <= p279) AND (((1 <= p182)) OR ((1 <= p223) AND (1 <= p240)))) OR ((1 <= p118) AND (1 <= p195) AND (1 <= p180))))) : E (F (((1 <= p53) AND (1 <= p284)))) : E (F (((1 <= p170) AND (1 <= p120) AND (1 <= p164) AND (1 <= p210))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p53) AND (1 <= p284))))
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 <= p53) AND (1 <= p284))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p53) AND (1 <= p284))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :328: 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: sara is running 0 secs || 897783 markings, 1060797 edges, 179557 markings/sec, 0 secs
lola: sara is running 5 secs || 1760311 markings, 2122670 edges, 172506 markings/sec, 5 secs
lola: sara is running 10 secs || 2579361 markings, 3155593 edges, 163810 markings/sec, 10 secs
lola: sara is running 15 secs || 3390530 markings, 4184427 edges, 162234 markings/sec, 15 secs
lola: sara is running 20 secs || 4246568 markings, 5195041 edges, 171208 markings/sec, 20 secs
lola: sara is running 25 secs || 5086385 markings, 6226446 edges, 167963 markings/sec, 25 secs
lola: sara is running 30 secs || 5921855 markings, 7235119 edges, 167094 markings/sec, 30 secs
lola: sara is running 35 secs || 6734962 markings, 8231330 edges, 162621 markings/sec, 35 secs
lola: sara is running 40 secs || 7563596 markings, 9254225 edges, 165727 markings/sec, 40 secs
lola: sara is running 45 secs || 8403084 markings, 10278042 edges, 167898 markings/sec, 45 secs
lola: sara is running 50 secs || 9241571 markings, 11303527 edges, 167697 markings/sec, 50 secs
lola: sara is running 55 secs || 10082767 markings, 12315276 edges, 168239 markings/sec, 55 secs
lola: sara is running 60 secs || 10925957 markings, 13349586 edges, 168638 markings/sec, 60 secs
lola: sara is running 65 secs || 11762668 markings, 14384207 edges, 167342 markings/sec, 65 secs
lola: sara is running 70 secs || 12608243 markings, 15410144 edges, 169115 markings/sec, 70 secs
lola: sara is running 75 secs || 13433502 markings, 16411302 edges, 165052 markings/sec, 75 secs
lola: sara is running 80 secs || 14262013 markings, 17418381 edges, 165702 markings/sec, 80 secs
lola: sara is running 85 secs || 15091758 markings, 18439793 edges, 165949 markings/sec, 85 secs
lola: sara is running 90 secs || 15916058 markings, 19455736 edges, 164860 markings/sec, 90 secs
lola: sara is running 95 secs || 16744885 markings, 20463731 edges, 165765 markings/sec, 95 secs
lola: sara is running 100 secs || 17581310 markings, 21468948 edges, 167285 markings/sec, 100 secs
lola: sara is running 105 secs || 18408043 markings, 22479327 edges, 165347 markings/sec, 105 secs
lola: sara is running 110 secs || 19229184 markings, 23493546 edges, 164228 markings/sec, 110 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19583390 markings, 23911793 edges
lola: ========================================
lola: subprocess 1 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p170) AND (1 <= p120) AND (1 <= p164) AND (1 <= p210))))
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 <= p170) AND (1 <= p120) AND (1 <= p164) AND (1 <= p210))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p170) AND (1 <= p120) AND (1 <= p164) AND (1 <= p210))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :328: 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: sara is running 0 secs || 677598 markings, 1135006 edges, 135520 markings/sec, 0 secs
lola: sara is running 5 secs || 1321515 markings, 2216562 edges, 128783 markings/sec, 5 secs
lola: sara is running 10 secs || 1982482 markings, 3326481 edges, 132193 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2050255 markings, 3440156 edges
lola: ========================================
lola: subprocess 2 will run for 3431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 <= 0) OR (p200 <= 0) OR ((1 <= p203) AND (1 <= p279) AND (((1 <= p182)) OR ((1 <= p223) AND (1 <= p240)))) OR ((1 <= p118) AND (1 <= p195) AND (1 <= p180)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p5 <= 0) OR (p200 <= 0) OR ((1 <= p203) AND (1 <= p279) AND (((1 <= p182)) OR ((1 <= p223) AND (1 <= p240)))) OR ((1 <= p118) AND (1 <= p195) AND (1 <= p180)))))
lola: processed formula length: 173
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (1 <= p200) AND ((p203 <= 0) OR (p279 <= 0) OR (((p182 <= 0)) AND ((p223 <= 0) OR (p240 <= 0)))) AND ((p118 <= 0) OR (p195 <= 0) OR (p180 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 54 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: error: :328: 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: sara is running 0 secs || 756323 markings, 972625 edges, 151265 markings/sec, 0 secs
lola: sara is running 5 secs || 1483608 markings, 1954032 edges, 145457 markings/sec, 5 secs
lola: sara is running 10 secs || 2210539 markings, 2927290 edges, 145386 markings/sec, 10 secs
lola: sara is running 15 secs || 2889372 markings, 3881401 edges, 135767 markings/sec, 15 secs
lola: sara is running 20 secs || 3593610 markings, 4868496 edges, 140848 markings/sec, 20 secs
lola: sara is running 25 secs || 4346162 markings, 5869236 edges, 150510 markings/sec, 25 secs
lola: sara is running 30 secs || 5129926 markings, 6887859 edges, 156753 markings/sec, 30 secs
lola: sara is running 35 secs || 5882530 markings, 7868707 edges, 150521 markings/sec, 35 secs
lola: sara is running 40 secs || 6609486 markings, 8867890 edges, 145391 markings/sec, 40 secs
lola: sara is running 45 secs || 7354845 markings, 9850298 edges, 149072 markings/sec, 45 secs
lola: sara is running 50 secs || 8070581 markings, 10841638 edges, 143147 markings/sec, 50 secs
lola: sara is running 55 secs || 8809853 markings, 11814339 edges, 147854 markings/sec, 55 secs
lola: sara is running 60 secs || 9524198 markings, 12803049 edges, 142869 markings/sec, 60 secs
lola: sara is running 65 secs || 10254283 markings, 13766424 edges, 146017 markings/sec, 65 secs
lola: sara is running 70 secs || 10983562 markings, 14778352 edges, 145856 markings/sec, 70 secs
lola: sara is running 75 secs || 11735831 markings, 15767011 edges, 150454 markings/sec, 75 secs
lola: sara is running 80 secs || 12460596 markings, 16775729 edges, 144953 markings/sec, 80 secs
lola: sara is running 85 secs || 13215321 markings, 17770485 edges, 150945 markings/sec, 85 secs
lola: sara is running 90 secs || 13929588 markings, 18759474 edges, 142853 markings/sec, 90 secs
lola: sara is running 95 secs || 14681879 markings, 19749056 edges, 150458 markings/sec, 95 secs
lola: sara is running 100 secs || 15404699 markings, 20745555 edges, 144564 markings/sec, 100 secs
lola: sara is running 105 secs || 16148225 markings, 21737253 edges, 148705 markings/sec, 105 secs
lola: sara is running 110 secs || 16875611 markings, 22726428 edges, 145477 markings/sec, 110 secs
lola: sara is running 115 secs || 17624217 markings, 23727309 edges, 149721 markings/sec, 115 secs
lola: sara is running 120 secs || 18354953 markings, 24722501 edges, 146147 markings/sec, 120 secs
lola: sara is running 125 secs || 19086643 markings, 25718036 edges, 146338 markings/sec, 125 secs
lola: sara is running 130 secs || 19812383 markings, 26690727 edges, 145148 markings/sec, 130 secs
lola: sara is running 135 secs || 20560006 markings, 27706093 edges, 149525 markings/sec, 135 secs
lola: sara is running 140 secs || 21303057 markings, 28691271 edges, 148610 markings/sec, 140 secs
lola: sara is running 145 secs || 22039137 markings, 29708546 edges, 147216 markings/sec, 145 secs
lola: sara is running 150 secs || 22795424 markings, 30700773 edges, 151257 markings/sec, 150 secs
lola: sara is running 155 secs || 23529068 markings, 31720876 edges, 146729 markings/sec, 155 secs
lola: sara is running 160 secs || 24274580 markings, 32709614 edges, 149102 markings/sec, 160 secs
lola: sara is running 165 secs || 25015932 markings, 33729791 edges, 148270 markings/sec, 165 secs
lola: sara is running 170 secs || 25764119 markings, 34716771 edges, 149637 markings/sec, 170 secs
lola: sara is running 175 secs || 26504810 markings, 35741578 edges, 148138 markings/sec, 175 secs
lola: sara is running 180 secs || 27255203 markings, 36730567 edges, 150079 markings/sec, 180 secs
lola: sara is running 185 secs || 27992539 markings, 37748917 edges, 147467 markings/sec, 185 secs
lola: sara is running 190 secs || 28746948 markings, 38745035 edges, 150882 markings/sec, 190 secs
lola: sara is running 195 secs || 29473187 markings, 39755921 edges, 145248 markings/sec, 195 secs
lola: sara is running 200 secs || 30231044 markings, 40755923 edges, 151571 markings/sec, 200 secs
lola: sara is running 205 secs || 30956192 markings, 41757056 edges, 145030 markings/sec, 205 secs
lola: sara is running 210 secs || 31717628 markings, 42762139 edges, 152287 markings/sec, 210 secs
lola: sara is running 215 secs || 32446464 markings, 43760405 edges, 145767 markings/sec, 215 secs
lola: sara is running 220 secs || 33199338 markings, 44763961 edges, 150575 markings/sec, 220 secs
lola: sara is running 225 secs || 33931269 markings, 45760655 edges, 146386 markings/sec, 225 secs
lola: sara is running 230 secs || 34671295 markings, 46767053 edges, 148005 markings/sec, 230 secs
lola: sara is running 235 secs || 35411720 markings, 47760516 edges, 148085 markings/sec, 235 secs
lola: sara is running 240 secs || 36163502 markings, 48780653 edges, 150356 markings/sec, 240 secs
lola: sara is running 245 secs || 36914003 markings, 49777688 edges, 150100 markings/sec, 245 secs
lola: sara is running 250 secs || 37638267 markings, 50781357 edges, 144853 markings/sec, 250 secs
lola: sara is running 255 secs || 38405701 markings, 51787528 edges, 153487 markings/sec, 255 secs
lola: sara is running 260 secs || 39169528 markings, 52846369 edges, 152765 markings/sec, 260 secs
lola: sara is running 265 secs || 39946519 markings, 53873612 edges, 155398 markings/sec, 265 secs
lola: sara is running 270 secs || 40728188 markings, 54954183 edges, 156334 markings/sec, 270 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40879812 markings, 55161406 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes
lola:
preliminary result: no yes yes
lola: memory consumption: 23128 KB
lola: time consumption: 415 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is DES-PT-40b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;