About the Execution of 2020-gold for DES-PT-60a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4282.367 | 3600000.00 | 200462.00 | 9151.10 | FTFFFTFTFTTFFTFT | 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-162039097100075.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-60a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100075
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K 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 88K 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:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:56 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.4K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:54 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 110K 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-60a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620514035025
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 22:47:16] [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 22:47:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:47:16] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-08 22:47:16] [INFO ] Transformed 354 places.
[2021-05-08 22:47:16] [INFO ] Transformed 311 transitions.
[2021-05-08 22:47:16] [INFO ] Found NUPN structural information;
[2021-05-08 22:47:16] [INFO ] Parsed PT model containing 354 places and 311 transitions in 113 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-60a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 219 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1]
FORMULA DES-PT-60a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 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 50 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 297 rows 354 cols
[2021-05-08 22:47:17] [INFO ] Computed 59 place invariants in 29 ms
[2021-05-08 22:47:17] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2021-05-08 22:47:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:17] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-08 22:47:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:47:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2021-05-08 22:47:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2021-05-08 22:47:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:19] [INFO ] [Nat]Absence check using state equation in 1399 ms returned sat
[2021-05-08 22:47:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:47:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:47:19] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 24 ms.
[2021-05-08 22:47:20] [INFO ] Added : 79 causal constraints over 16 iterations in 857 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:47:20] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2021-05-08 22:47:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:20] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2021-05-08 22:47:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:47:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2021-05-08 22:47:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 98 ms returned sat
[2021-05-08 22:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:21] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2021-05-08 22:47:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:47:21] [INFO ] Deduced a trap composed of 13 places in 92 ms
[2021-05-08 22:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2021-05-08 22:47:22] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 25 ms.
[2021-05-08 22:47:22] [INFO ] Added : 91 causal constraints over 19 iterations in 732 ms. Result :sat
[2021-05-08 22:47:22] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2021-05-08 22:47:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 22:47:22] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2021-05-08 22:47:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 22:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:23] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2021-05-08 22:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:47:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:47:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2021-05-08 22:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:24] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2021-05-08 22:47:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:47:24] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 24 ms.
[2021-05-08 22:47:25] [INFO ] Added : 287 causal constraints over 58 iterations in 1859 ms. Result :sat
[2021-05-08 22:47:25] [INFO ] Deduced a trap composed of 10 places in 59 ms
[2021-05-08 22:47:26] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2021-05-08 22:47:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:47:26] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:47:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2021-05-08 22:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:27] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2021-05-08 22:47:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:47:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2021-05-08 22:47:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 60 ms returned sat
[2021-05-08 22:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:28] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2021-05-08 22:47:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:47:28] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 19 ms.
[2021-05-08 22:47:29] [INFO ] Added : 262 causal constraints over 53 iterations in 1482 ms. Result :sat
[2021-05-08 22:47:29] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2021-05-08 22:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 22:47:30] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:47:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 22:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:30] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2021-05-08 22:47:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:47:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:47:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2021-05-08 22:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:47:31] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2021-05-08 22:47:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:47:31] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 18 ms.
[2021-05-08 22:47:32] [INFO ] Added : 117 causal constraints over 24 iterations in 1146 ms. Result :sat
[2021-05-08 22:47:32] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2021-05-08 22:47:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 69200 steps, including 1802 resets, run finished after 351 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 274600 steps, including 6765 resets, run finished after 989 ms. (steps per millisecond=277 ) properties seen :[1, 0, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-60a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 199200 steps, including 4767 resets, run finished after 630 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 46400 steps, including 717 resets, run finished after 153 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 28300 steps, including 269 resets, run finished after 93 ms. (steps per millisecond=304 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 16 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 354 transition count 295
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 353 transition count 294
Applied a total of 11 rules in 84 ms. Remains 353 /354 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/354 places, 294/297 transitions.
Incomplete random walk after 1000000 steps, including 13458 resets, run finished after 3235 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 1188 ms. (steps per millisecond=841 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2320 resets, run finished after 1253 ms. (steps per millisecond=798 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2275 resets, run finished after 1316 ms. (steps per millisecond=759 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2203 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 14270616 steps, run timeout after 30001 ms. (steps per millisecond=475 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 14270616 steps, saw 1770462 distinct states, run finished after 30001 ms. (steps per millisecond=475 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 294 rows 353 cols
[2021-05-08 22:48:12] [INFO ] Computed 61 place invariants in 11 ms
[2021-05-08 22:48:12] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 22:48:12] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2021-05-08 22:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:13] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-08 22:48:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:48:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:48:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 45 ms returned sat
[2021-05-08 22:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:14] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2021-05-08 22:48:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-08 22:48:14] [INFO ] [Nat]Added 5 Read/Feed constraints in 53 ms returned sat
[2021-05-08 22:48:14] [INFO ] Deduced a trap composed of 61 places in 44 ms
[2021-05-08 22:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-08 22:48:14] [INFO ] Computed and/alt/rep : 293/1431/293 causal constraints in 16 ms.
[2021-05-08 22:48:15] [INFO ] Added : 135 causal constraints over 27 iterations in 957 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:48:15] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 22:48:15] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:15] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2021-05-08 22:48:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:48:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:48:15] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 47 ms returned sat
[2021-05-08 22:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:16] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2021-05-08 22:48:16] [INFO ] [Nat]Added 5 Read/Feed constraints in 7 ms returned sat
[2021-05-08 22:48:16] [INFO ] Deduced a trap composed of 70 places in 63 ms
[2021-05-08 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-08 22:48:16] [INFO ] Computed and/alt/rep : 293/1431/293 causal constraints in 14 ms.
[2021-05-08 22:48:17] [INFO ] Added : 200 causal constraints over 40 iterations in 1227 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-08 22:48:17] [INFO ] [Real]Absence check using 36 positive place invariants in 57 ms returned sat
[2021-05-08 22:48:18] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 55 ms returned sat
[2021-05-08 22:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:19] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2021-05-08 22:48:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:48:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:48:19] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 70 ms returned sat
[2021-05-08 22:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:20] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2021-05-08 22:48:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 27 ms returned sat
[2021-05-08 22:48:20] [INFO ] Computed and/alt/rep : 293/1431/293 causal constraints in 18 ms.
[2021-05-08 22:48:21] [INFO ] Added : 205 causal constraints over 41 iterations in 1523 ms. Result :sat
[2021-05-08 22:48:21] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2021-05-08 22:48:21] [INFO ] Deduced a trap composed of 22 places in 97 ms
[2021-05-08 22:48:22] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2021-05-08 22:48:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 470 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:48:22] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 22:48:22] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:22] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-08 22:48:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:48:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:48:22] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 47 ms returned sat
[2021-05-08 22:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:48:23] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2021-05-08 22:48:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 157 ms returned sat
[2021-05-08 22:48:23] [INFO ] Deduced a trap composed of 61 places in 33 ms
[2021-05-08 22:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-08 22:48:23] [INFO ] Computed and/alt/rep : 293/1431/293 causal constraints in 24 ms.
[2021-05-08 22:48:25] [INFO ] Added : 150 causal constraints over 30 iterations in 1441 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 114700 steps, including 1854 resets, run finished after 379 ms. (steps per millisecond=302 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 249600 steps, including 3662 resets, run finished after 799 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195100 steps, including 2381 resets, run finished after 618 ms. (steps per millisecond=315 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 70900 steps, including 1219 resets, run finished after 229 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 16 out of 353 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 22 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 294/294 transitions.
Starting structural reductions, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 18 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 353 cols
[2021-05-08 22:48:27] [INFO ] Computed 61 place invariants in 11 ms
[2021-05-08 22:48:28] [INFO ] Implicit Places using invariants in 934 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 936 ms to find 1 implicit places.
[2021-05-08 22:48:28] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:48:28] [INFO ] Computed 60 place invariants in 9 ms
[2021-05-08 22:48:28] [INFO ] Dead Transitions using invariants and state equation in 700 ms returned []
Starting structural reductions, iteration 1 : 352/353 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2021-05-08 22:48:28] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:48:28] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 22:48:29] [INFO ] Dead Transitions using invariants and state equation in 734 ms returned []
Finished structural reductions, in 2 iterations. Remains : 352/353 places, 294/294 transitions.
Incomplete random walk after 1000000 steps, including 13481 resets, run finished after 3202 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2256 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2328 resets, run finished after 1223 ms. (steps per millisecond=817 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2299 resets, run finished after 1316 ms. (steps per millisecond=759 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2216 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 14394369 steps, run timeout after 30001 ms. (steps per millisecond=479 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 14394369 steps, saw 1783684 distinct states, run finished after 30001 ms. (steps per millisecond=479 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:49:07] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 22:49:07] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:08] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2021-05-08 22:49:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2021-05-08 22:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:08] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2021-05-08 22:49:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:49:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 272 ms returned sat
[2021-05-08 22:49:09] [INFO ] Deduced a trap composed of 61 places in 81 ms
[2021-05-08 22:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2021-05-08 22:49:09] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 14 ms.
[2021-05-08 22:49:10] [INFO ] Added : 138 causal constraints over 28 iterations in 965 ms. Result :sat
[2021-05-08 22:49:10] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2021-05-08 22:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:49:10] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:10] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2021-05-08 22:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:11] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2021-05-08 22:49:11] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:49:11] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 17 ms.
[2021-05-08 22:49:13] [INFO ] Added : 289 causal constraints over 58 iterations in 1494 ms. Result :sat
[2021-05-08 22:49:13] [INFO ] Deduced a trap composed of 68 places in 112 ms
[2021-05-08 22:49:13] [INFO ] Deduced a trap composed of 66 places in 147 ms
[2021-05-08 22:49:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:49:13] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:14] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2021-05-08 22:49:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2021-05-08 22:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:15] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2021-05-08 22:49:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-08 22:49:15] [INFO ] Deduced a trap composed of 61 places in 32 ms
[2021-05-08 22:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-08 22:49:15] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 14 ms.
[2021-05-08 22:49:17] [INFO ] Added : 206 causal constraints over 42 iterations in 1596 ms. Result :sat
[2021-05-08 22:49:17] [INFO ] Deduced a trap composed of 7 places in 96 ms
[2021-05-08 22:49:17] [INFO ] Deduced a trap composed of 16 places in 91 ms
[2021-05-08 22:49:17] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2021-05-08 22:49:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 415 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 22:49:17] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 22:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:18] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2021-05-08 22:49:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:49:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2021-05-08 22:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:19] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2021-05-08 22:49:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 163 ms returned sat
[2021-05-08 22:49:20] [INFO ] Deduced a trap composed of 76 places in 74 ms
[2021-05-08 22:49:20] [INFO ] Deduced a trap composed of 61 places in 29 ms
[2021-05-08 22:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2021-05-08 22:49:20] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 17 ms.
[2021-05-08 22:49:21] [INFO ] Added : 158 causal constraints over 32 iterations in 1212 ms. Result :sat
[2021-05-08 22:49:21] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2021-05-08 22:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 231000 steps, including 3407 resets, run finished after 762 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 254100 steps, including 3740 resets, run finished after 825 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 293500 steps, including 4320 resets, run finished after 929 ms. (steps per millisecond=315 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 215800 steps, including 3202 resets, run finished after 684 ms. (steps per millisecond=315 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:49:24] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:49:25] [INFO ] Implicit Places using invariants in 1001 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:49:25] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 22:49:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:49:29] [INFO ] Implicit Places using invariants and state equation in 3407 ms returned []
Implicit Place search using SMT with State Equation took 4410 ms to find 0 implicit places.
[2021-05-08 22:49:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:49:29] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 22:49:29] [INFO ] Dead Transitions using invariants and state equation in 729 ms returned []
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 100000 steps, including 1360 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:49:30] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:49:30] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 22:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:30] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2021-05-08 22:49:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2021-05-08 22:49:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2021-05-08 22:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:31] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2021-05-08 22:49:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:49:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 272 ms returned sat
[2021-05-08 22:49:31] [INFO ] Deduced a trap composed of 61 places in 74 ms
[2021-05-08 22:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2021-05-08 22:49:31] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 18 ms.
[2021-05-08 22:49:32] [INFO ] Added : 138 causal constraints over 28 iterations in 991 ms. Result :sat
[2021-05-08 22:49:32] [INFO ] Deduced a trap composed of 12 places in 93 ms
[2021-05-08 22:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2021-05-08 22:49:32] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 22:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:33] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2021-05-08 22:49:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:34] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2021-05-08 22:49:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 8 ms returned sat
[2021-05-08 22:49:34] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 19 ms.
[2021-05-08 22:49:35] [INFO ] Added : 289 causal constraints over 58 iterations in 1494 ms. Result :sat
[2021-05-08 22:49:35] [INFO ] Deduced a trap composed of 68 places in 112 ms
[2021-05-08 22:49:35] [INFO ] Deduced a trap composed of 66 places in 98 ms
[2021-05-08 22:49:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2021-05-08 22:49:36] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:37] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2021-05-08 22:49:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 75 ms returned sat
[2021-05-08 22:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:38] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2021-05-08 22:49:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-08 22:49:38] [INFO ] Deduced a trap composed of 61 places in 27 ms
[2021-05-08 22:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-08 22:49:38] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 17 ms.
[2021-05-08 22:49:39] [INFO ] Added : 206 causal constraints over 42 iterations in 1659 ms. Result :sat
[2021-05-08 22:49:39] [INFO ] Deduced a trap composed of 7 places in 100 ms
[2021-05-08 22:49:40] [INFO ] Deduced a trap composed of 16 places in 101 ms
[2021-05-08 22:49:40] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2021-05-08 22:49:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 419 ms
[2021-05-08 22:49:40] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2021-05-08 22:49:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2021-05-08 22:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:40] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2021-05-08 22:49:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2021-05-08 22:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:42] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2021-05-08 22:49:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 165 ms returned sat
[2021-05-08 22:49:42] [INFO ] Deduced a trap composed of 76 places in 70 ms
[2021-05-08 22:49:42] [INFO ] Deduced a trap composed of 61 places in 37 ms
[2021-05-08 22:49:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2021-05-08 22:49:42] [INFO ] Computed and/alt/rep : 293/1427/293 causal constraints in 18 ms.
[2021-05-08 22:49:43] [INFO ] Added : 158 causal constraints over 32 iterations in 1221 ms. Result :sat
[2021-05-08 22:49:43] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2021-05-08 22:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 352 cols
[2021-05-08 22:49:43] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 22:49:43] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:44] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2021-05-08 22:49:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-08 22:49:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2021-05-08 22:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:45] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2021-05-08 22:49:45] [INFO ] Computed and/alt/rep : 293/1422/293 causal constraints in 16 ms.
[2021-05-08 22:49:46] [INFO ] Added : 141 causal constraints over 29 iterations in 1303 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:49:46] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:47] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2021-05-08 22:49:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:49:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 22:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:47] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2021-05-08 22:49:47] [INFO ] Computed and/alt/rep : 293/1422/293 causal constraints in 15 ms.
[2021-05-08 22:49:49] [INFO ] Added : 284 causal constraints over 57 iterations in 1679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 22:49:49] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:50] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2021-05-08 22:49:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:49:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 75 ms returned sat
[2021-05-08 22:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:51] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2021-05-08 22:49:51] [INFO ] Computed and/alt/rep : 293/1422/293 causal constraints in 15 ms.
[2021-05-08 22:49:53] [INFO ] Added : 262 causal constraints over 53 iterations in 2091 ms. Result :sat
[2021-05-08 22:49:53] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2021-05-08 22:49:53] [INFO ] Deduced a trap composed of 66 places in 40 ms
[2021-05-08 22:49:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:49:53] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-08 22:49:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 22:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:54] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2021-05-08 22:49:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:49:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-08 22:49:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2021-05-08 22:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:49:55] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2021-05-08 22:49:55] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2021-05-08 22:49:55] [INFO ] Deduced a trap composed of 14 places in 58 ms
[2021-05-08 22:49:55] [INFO ] Deduced a trap composed of 15 places in 57 ms
[2021-05-08 22:49:55] [INFO ] Deduced a trap composed of 13 places in 36 ms
[2021-05-08 22:49:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 295 ms
[2021-05-08 22:49:55] [INFO ] Computed and/alt/rep : 293/1422/293 causal constraints in 17 ms.
[2021-05-08 22:49:57] [INFO ] Added : 148 causal constraints over 30 iterations in 1745 ms. Result :sat
[2021-05-08 22:49:57] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2021-05-08 22:49:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:49:57] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-08 22:49:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2021-05-08 22:49:58] [INFO ] Flatten gal took : 79 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-60a @ 3570 seconds
FORMULA DES-PT-60a-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60a-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60a-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE 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-60a
{
"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 22:49:59 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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 <= p112))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 8976,
"markings": 7814,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p48)) AND ((p117 <= 0)))))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"edges": 574,
"markings": 575,
"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": 1783
},
"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 <= p124)) AND ((p296 <= 0)) AND ((p63 <= 0)))))",
"processed_size": 58,
"rewrites": 1
},
"result":
{
"edges": 2739,
"markings": 2690,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"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 (((((p194 <= 0)) OR ((1 <= p100))) AND (((p31 <= 0)) OR ((1 <= p226)) OR ((p185 <= 0)) OR ((1 <= p19)) OR ((p175 <= 0)) OR ((1 <= p314)) OR ((p328 <= 0)) OR ((1 <= p286))))))",
"processed_size": 187,
"rewrites": 2
},
"result":
{
"edges": 2320,
"markings": 2261,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 23396,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 1452,
"conflict_clusters": 40,
"places": 352,
"places_significant": 292,
"singleton_clusters": 0,
"transitions": 294
},
"result":
{
"preliminary_value": "yes yes no yes ",
"value": "yes yes no 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: 646/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 352 places, 294 transitions, 292 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: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: E (F (((1 <= p112)))) : E (F ((((1 <= p124)) AND ((p296 <= 0)) AND ((p63 <= 0))))) : A (G (((((p194 <= 0)) OR ((1 <= p100))) AND (((p31 <= 0)) OR ((1 <= p226)) OR ((p185 <= 0)) OR ((1 <= p19)) OR ((p175 <= 0)) OR ((1 <= p314)) OR ((p328 <= 0)) OR ((1 <= p286)))))) : E (F ((((1 <= p48)) AND ((p117 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p112))))
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 <= p112))))
lola: processed formula length: 21
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 <= p112))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7814 markings, 8976 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p48)) AND ((p117 <= 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 <= p48)) AND ((p117 <= 0)))))
lola: processed formula length: 40
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 <= p48)) AND ((p117 <= 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: 575 markings, 574 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p124)) AND ((p296 <= 0)) AND ((p63 <= 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 <= p124)) AND ((p296 <= 0)) AND ((p63 <= 0)))))
lola: processed formula length: 58
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 <= p124)) AND ((p296 <= 0)) AND ((p63 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: The predicate is reachable.
lola: 2690 markings, 2739 edges
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p194 <= 0)) OR ((1 <= p100))) AND (((p31 <= 0)) OR ((1 <= p226)) OR ((p185 <= 0)) OR ((1 <= p19)) OR ((p175 <= 0)) OR ((1 <= p314)) OR ((p328 <= 0)) OR ((1 <= p286))))))
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 (((((p194 <= 0)) OR ((1 <= p100))) AND (((p31 <= 0)) OR ((1 <= p226)) OR ((p185 <= 0)) OR ((1 <= p19)) OR ((p175 <= 0)) OR ((1 <= p314)) OR ((p328 <= 0)) OR ((1 <= p286))))))
lola: processed formula length: 187
lola: 2 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: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 <= p194)) AND ((p100 <= 0))) OR (((1 <= p31)) AND ((p226 <= 0)) AND ((1 <= p185)) AND ((p19 <= 0)) AND ((1 <= p175)) AND ((p314 <= 0)) AND ((1 <= p328)) AND ((p286 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2261 markings, 2320 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes
lola:
preliminary result: yes yes no yes
lola: memory consumption: 23396 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
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16120192 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16119868 kB
--------------------
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-60a"
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-60a, 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-162039097100075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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 ;