About the Execution of 2020-gold for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4285.792 | 3600000.00 | 336768.00 | 676.60 | FTTFTTFTFFTTFFTT | 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-162039097100072.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-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.0K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 127K 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-50b-ReachabilityFireability-00
FORMULA_NAME DES-PT-50b-ReachabilityFireability-01
FORMULA_NAME DES-PT-50b-ReachabilityFireability-02
FORMULA_NAME DES-PT-50b-ReachabilityFireability-03
FORMULA_NAME DES-PT-50b-ReachabilityFireability-04
FORMULA_NAME DES-PT-50b-ReachabilityFireability-05
FORMULA_NAME DES-PT-50b-ReachabilityFireability-06
FORMULA_NAME DES-PT-50b-ReachabilityFireability-07
FORMULA_NAME DES-PT-50b-ReachabilityFireability-08
FORMULA_NAME DES-PT-50b-ReachabilityFireability-09
FORMULA_NAME DES-PT-50b-ReachabilityFireability-10
FORMULA_NAME DES-PT-50b-ReachabilityFireability-11
FORMULA_NAME DES-PT-50b-ReachabilityFireability-12
FORMULA_NAME DES-PT-50b-ReachabilityFireability-13
FORMULA_NAME DES-PT-50b-ReachabilityFireability-14
FORMULA_NAME DES-PT-50b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620513709042
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 22:41:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 22:41:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:41:51] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2021-05-08 22:41:51] [INFO ] Transformed 479 places.
[2021-05-08 22:41:51] [INFO ] Transformed 430 transitions.
[2021-05-08 22:41:51] [INFO ] Found NUPN structural information;
[2021-05-08 22:41:51] [INFO ] Parsed PT model containing 479 places and 430 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 88 resets, run finished after 115 ms. (steps per millisecond=86 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0]
FORMULA DES-PT-50b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 430 rows 479 cols
[2021-05-08 22:41:51] [INFO ] Computed 65 place invariants in 37 ms
[2021-05-08 22:41:51] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2021-05-08 22:41:51] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:52] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 12 places in 273 ms
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 20 places in 230 ms
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 17 places in 162 ms
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 14 places in 189 ms
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 34 places in 139 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 29 places in 143 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 18 places in 110 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 19 places in 138 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 33 places in 128 ms
[2021-05-08 22:41:54] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2021-05-08 22:41:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2142 ms
[2021-05-08 22:41:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 52 ms returned sat
[2021-05-08 22:41:55] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 22:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:55] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2021-05-08 22:41:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 627 ms
[2021-05-08 22:41:56] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 31 ms.
[2021-05-08 22:41:59] [INFO ] Added : 341 causal constraints over 69 iterations in 2593 ms. Result :sat
[2021-05-08 22:41:59] [INFO ] Deduced a trap composed of 24 places in 145 ms
[2021-05-08 22:41:59] [INFO ] Deduced a trap composed of 34 places in 133 ms
[2021-05-08 22:41:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-08 22:41:59] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2021-05-08 22:41:59] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 22:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:01] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2021-05-08 22:42:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 47 ms returned sat
[2021-05-08 22:42:01] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 63 ms returned sat
[2021-05-08 22:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:02] [INFO ] [Nat]Absence check using state equation in 1464 ms returned sat
[2021-05-08 22:42:02] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 25 ms.
[2021-05-08 22:42:06] [INFO ] Added : 409 causal constraints over 82 iterations in 3354 ms. Result :unknown
[2021-05-08 22:42:06] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2021-05-08 22:42:06] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:07] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2021-05-08 22:42:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 85 ms returned sat
[2021-05-08 22:42:07] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 22:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:08] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 12 places in 117 ms
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 38 places in 140 ms
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 15 places in 94 ms
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 13 places in 90 ms
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2021-05-08 22:42:09] [INFO ] Deduced a trap composed of 58 places in 112 ms
[2021-05-08 22:42:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 974 ms
[2021-05-08 22:42:09] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 23 ms.
[2021-05-08 22:42:11] [INFO ] Added : 327 causal constraints over 66 iterations in 2574 ms. Result :sat
[2021-05-08 22:42:11] [INFO ] Deduced a trap composed of 48 places in 119 ms
[2021-05-08 22:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:42:12] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2021-05-08 22:42:12] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:12] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2021-05-08 22:42:12] [INFO ] Deduced a trap composed of 15 places in 123 ms
[2021-05-08 22:42:13] [INFO ] Deduced a trap composed of 12 places in 131 ms
[2021-05-08 22:42:13] [INFO ] Deduced a trap composed of 24 places in 117 ms
[2021-05-08 22:42:13] [INFO ] Deduced a trap composed of 30 places in 118 ms
[2021-05-08 22:42:13] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2021-05-08 22:42:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 686 ms
[2021-05-08 22:42:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 85 ms returned sat
[2021-05-08 22:42:13] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 42 ms returned sat
[2021-05-08 22:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:14] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2021-05-08 22:42:14] [INFO ] Deduced a trap composed of 10 places in 140 ms
[2021-05-08 22:42:14] [INFO ] Deduced a trap composed of 12 places in 136 ms
[2021-05-08 22:42:14] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2021-05-08 22:42:15] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2021-05-08 22:42:15] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2021-05-08 22:42:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 726 ms
[2021-05-08 22:42:15] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 22 ms.
[2021-05-08 22:42:17] [INFO ] Added : 330 causal constraints over 67 iterations in 2601 ms. Result :sat
[2021-05-08 22:42:17] [INFO ] Deduced a trap composed of 46 places in 124 ms
[2021-05-08 22:42:18] [INFO ] Deduced a trap composed of 36 places in 123 ms
[2021-05-08 22:42:18] [INFO ] Deduced a trap composed of 55 places in 115 ms
[2021-05-08 22:42:18] [INFO ] Deduced a trap composed of 55 places in 112 ms
[2021-05-08 22:42:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 625 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:42:18] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2021-05-08 22:42:18] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 22:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:19] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2021-05-08 22:42:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2021-05-08 22:42:19] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 22:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:20] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2021-05-08 22:42:20] [INFO ] Deduced a trap composed of 8 places in 135 ms
[2021-05-08 22:42:20] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2021-05-08 22:42:20] [INFO ] Deduced a trap composed of 21 places in 71 ms
[2021-05-08 22:42:20] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2021-05-08 22:42:20] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2021-05-08 22:42:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 582 ms
[2021-05-08 22:42:20] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 27 ms.
[2021-05-08 22:42:23] [INFO ] Added : 360 causal constraints over 73 iterations in 2939 ms. Result :sat
[2021-05-08 22:42:23] [INFO ] Deduced a trap composed of 68 places in 111 ms
[2021-05-08 22:42:24] [INFO ] Deduced a trap composed of 53 places in 105 ms
[2021-05-08 22:42:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 22:42:24] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2021-05-08 22:42:24] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 12 ms returned unsat
[2021-05-08 22:42:24] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2021-05-08 22:42:24] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 22:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:25] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2021-05-08 22:42:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 87 ms returned sat
[2021-05-08 22:42:25] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 22:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:26] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2021-05-08 22:42:26] [INFO ] Deduced a trap composed of 17 places in 134 ms
[2021-05-08 22:42:26] [INFO ] Deduced a trap composed of 16 places in 116 ms
[2021-05-08 22:42:26] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2021-05-08 22:42:26] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2021-05-08 22:42:27] [INFO ] Deduced a trap composed of 20 places in 60 ms
[2021-05-08 22:42:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 589 ms
[2021-05-08 22:42:27] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 23 ms.
[2021-05-08 22:42:29] [INFO ] Added : 345 causal constraints over 70 iterations in 2893 ms. Result :sat
[2021-05-08 22:42:30] [INFO ] Deduced a trap composed of 45 places in 117 ms
[2021-05-08 22:42:30] [INFO ] Deduced a trap composed of 55 places in 107 ms
[2021-05-08 22:42:30] [INFO ] Deduced a trap composed of 41 places in 115 ms
[2021-05-08 22:42:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s157 s222 s224 s226 s244 s245 s248 s250 s252 s253 s269 s270 s286 s287 s294 s300 s303 s404 s405 s406 s407 s428 s429 s430 s433 s436 s437 s438 s439 s440 s442 s443 s445 s446 s447 s448 s449 s450 s454) 0)") while checking expression at index 6
[2021-05-08 22:42:30] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2021-05-08 22:42:30] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 22:42:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:31] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2021-05-08 22:42:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2021-05-08 22:42:31] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 22:42:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:32] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2021-05-08 22:42:32] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2021-05-08 22:42:32] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2021-05-08 22:42:32] [INFO ] Deduced a trap composed of 38 places in 126 ms
[2021-05-08 22:42:33] [INFO ] Deduced a trap composed of 39 places in 134 ms
[2021-05-08 22:42:33] [INFO ] Deduced a trap composed of 40 places in 133 ms
[2021-05-08 22:42:33] [INFO ] Deduced a trap composed of 69 places in 125 ms
[2021-05-08 22:42:33] [INFO ] Deduced a trap composed of 18 places in 161 ms
[2021-05-08 22:42:33] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2021-05-08 22:42:33] [INFO ] Deduced a trap composed of 20 places in 151 ms
[2021-05-08 22:42:34] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2021-05-08 22:42:34] [INFO ] Deduced a trap composed of 8 places in 153 ms
[2021-05-08 22:42:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1853 ms
[2021-05-08 22:42:34] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 20 ms.
[2021-05-08 22:42:36] [INFO ] Added : 275 causal constraints over 55 iterations in 2094 ms. Result :(error "Failed to check-sat")
[2021-05-08 22:42:36] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2021-05-08 22:42:36] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 6 ms returned unsat
[2021-05-08 22:42:36] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned unsat
FORMULA DES-PT-50b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 502500 steps, including 5330 resets, run finished after 1707 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 547500 steps, including 5788 resets, run finished after 1676 ms. (steps per millisecond=326 ) properties seen :[0, 1, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-50b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 487500 steps, including 5088 resets, run finished after 1514 ms. (steps per millisecond=321 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 735600 steps, including 7605 resets, run finished after 2243 ms. (steps per millisecond=327 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 582800 steps, including 6083 resets, run finished after 1744 ms. (steps per millisecond=334 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 20 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (complete) has 1098 edges and 479 vertex of which 470 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 470 transition count 408
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 452 transition count 408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 38 place count 452 transition count 401
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 445 transition count 401
Symmetric choice reduction at 2 with 17 rule applications. Total rules 69 place count 445 transition count 401
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 103 place count 428 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 103 place count 428 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 427 transition count 383
Symmetric choice reduction at 2 with 14 rule applications. Total rules 119 place count 427 transition count 383
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 147 place count 413 transition count 369
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 161 place count 413 transition count 355
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 164 place count 411 transition count 354
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 164 place count 411 transition count 352
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 409 transition count 352
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 314 place count 336 transition count 279
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 318 place count 334 transition count 281
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 334 transition count 279
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 322 place count 332 transition count 279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 332 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 324 place count 331 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 325 place count 330 transition count 277
Applied a total of 325 rules in 244 ms. Remains 330 /479 variables (removed 149) and now considering 277/430 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 330/479 places, 277/430 transitions.
Incomplete random walk after 1000000 steps, including 38755 resets, run finished after 3559 ms. (steps per millisecond=280 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7970 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7795 resets, run finished after 1220 ms. (steps per millisecond=819 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7916 resets, run finished after 1204 ms. (steps per millisecond=830 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8076 resets, run finished after 1351 ms. (steps per millisecond=740 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8184 resets, run finished after 1335 ms. (steps per millisecond=749 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8193 resets, run finished after 1288 ms. (steps per millisecond=776 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 15592729 steps, run timeout after 30001 ms. (steps per millisecond=519 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 15592729 steps, saw 1926289 distinct states, run finished after 30001 ms. (steps per millisecond=519 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 277 rows 330 cols
[2021-05-08 22:43:26] [INFO ] Computed 59 place invariants in 9 ms
[2021-05-08 22:43:26] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:27] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2021-05-08 22:43:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:27] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2021-05-08 22:43:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 22:43:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:43:27] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 15 ms.
[2021-05-08 22:43:29] [INFO ] Added : 186 causal constraints over 38 iterations in 1439 ms. Result :sat
[2021-05-08 22:43:29] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2021-05-08 22:43:29] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2021-05-08 22:43:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 22:43:29] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:29] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-08 22:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:43:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 89 ms returned sat
[2021-05-08 22:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:30] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2021-05-08 22:43:30] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:43:30] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:43:32] [INFO ] Added : 222 causal constraints over 46 iterations in 1742 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 22:43:32] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:32] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2021-05-08 22:43:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2021-05-08 22:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:33] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2021-05-08 22:43:33] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:43:33] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 13 ms.
[2021-05-08 22:43:35] [INFO ] Added : 174 causal constraints over 35 iterations in 1664 ms. Result :sat
[2021-05-08 22:43:35] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2021-05-08 22:43:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:43:35] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2021-05-08 22:43:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 22:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:36] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2021-05-08 22:43:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:43:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 3287 ms returned sat
[2021-05-08 22:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:40] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2021-05-08 22:43:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:43:40] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:43:42] [INFO ] Added : 221 causal constraints over 45 iterations in 2158 ms. Result :sat
[2021-05-08 22:43:42] [INFO ] Deduced a trap composed of 20 places in 41 ms
[2021-05-08 22:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:43:43] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:43:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:43] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2021-05-08 22:43:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 410 ms returned sat
[2021-05-08 22:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:45] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2021-05-08 22:43:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:43:45] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 17 ms.
[2021-05-08 22:43:46] [INFO ] Added : 236 causal constraints over 48 iterations in 1691 ms. Result :sat
[2021-05-08 22:43:46] [INFO ] Deduced a trap composed of 21 places in 61 ms
[2021-05-08 22:43:46] [INFO ] Deduced a trap composed of 21 places in 60 ms
[2021-05-08 22:43:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-08 22:43:47] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:47] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2021-05-08 22:43:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 190 ms returned sat
[2021-05-08 22:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:48] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-08 22:43:48] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:43:48] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2021-05-08 22:43:48] [INFO ] Deduced a trap composed of 7 places in 26 ms
[2021-05-08 22:43:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2021-05-08 22:43:48] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:43:49] [INFO ] Added : 216 causal constraints over 44 iterations in 1241 ms. Result :sat
[2021-05-08 22:43:49] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2021-05-08 22:43:50] [INFO ] Deduced a trap composed of 24 places in 37 ms
[2021-05-08 22:43:50] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2021-05-08 22:43:50] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2021-05-08 22:43:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 309 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 242800 steps, including 11201 resets, run finished after 896 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 239000 steps, including 11105 resets, run finished after 899 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 249600 steps, including 11529 resets, run finished after 927 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 110200 steps, including 5020 resets, run finished after 401 ms. (steps per millisecond=274 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 189700 steps, including 8669 resets, run finished after 695 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 130900 steps, including 6015 resets, run finished after 479 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 20 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 277/277 transitions.
Applied a total of 0 rules in 15 ms. Remains 330 /330 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 330/330 places, 277/277 transitions.
Starting structural reductions, iteration 0 : 330/330 places, 277/277 transitions.
Applied a total of 0 rules in 14 ms. Remains 330 /330 variables (removed 0) and now considering 277/277 (removed 0) transitions.
// Phase 1: matrix 277 rows 330 cols
[2021-05-08 22:43:54] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-08 22:43:55] [INFO ] Implicit Places using invariants in 772 ms returned []
// Phase 1: matrix 277 rows 330 cols
[2021-05-08 22:43:55] [INFO ] Computed 59 place invariants in 7 ms
[2021-05-08 22:43:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 22:43:57] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2448 ms to find 0 implicit places.
[2021-05-08 22:43:57] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 277 rows 330 cols
[2021-05-08 22:43:57] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-08 22:43:57] [INFO ] Dead Transitions using invariants and state equation in 567 ms returned []
Finished structural reductions, in 1 iterations. Remains : 330/330 places, 277/277 transitions.
Incomplete random walk after 100000 steps, including 3894 resets, run finished after 361 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 277 rows 330 cols
[2021-05-08 22:43:58] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-08 22:43:58] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:43:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:58] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-08 22:43:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:43:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:43:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 86 ms returned sat
[2021-05-08 22:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:43:59] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2021-05-08 22:43:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 22:43:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:43:59] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:44:00] [INFO ] Added : 186 causal constraints over 38 iterations in 1457 ms. Result :sat
[2021-05-08 22:44:00] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2021-05-08 22:44:00] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2021-05-08 22:44:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2021-05-08 22:44:00] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:01] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-08 22:44:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2021-05-08 22:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:01] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2021-05-08 22:44:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:44:01] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 13 ms.
[2021-05-08 22:44:03] [INFO ] Added : 222 causal constraints over 46 iterations in 1737 ms. Result :sat
[2021-05-08 22:44:03] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:04] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-08 22:44:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:04] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2021-05-08 22:44:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:44:04] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:44:06] [INFO ] Added : 174 causal constraints over 35 iterations in 1566 ms. Result :sat
[2021-05-08 22:44:06] [INFO ] Deduced a trap composed of 14 places in 31 ms
[2021-05-08 22:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2021-05-08 22:44:06] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2021-05-08 22:44:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:07] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2021-05-08 22:44:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 3547 ms returned sat
[2021-05-08 22:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:11] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2021-05-08 22:44:11] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:44:11] [INFO ] Deduced a trap composed of 19 places in 70 ms
[2021-05-08 22:44:11] [INFO ] Deduced a trap composed of 21 places in 71 ms
[2021-05-08 22:44:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2021-05-08 22:44:11] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:44:13] [INFO ] Added : 178 causal constraints over 36 iterations in 1511 ms. Result :sat
[2021-05-08 22:44:13] [INFO ] Deduced a trap composed of 21 places in 51 ms
[2021-05-08 22:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2021-05-08 22:44:13] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:14] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2021-05-08 22:44:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 410 ms returned sat
[2021-05-08 22:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:15] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2021-05-08 22:44:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:44:15] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:44:17] [INFO ] Added : 236 causal constraints over 48 iterations in 1661 ms. Result :sat
[2021-05-08 22:44:17] [INFO ] Deduced a trap composed of 21 places in 58 ms
[2021-05-08 22:44:17] [INFO ] Deduced a trap composed of 21 places in 58 ms
[2021-05-08 22:44:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2021-05-08 22:44:17] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2021-05-08 22:44:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:17] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2021-05-08 22:44:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 190 ms returned sat
[2021-05-08 22:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:18] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-08 22:44:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:44:18] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2021-05-08 22:44:18] [INFO ] Deduced a trap composed of 7 places in 26 ms
[2021-05-08 22:44:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2021-05-08 22:44:18] [INFO ] Computed and/alt/rep : 274/1490/274 causal constraints in 14 ms.
[2021-05-08 22:44:20] [INFO ] Added : 216 causal constraints over 44 iterations in 1262 ms. Result :sat
[2021-05-08 22:44:20] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2021-05-08 22:44:20] [INFO ] Deduced a trap composed of 24 places in 37 ms
[2021-05-08 22:44:20] [INFO ] Deduced a trap composed of 20 places in 35 ms
[2021-05-08 22:44:20] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2021-05-08 22:44:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 288 ms
Applied a total of 0 rules in 11 ms. Remains 330 /330 variables (removed 0) and now considering 277/277 (removed 0) transitions.
// Phase 1: matrix 277 rows 330 cols
[2021-05-08 22:44:20] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-08 22:44:20] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:20] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-08 22:44:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:44:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:21] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2021-05-08 22:44:21] [INFO ] Computed and/alt/rep : 274/1470/274 causal constraints in 14 ms.
[2021-05-08 22:44:22] [INFO ] Added : 190 causal constraints over 38 iterations in 1450 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:44:23] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:23] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-08 22:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:24] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2021-05-08 22:44:24] [INFO ] Computed and/alt/rep : 274/1470/274 causal constraints in 19 ms.
[2021-05-08 22:44:26] [INFO ] Added : 224 causal constraints over 45 iterations in 2183 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:44:26] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 22:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:26] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2021-05-08 22:44:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 22:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:27] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2021-05-08 22:44:27] [INFO ] Deduced a trap composed of 5 places in 37 ms
[2021-05-08 22:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-08 22:44:27] [INFO ] Computed and/alt/rep : 274/1470/274 causal constraints in 13 ms.
[2021-05-08 22:44:29] [INFO ] Added : 179 causal constraints over 37 iterations in 2087 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:44:29] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:30] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-08 22:44:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 4219 ms returned sat
[2021-05-08 22:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:35] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2021-05-08 22:44:35] [INFO ] Computed and/alt/rep : 274/1470/274 causal constraints in 14 ms.
[2021-05-08 22:44:36] [INFO ] Added : 209 causal constraints over 42 iterations in 1331 ms. Result :sat
[2021-05-08 22:44:37] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2021-05-08 22:44:37] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2021-05-08 22:44:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:44:37] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:37] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-08 22:44:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 410 ms returned sat
[2021-05-08 22:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:39] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2021-05-08 22:44:39] [INFO ] Computed and/alt/rep : 274/1470/274 causal constraints in 14 ms.
[2021-05-08 22:44:42] [INFO ] Added : 237 causal constraints over 48 iterations in 2958 ms. Result :sat
[2021-05-08 22:44:42] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2021-05-08 22:44:42] [INFO ] Deduced a trap composed of 21 places in 46 ms
[2021-05-08 22:44:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 22:44:42] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:44:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:42] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2021-05-08 22:44:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:44:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:44:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 190 ms returned sat
[2021-05-08 22:44:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:44:43] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-08 22:44:43] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2021-05-08 22:44:43] [INFO ] Deduced a trap composed of 7 places in 37 ms
[2021-05-08 22:44:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2021-05-08 22:44:43] [INFO ] Computed and/alt/rep : 274/1470/274 causal constraints in 14 ms.
[2021-05-08 22:44:45] [INFO ] Added : 213 causal constraints over 43 iterations in 1433 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:44:45] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-08 22:44:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
[2021-05-08 22:44:45] [INFO ] Flatten gal took : 102 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-50b @ 3570 seconds
FORMULA DES-PT-50b-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-50b-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3433
rslt: Output for ReachabilityFireability @ DES-PT-50b
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 22:44:46 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p29) AND (1 <= p241))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 17153190,
"markings": 12824759,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((p66 <= 0) OR (p325 <= 0))))",
"processed_size": 36,
"rewrites": 2
},
"result":
{
"edges": 16902704,
"markings": 14984930,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 864
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p81) AND (1 <= p325))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 6440084,
"markings": 5748380,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1145
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p171) AND (1 <= p204) AND ((p195 <= 0)) AND ((p223 <= 0) OR (p218 <= 0)))))",
"processed_size": 89,
"rewrites": 1
},
"result":
{
"edges": 32053,
"markings": 29404,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1718
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p181) AND (1 <= p204) AND (1 <= p148) AND (1 <= p237)) OR ((1 <= p164) AND ((p232 <= 0)) AND (1 <= p204)))))",
"processed_size": 123,
"rewrites": 1
},
"result":
{
"edges": 46440,
"markings": 41234,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((p220 <= 0) OR (p170 <= 0) OR (p204 <= 0) OR ((1 <= p277)) OR (((p280 <= 0)) AND ((p146 <= 0) OR (p237 <= 0))))))",
"processed_size": 125,
"rewrites": 2
},
"result":
{
"edges": 1059088,
"markings": 865168,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 26916,
"runtime": 137.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1286,
"conflict_clusters": 62,
"places": 330,
"places_significant": 271,
"singleton_clusters": 0,
"transitions": 277
},
"result":
{
"preliminary_value": "yes no yes no yes yes ",
"value": "yes no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 607/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 330
lola: finding significant places
lola: 330 places, 277 transitions, 271 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: E (F (((1 <= p29) AND (1 <= p241)))) : A (G (((p66 <= 0) OR (p325 <= 0)))) : E (F (((1 <= p81) AND (1 <= p325)))) : A (G (((p220 <= 0) OR (p170 <= 0) OR (p204 <= 0) OR ((1 <= p277)) OR (((p280 <= 0)) AND ((p146 <= 0) OR (p237 <= 0)))))) : E (F ((((1 <= p181) AND (1 <= p204) AND (1 <= p148) AND (1 <= p237)) OR ((1 <= p164) AND ((p232 <= 0)) AND (1 <= p204))))) : E (F (((1 <= p171) AND (1 <= p204) AND ((p195 <= 0)) AND ((p223 <= 0) OR (p218 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p29) AND (1 <= p241))))
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 <= p29) AND (1 <= p241))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p29) AND (1 <= p241))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :1231: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1173191 markings, 1523390 edges, 234638 markings/sec, 0 secs
lola: sara is running 5 secs || 2311970 markings, 3045701 edges, 227756 markings/sec, 5 secs
lola: sara is running 10 secs || 3441762 markings, 4550836 edges, 225958 markings/sec, 10 secs
lola: sara is running 15 secs || 4567509 markings, 6043107 edges, 225149 markings/sec, 15 secs
lola: sara is running 20 secs || 5683099 markings, 7535325 edges, 223118 markings/sec, 20 secs
lola: sara is running 25 secs || 6797246 markings, 9038233 edges, 222829 markings/sec, 25 secs
lola: sara is running 30 secs || 7907936 markings, 10537896 edges, 222138 markings/sec, 30 secs
lola: sara is running 35 secs || 9020099 markings, 12041838 edges, 222433 markings/sec, 35 secs
lola: sara is running 40 secs || 10142570 markings, 13536500 edges, 224494 markings/sec, 40 secs
lola: sara is running 45 secs || 11264998 markings, 15032882 edges, 224486 markings/sec, 45 secs
lola: sara is running 50 secs || 12384781 markings, 16543816 edges, 223957 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12824759 markings, 17153190 edges
lola: ========================================
lola: subprocess 1 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p66 <= 0) OR (p325 <= 0))))
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 (((p66 <= 0) OR (p325 <= 0))))
lola: processed formula length: 36
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p66) AND (1 <= p325))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :1231: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1486099 markings, 1629411 edges, 297220 markings/sec, 0 secs
lola: sara is running 5 secs || 2924750 markings, 3244112 edges, 287730 markings/sec, 5 secs
lola: sara is running 10 secs || 4349693 markings, 4857372 edges, 284989 markings/sec, 10 secs
lola: sara is running 15 secs || 5777151 markings, 6471165 edges, 285492 markings/sec, 15 secs
lola: sara is running 20 secs || 7208204 markings, 8096094 edges, 286211 markings/sec, 20 secs
lola: sara is running 25 secs || 8641555 markings, 9718648 edges, 286670 markings/sec, 25 secs
lola: sara is running 30 secs || 10070694 markings, 11335454 edges, 285828 markings/sec, 30 secs
lola: sara is running 35 secs || 11506661 markings, 12965315 edges, 287193 markings/sec, 35 secs
lola: sara is running 40 secs || 12939072 markings, 14586728 edges, 286482 markings/sec, 40 secs
lola: sara is running 45 secs || 14366470 markings, 16202264 edges, 285480 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14984930 markings, 16902704 edges
lola: ========================================
lola: subprocess 2 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p81) AND (1 <= p325))))
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 <= p81) AND (1 <= p325))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p81) AND (1 <= p325))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: error: :1231: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1487636 markings, 1630996 edges, 297527 markings/sec, 0 secs
lola: sara is running 5 secs || 2925357 markings, 3244738 edges, 287544 markings/sec, 5 secs
lola: sara is running 10 secs || 4347390 markings, 4855002 edges, 284407 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5748380 markings, 6440084 edges
lola: ========================================
lola: subprocess 3 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p171) AND (1 <= p204) AND ((p195 <= 0)) AND ((p223 <= 0) OR (p218 <= 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 <= p171) AND (1 <= p204) AND ((p195 <= 0)) AND ((p223 <= 0) OR (p218 <= 0)))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p171) AND (1 <= p204) AND ((p195 <= 0)) AND ((p223 <= 0) OR (p218 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: error: :1231: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29404 markings, 32053 edges
lola: ========================================
lola: subprocess 4 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p181) AND (1 <= p204) AND (1 <= p148) AND (1 <= p237)) OR ((1 <= p164) AND ((p232 <= 0)) AND (1 <= p204)))))
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 <= p181) AND (1 <= p204) AND (1 <= p148) AND (1 <= p237)) OR ((1 <= p164) AND ((p232 <= 0)) AND (1 <= p204)))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p181) AND (1 <= p204) AND (1 <= p148) AND (1 <= p237)) OR ((1 <= p164) AND ((p232 <= 0)) AND (1 <= p204)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: error: :1231: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41234 markings, 46440 edges
lola: ========================================
lola: subprocess 5 will run for 3437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p220 <= 0) OR (p170 <= 0) OR (p204 <= 0) OR ((1 <= p277)) OR (((p280 <= 0)) AND ((p146 <= 0) OR (p237 <= 0))))))
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 (((p220 <= 0) OR (p170 <= 0) OR (p204 <= 0) OR ((1 <= p277)) OR (((p280 <= 0)) AND ((p146 <= 0) OR (p237 <= 0))))))
lola: processed formula length: 125
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p220) AND (1 <= p170) AND (1 <= p204) AND ((p277 <= 0)) AND (((1 <= p280)) OR ((1 <= p146) AND (1 <= p237))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
sara: error: :1231: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 865168 markings, 1059088 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes
lola:
preliminary result: yes no yes no yes yes
lola: memory consumption: 26916 KB
lola: time consumption: 137 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is DES-PT-50b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;