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-162039097100044.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-20a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K 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-20a-ReachabilityFireability-00
FORMULA_NAME DES-PT-20a-ReachabilityFireability-01
FORMULA_NAME DES-PT-20a-ReachabilityFireability-02
FORMULA_NAME DES-PT-20a-ReachabilityFireability-03
FORMULA_NAME DES-PT-20a-ReachabilityFireability-04
FORMULA_NAME DES-PT-20a-ReachabilityFireability-05
FORMULA_NAME DES-PT-20a-ReachabilityFireability-06
FORMULA_NAME DES-PT-20a-ReachabilityFireability-07
FORMULA_NAME DES-PT-20a-ReachabilityFireability-08
FORMULA_NAME DES-PT-20a-ReachabilityFireability-09
FORMULA_NAME DES-PT-20a-ReachabilityFireability-10
FORMULA_NAME DES-PT-20a-ReachabilityFireability-11
FORMULA_NAME DES-PT-20a-ReachabilityFireability-12
FORMULA_NAME DES-PT-20a-ReachabilityFireability-13
FORMULA_NAME DES-PT-20a-ReachabilityFireability-14
FORMULA_NAME DES-PT-20a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620506183935

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:36:25] [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 20:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:36:25] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-08 20:36:25] [INFO ] Transformed 195 places.
[2021-05-08 20:36:25] [INFO ] Transformed 152 transitions.
[2021-05-08 20:36:25] [INFO ] Found NUPN structural information;
[2021-05-08 20:36:25] [INFO ] Parsed PT model containing 195 places and 152 transitions in 107 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 220 resets, run finished after 88 ms. (steps per millisecond=113 ) properties seen :[0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1]
FORMULA DES-PT-20a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 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 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 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 43 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 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 58 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 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 20:36:25] [INFO ] Computed 59 place invariants in 14 ms
[2021-05-08 20:36:26] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2021-05-08 20:36:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 20:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:26] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2021-05-08 20:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2021-05-08 20:36:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 111 ms returned sat
[2021-05-08 20:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:27] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2021-05-08 20:36:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 20:36:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 20:36:27] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 14 ms.
[2021-05-08 20:36:27] [INFO ] Added : 105 causal constraints over 22 iterations in 462 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 20:36:27] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:27] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 20:36:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 254 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:28] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:28] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 11 ms.
[2021-05-08 20:36:28] [INFO ] Added : 124 causal constraints over 26 iterations in 328 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:36:28] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:28] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-08 20:36:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-08 20:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:29] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2021-05-08 20:36:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 20:36:29] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:29] [INFO ] Added : 86 causal constraints over 18 iterations in 372 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 20:36:29] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:29] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-08 20:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 20:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:30] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2021-05-08 20:36:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:30] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 8 ms.
[2021-05-08 20:36:30] [INFO ] Added : 101 causal constraints over 21 iterations in 333 ms. Result :sat
[2021-05-08 20:36:30] [INFO ] Deduced a trap composed of 17 places in 61 ms
[2021-05-08 20:36:30] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2021-05-08 20:36:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 20:36:30] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:30] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-08 20:36:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 348 ms returned sat
[2021-05-08 20:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:31] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-08 20:36:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:31] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 8 ms.
[2021-05-08 20:36:31] [INFO ] Added : 86 causal constraints over 18 iterations in 249 ms. Result :sat
[2021-05-08 20:36:31] [INFO ] Deduced a trap composed of 10 places in 39 ms
[2021-05-08 20:36:31] [INFO ] Deduced a trap composed of 9 places in 34 ms
[2021-05-08 20:36:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:36:31] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2021-05-08 20:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:31] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-08 20:36:32] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:32] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:36:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:32] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2021-05-08 20:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:32] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-08 20:36:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:32] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 11 ms.
[2021-05-08 20:36:32] [INFO ] Added : 133 causal constraints over 27 iterations in 324 ms. Result :sat
[2021-05-08 20:36:32] [INFO ] Deduced a trap composed of 13 places in 44 ms
[2021-05-08 20:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:36:32] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:32] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-08 20:36:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:36:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:33] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2021-05-08 20:36:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:33] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 7 ms.
[2021-05-08 20:36:33] [INFO ] Added : 128 causal constraints over 26 iterations in 380 ms. Result :sat
[2021-05-08 20:36:33] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2021-05-08 20:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:36:33] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2021-05-08 20:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:34] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-08 20:36:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 20:36:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 20:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:34] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2021-05-08 20:36:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-08 20:36:34] [INFO ] Deduced a trap composed of 17 places in 29 ms
[2021-05-08 20:36:34] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2021-05-08 20:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2021-05-08 20:36:34] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 7 ms.
[2021-05-08 20:36:34] [INFO ] Added : 119 causal constraints over 24 iterations in 339 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 20:36:35] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:35] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-08 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 20:36:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 243 ms returned sat
[2021-05-08 20:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:35] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-08 20:36:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:36:35] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2021-05-08 20:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-08 20:36:35] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:36] [INFO ] Added : 126 causal constraints over 26 iterations in 371 ms. Result :sat
[2021-05-08 20:36:36] [INFO ] Deduced a trap composed of 21 places in 25 ms
[2021-05-08 20:36:36] [INFO ] Deduced a trap composed of 18 places in 25 ms
[2021-05-08 20:36:36] [INFO ] Deduced a trap composed of 21 places in 26 ms
[2021-05-08 20:36:36] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2021-05-08 20:36:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 165 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:36:36] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:36] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-08 20:36:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2021-05-08 20:36:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 58 ms returned sat
[2021-05-08 20:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:36] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-08 20:36:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:36] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 8 ms.
[2021-05-08 20:36:37] [INFO ] Added : 108 causal constraints over 22 iterations in 386 ms. Result :sat
[2021-05-08 20:36:37] [INFO ] Deduced a trap composed of 9 places in 34 ms
[2021-05-08 20:36:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 67900 steps, including 1472 resets, run finished after 286 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 104800 steps, including 2377 resets, run finished after 376 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 83600 steps, including 2174 resets, run finished after 278 ms. (steps per millisecond=300 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 93000 steps, including 2375 resets, run finished after 312 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 105500 steps, including 2372 resets, run finished after 367 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-20a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 39300 steps, including 332 resets, run finished after 126 ms. (steps per millisecond=311 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA DES-PT-20a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-20a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-20a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-20a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 62700 steps, including 1373 resets, run finished after 186 ms. (steps per millisecond=337 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 67400 steps, including 1618 resets, run finished after 201 ms. (steps per millisecond=335 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 88400 steps, including 1988 resets, run finished after 260 ms. (steps per millisecond=340 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 77600 steps, including 1665 resets, run finished after 231 ms. (steps per millisecond=335 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 195 transition count 136
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 194 transition count 135
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 194 transition count 135
Applied a total of 8 rules in 53 ms. Remains 194 /195 variables (removed 1) and now considering 135/138 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/195 places, 135/138 transitions.
Incomplete random walk after 1000000 steps, including 15206 resets, run finished after 3124 ms. (steps per millisecond=320 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2845 resets, run finished after 1237 ms. (steps per millisecond=808 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2810 resets, run finished after 1183 ms. (steps per millisecond=845 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6087 resets, run finished after 1224 ms. (steps per millisecond=816 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2154 resets, run finished after 1510 ms. (steps per millisecond=662 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4336 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 16895787 steps, run timeout after 30001 ms. (steps per millisecond=563 ) properties seen :[0, 0, 1, 0, 1]
Probabilistic random walk after 16895787 steps, saw 2182636 distinct states, run finished after 30001 ms. (steps per millisecond=563 ) properties seen :[0, 0, 1, 0, 1]
FORMULA DES-PT-20a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-20a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 135 rows 194 cols
[2021-05-08 20:37:19] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 20:37:19] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:19] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:19] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-08 20:37:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:37:19] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2021-05-08 20:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:20] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-08 20:37:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 20:37:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:37:20] [INFO ] Deduced a trap composed of 21 places in 12 ms
[2021-05-08 20:37:20] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2021-05-08 20:37:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2021-05-08 20:37:20] [INFO ] Computed and/alt/rep : 134/576/134 causal constraints in 9 ms.
[2021-05-08 20:37:20] [INFO ] Added : 122 causal constraints over 25 iterations in 356 ms. Result :sat
[2021-05-08 20:37:20] [INFO ] Deduced a trap composed of 6 places in 32 ms
[2021-05-08 20:37:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:37:20] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:37:20] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:20] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-08 20:37:20] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:37:20] [INFO ] Deduced a trap composed of 13 places in 44 ms
[2021-05-08 20:37:20] [INFO ] Deduced a trap composed of 7 places in 24 ms
[2021-05-08 20:37:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-08 20:37:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 31 ms returned sat
[2021-05-08 20:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:21] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-08 20:37:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:37:21] [INFO ] Deduced a trap composed of 21 places in 13 ms
[2021-05-08 20:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-08 20:37:21] [INFO ] Computed and/alt/rep : 134/576/134 causal constraints in 8 ms.
[2021-05-08 20:37:21] [INFO ] Added : 133 causal constraints over 27 iterations in 456 ms. Result :sat
[2021-05-08 20:37:21] [INFO ] Deduced a trap composed of 9 places in 13 ms
[2021-05-08 20:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:37:21] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:37:21] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 20:37:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:21] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2021-05-08 20:37:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:37:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:37:22] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 20:37:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:37:22] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2021-05-08 20:37:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 20:37:22] [INFO ] Deduced a trap composed of 21 places in 42 ms
[2021-05-08 20:37:22] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2021-05-08 20:37:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2021-05-08 20:37:22] [INFO ] Computed and/alt/rep : 134/576/134 causal constraints in 7 ms.
[2021-05-08 20:37:22] [INFO ] Added : 106 causal constraints over 22 iterations in 345 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 70100 steps, including 1043 resets, run finished after 210 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 107300 steps, including 1592 resets, run finished after 314 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 90400 steps, including 1385 resets, run finished after 269 ms. (steps per millisecond=336 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 17 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 135/135 transitions.
Applied a total of 0 rules in 14 ms. Remains 194 /194 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 135/135 transitions.
Incomplete random walk after 1000000 steps, including 15195 resets, run finished after 2787 ms. (steps per millisecond=358 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2811 resets, run finished after 1181 ms. (steps per millisecond=846 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2764 resets, run finished after 1144 ms. (steps per millisecond=874 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2044 resets, run finished after 1480 ms. (steps per millisecond=675 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 17878676 steps, run timeout after 30001 ms. (steps per millisecond=595 ) properties seen :[0, 0, 0]
Probabilistic random walk after 17878676 steps, saw 2313555 distinct states, run finished after 30001 ms. (steps per millisecond=595 ) properties seen :[0, 0, 0]
// Phase 1: matrix 135 rows 194 cols
[2021-05-08 20:38:00] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 20:38:00] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:00] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:00] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-08 20:38:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:00] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 31 ms returned sat
[2021-05-08 20:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:00] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-08 20:38:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 20:38:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-08 20:38:00] [INFO ] Deduced a trap composed of 21 places in 12 ms
[2021-05-08 20:38:00] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2021-05-08 20:38:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2021-05-08 20:38:00] [INFO ] Computed and/alt/rep : 134/576/134 causal constraints in 8 ms.
[2021-05-08 20:38:01] [INFO ] Added : 122 causal constraints over 25 iterations in 467 ms. Result :sat
[2021-05-08 20:38:01] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2021-05-08 20:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:38:01] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2021-05-08 20:38:01] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 20:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:01] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-08 20:38:01] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:38:01] [INFO ] Deduced a trap composed of 13 places in 43 ms
[2021-05-08 20:38:01] [INFO ] Deduced a trap composed of 7 places in 18 ms
[2021-05-08 20:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2021-05-08 20:38:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:38:01] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 20:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:01] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-08 20:38:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:38:01] [INFO ] Deduced a trap composed of 21 places in 14 ms
[2021-05-08 20:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-08 20:38:01] [INFO ] Computed and/alt/rep : 134/576/134 causal constraints in 7 ms.
[2021-05-08 20:38:02] [INFO ] Added : 133 causal constraints over 27 iterations in 473 ms. Result :sat
[2021-05-08 20:38:02] [INFO ] Deduced a trap composed of 9 places in 21 ms
[2021-05-08 20:38:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:38:02] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:02] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 20:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:02] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-08 20:38:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:38:02] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 20:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:03] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2021-05-08 20:38:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-08 20:38:03] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2021-05-08 20:38:03] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2021-05-08 20:38:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2021-05-08 20:38:03] [INFO ] Computed and/alt/rep : 134/576/134 causal constraints in 7 ms.
[2021-05-08 20:38:03] [INFO ] Added : 106 causal constraints over 22 iterations in 348 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 70100 steps, including 1037 resets, run finished after 210 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 107300 steps, including 1577 resets, run finished after 320 ms. (steps per millisecond=335 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 90400 steps, including 1394 resets, run finished after 266 ms. (steps per millisecond=339 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 17 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 194 /194 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 135/135 transitions.
Starting structural reductions, iteration 0 : 194/194 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 194 /194 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 194 cols
[2021-05-08 20:38:04] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 20:38:04] [INFO ] Implicit Places using invariants in 266 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
[2021-05-08 20:38:04] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:04] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:04] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Starting structural reductions, iteration 1 : 193/194 places, 135/135 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-08 20:38:04] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:04] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:38:05] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/194 places, 135/135 transitions.
Incomplete random walk after 1000000 steps, including 15191 resets, run finished after 2766 ms. (steps per millisecond=361 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2839 resets, run finished after 1165 ms. (steps per millisecond=858 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2815 resets, run finished after 1132 ms. (steps per millisecond=883 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2088 resets, run finished after 1461 ms. (steps per millisecond=684 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 18177359 steps, run timeout after 30001 ms. (steps per millisecond=605 ) properties seen :[0, 0, 0]
Probabilistic random walk after 18177359 steps, saw 2352510 distinct states, run finished after 30001 ms. (steps per millisecond=605 ) properties seen :[0, 0, 0]
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:41] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:41] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:41] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-08 20:38:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:38:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2021-05-08 20:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:42] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-08 20:38:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 20:38:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:38:42] [INFO ] Deduced a trap composed of 21 places in 11 ms
[2021-05-08 20:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2021-05-08 20:38:42] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 7 ms.
[2021-05-08 20:38:42] [INFO ] Added : 123 causal constraints over 25 iterations in 323 ms. Result :sat
[2021-05-08 20:38:42] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2021-05-08 20:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:38:42] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:42] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-08 20:38:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2021-05-08 20:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:42] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-08 20:38:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:38:42] [INFO ] Deduced a trap composed of 7 places in 24 ms
[2021-05-08 20:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-08 20:38:42] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 7 ms.
[2021-05-08 20:38:43] [INFO ] Added : 132 causal constraints over 27 iterations in 298 ms. Result :sat
[2021-05-08 20:38:43] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2021-05-08 20:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:38:43] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 20:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:43] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-08 20:38:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:38:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 20:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:43] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2021-05-08 20:38:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 44 ms returned sat
[2021-05-08 20:38:43] [INFO ] Deduced a trap composed of 21 places in 36 ms
[2021-05-08 20:38:43] [INFO ] Deduced a trap composed of 13 places in 35 ms
[2021-05-08 20:38:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2021-05-08 20:38:43] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 14 ms.
[2021-05-08 20:38:44] [INFO ] Added : 110 causal constraints over 22 iterations in 295 ms. Result :sat
[2021-05-08 20:38:44] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2021-05-08 20:38:44] [INFO ] Deduced a trap composed of 15 places in 21 ms
[2021-05-08 20:38:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 70600 steps, including 1046 resets, run finished after 212 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 99700 steps, including 667 resets, run finished after 296 ms. (steps per millisecond=336 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 87200 steps, including 1301 resets, run finished after 257 ms. (steps per millisecond=339 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 17 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:45] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:45] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:45] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 20:38:46] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2021-05-08 20:38:46] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:46] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:46] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 100000 steps, including 1502 resets, run finished after 283 ms. (steps per millisecond=353 ) properties seen :[0, 0, 0]
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:46] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:46] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:46] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-08 20:38:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2021-05-08 20:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:46] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-08 20:38:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 20:38:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:38:47] [INFO ] Deduced a trap composed of 21 places in 12 ms
[2021-05-08 20:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-08 20:38:47] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 11 ms.
[2021-05-08 20:38:47] [INFO ] Added : 123 causal constraints over 25 iterations in 324 ms. Result :sat
[2021-05-08 20:38:47] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2021-05-08 20:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-08 20:38:47] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:47] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-08 20:38:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:38:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2021-05-08 20:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:47] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-08 20:38:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:38:47] [INFO ] Deduced a trap composed of 7 places in 20 ms
[2021-05-08 20:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-08 20:38:47] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 8 ms.
[2021-05-08 20:38:48] [INFO ] Added : 132 causal constraints over 27 iterations in 346 ms. Result :sat
[2021-05-08 20:38:48] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2021-05-08 20:38:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-08 20:38:48] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 20:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:48] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-08 20:38:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:38:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 20:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:48] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-08 20:38:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 44 ms returned sat
[2021-05-08 20:38:48] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2021-05-08 20:38:48] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2021-05-08 20:38:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2021-05-08 20:38:48] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 7 ms.
[2021-05-08 20:38:49] [INFO ] Added : 110 causal constraints over 22 iterations in 286 ms. Result :sat
[2021-05-08 20:38:49] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2021-05-08 20:38:49] [INFO ] Deduced a trap composed of 15 places in 21 ms
[2021-05-08 20:38:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 193 cols
[2021-05-08 20:38:49] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:38:49] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:49] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-08 20:38:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2021-05-08 20:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:49] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-08 20:38:49] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 8 ms.
[2021-05-08 20:38:50] [INFO ] Added : 123 causal constraints over 25 iterations in 346 ms. Result :sat
[2021-05-08 20:38:50] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2021-05-08 20:38:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 20:38:50] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:50] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-08 20:38:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2021-05-08 20:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:50] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-08 20:38:50] [INFO ] Deduced a trap composed of 7 places in 15 ms
[2021-05-08 20:38:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-08 20:38:50] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 7 ms.
[2021-05-08 20:38:50] [INFO ] Added : 133 causal constraints over 27 iterations in 294 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 20:38:50] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 20:38:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 20:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:51] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-08 20:38:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:38:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2021-05-08 20:38:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2021-05-08 20:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:38:51] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-08 20:38:51] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2021-05-08 20:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2021-05-08 20:38:51] [INFO ] Computed and/alt/rep : 134/574/134 causal constraints in 7 ms.
[2021-05-08 20:38:51] [INFO ] Added : 105 causal constraints over 21 iterations in 304 ms. Result :sat
[2021-05-08 20:38:51] [INFO ] Deduced a trap composed of 9 places in 13 ms
[2021-05-08 20:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 20:38:51] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-08 20:38:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
[2021-05-08 20:38:52] [INFO ] Flatten gal took : 64 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-20a @ 3570 seconds

FORMULA DES-PT-20a-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ DES-PT-20a

{
"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 20:38:53 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p2) AND (1 <= p112) AND (1 <= p114))))",
"processed_size": 51,
"rewrites": 1
},
"result":
{
"edges": 996,
"markings": 997,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 <= p7) AND (1 <= p112) AND (1 <= p114) AND (1 <= p119) AND (1 <= p136))))",
"processed_size": 83,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p181) AND (1 <= p183) AND (1 <= p82) AND (((1 <= p9) AND (1 <= p112) AND (1 <= p114)) OR ((((1 <= p35) AND (1 <= p188)) OR ((1 <= p12) AND (1 <= p112) AND (1 <= p114))) AND (((1 <= p187) AND (1 <= p191)) OR ((1 <= p91) AND (1 <= p184))))))))",
"processed_size": 257,
"rewrites": 1
},
"result":
{
"edges": 13668,
"markings": 10864,
"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": 36,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 25508,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 680,
"conflict_clusters": 43,
"places": 193,
"places_significant": 133,
"singleton_clusters": 0,
"transitions": 135
},
"result":
{
"preliminary_value": "yes yes yes ",
"value": "yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 328/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 193
lola: finding significant places
lola: 193 places, 135 transitions, 133 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: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: E (F (((1 <= p7) AND (1 <= p112) AND (1 <= p114) AND (1 <= p119) AND (1 <= p136)))) : E (F (((1 <= p2) AND (1 <= p112) AND (1 <= p114)))) : E (F (((1 <= p181) AND (1 <= p183) AND (1 <= p82) AND (((1 <= p9) AND (1 <= p112) AND (1 <= p114)) OR ((((1 <= p35) AND (1 <= p188)) OR ((1 <= p12) AND (1 <= p112) AND (1 <= p114))) AND (((1 <= p187) AND (1 <= p191)) OR ((1 <= p91) AND (1 <= p184))))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2) AND (1 <= p112) AND (1 <= p114))))
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 <= p2) AND (1 <= p112) AND (1 <= p114))))
lola: processed formula length: 51
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 <= p2) AND (1 <= p112) AND (1 <= p114))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 997 markings, 996 edges
lola: ========================================
lola: subprocess 1 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p7) AND (1 <= p112) AND (1 <= p114) AND (1 <= p119) AND (1 <= p136))))
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 <= p7) AND (1 <= p112) AND (1 <= p114) AND (1 <= p119) AND (1 <= p136))))
lola: processed formula length: 83
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 <= p7) AND (1 <= p112) AND (1 <= p114) AND (1 <= p119) AND (1 <= p136))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p181) AND (1 <= p183) AND (1 <= p82) AND (((1 <= p9) AND (1 <= p112) AND (1 <= p114)) OR ((((1 <= p35) AND (1 <= p188)) OR ((1 <= p12) AND (1 <= p112) AND (1 <= p114))) AND (((1 <= p187) AND (1 <= p191)) OR ((1 <= p91) AND (1 <= p184))))))))
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 <= p183) AND (1 <= p82) AND (((1 <= p9) AND (1 <= p112) AND (1 <= p114)) OR ((((1 <= p35) AND (1 <= p188)) OR ((1 <= p12) AND (1 <= p112) AND (1 <= p114))) AND (((1 <= p187) AND (1 <= p191)) OR ((1 <= p91) AND (1 <= p184))))))))
lola: processed formula length: 257
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 <= p183) AND (1 <= p82) AND (((1 <= p9) AND (1 <= p112) AND (1 <= p114)) OR ((((1 <= p35) AND (1 <= p188)) OR ((1 <= p12) AND (1 <= p112) AND (1 <= p114))) AND (((1 <= p187) AND (1 <= p191)) OR ((1 <= p91) AND (1 <= p184))))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 5 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: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10864 markings, 13668 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes
lola:
preliminary result: yes yes yes
lola: memory consumption: 25508 KB
lola: time consumption: 3 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-20a"
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-20a, 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-162039097100044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;