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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K 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 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 97K 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-50a-ReachabilityFireability-00
FORMULA_NAME DES-PT-50a-ReachabilityFireability-01
FORMULA_NAME DES-PT-50a-ReachabilityFireability-02
FORMULA_NAME DES-PT-50a-ReachabilityFireability-03
FORMULA_NAME DES-PT-50a-ReachabilityFireability-04
FORMULA_NAME DES-PT-50a-ReachabilityFireability-05
FORMULA_NAME DES-PT-50a-ReachabilityFireability-06
FORMULA_NAME DES-PT-50a-ReachabilityFireability-07
FORMULA_NAME DES-PT-50a-ReachabilityFireability-08
FORMULA_NAME DES-PT-50a-ReachabilityFireability-09
FORMULA_NAME DES-PT-50a-ReachabilityFireability-10
FORMULA_NAME DES-PT-50a-ReachabilityFireability-11
FORMULA_NAME DES-PT-50a-ReachabilityFireability-12
FORMULA_NAME DES-PT-50a-ReachabilityFireability-13
FORMULA_NAME DES-PT-50a-ReachabilityFireability-14
FORMULA_NAME DES-PT-50a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620513469126

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 22:37: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:37:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:37:50] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-08 22:37:50] [INFO ] Transformed 314 places.
[2021-05-08 22:37:50] [INFO ] Transformed 271 transitions.
[2021-05-08 22:37:50] [INFO ] Found NUPN structural information;
[2021-05-08 22:37:50] [INFO ] Parsed PT model containing 314 places and 271 transitions in 109 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 221 resets, run finished after 99 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA DES-PT-50a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 257 rows 314 cols
[2021-05-08 22:37:51] [INFO ] Computed 59 place invariants in 24 ms
[2021-05-08 22:37:51] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2021-05-08 22:37:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2021-05-08 22:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:51] [INFO ] [Real]Absence check using state equation in 477 ms returned unsat
[2021-05-08 22:37:51] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2021-05-08 22:37:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:52] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-08 22:37:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:37:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2021-05-08 22:37:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2021-05-08 22:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:53] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2021-05-08 22:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 22:37:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:37:53] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 23 ms.
[2021-05-08 22:37:54] [INFO ] Added : 248 causal constraints over 50 iterations in 1170 ms. Result :sat
[2021-05-08 22:37:54] [INFO ] Deduced a trap composed of 10 places in 81 ms
[2021-05-08 22:37:54] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2021-05-08 22:37:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:37:54] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2021-05-08 22:37:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 22:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:55] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2021-05-08 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:37:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:37:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2021-05-08 22:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:55] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2021-05-08 22:37:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:37:55] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 16 ms.
[2021-05-08 22:37:57] [INFO ] Added : 203 causal constraints over 42 iterations in 1117 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:37:57] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:37:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:57] [INFO ] [Real]Absence check using state equation in 111 ms returned unsat
[2021-05-08 22:37:57] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:37:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 22:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:57] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2021-05-08 22:37:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:37:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:37:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 22:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:37:59] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2021-05-08 22:37:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:37:59] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 15 ms.
[2021-05-08 22:38:00] [INFO ] Added : 232 causal constraints over 47 iterations in 1235 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 22:38:00] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2021-05-08 22:38:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:00] [INFO ] [Real]Absence check using state equation in 215 ms returned unsat
[2021-05-08 22:38:00] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2021-05-08 22:38:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:01] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-08 22:38:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2021-05-08 22:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:01] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2021-05-08 22:38:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:38:01] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 26 ms.
[2021-05-08 22:38:03] [INFO ] Added : 239 causal constraints over 48 iterations in 1371 ms. Result :sat
[2021-05-08 22:38:03] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2021-05-08 22:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:38:03] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:03] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2021-05-08 22:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 62 ms returned sat
[2021-05-08 22:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:04] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2021-05-08 22:38:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-08 22:38:04] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2021-05-08 22:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-08 22:38:04] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 17 ms.
[2021-05-08 22:38:06] [INFO ] Added : 245 causal constraints over 49 iterations in 1342 ms. Result :sat
[2021-05-08 22:38:06] [INFO ] Deduced a trap composed of 16 places in 78 ms
[2021-05-08 22:38:06] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2021-05-08 22:38:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:38:06] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 22:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:06] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-08 22:38:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2021-05-08 22:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:07] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2021-05-08 22:38:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:38:07] [INFO ] Deduced a trap composed of 13 places in 79 ms
[2021-05-08 22:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-08 22:38:07] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 18 ms.
[2021-05-08 22:38:08] [INFO ] Added : 156 causal constraints over 32 iterations in 1078 ms. Result :sat
[2021-05-08 22:38:08] [INFO ] Deduced a trap composed of 16 places in 57 ms
[2021-05-08 22:38:08] [INFO ] Deduced a trap composed of 10 places in 57 ms
[2021-05-08 22:38:08] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2021-05-08 22:38:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 22:38:09] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:09] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2021-05-08 22:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:09] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2021-05-08 22:38:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:10] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2021-05-08 22:38:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:38:10] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 14 ms.
[2021-05-08 22:38:11] [INFO ] Added : 204 causal constraints over 41 iterations in 1149 ms. Result :sat
[2021-05-08 22:38:11] [INFO ] Deduced a trap composed of 10 places in 59 ms
[2021-05-08 22:38:11] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2021-05-08 22:38:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:38:11] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:11] [INFO ] [Real]Absence check using state equation in 209 ms returned unsat
[2021-05-08 22:38:11] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 22:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:12] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2021-05-08 22:38:12] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:38:12] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 16 ms.
[2021-05-08 22:38:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:12] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2021-05-08 22:38:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:38:12] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 17 ms.
[2021-05-08 22:38:14] [INFO ] Added : 245 causal constraints over 50 iterations in 1328 ms. Result :sat
[2021-05-08 22:38:14] [INFO ] Deduced a trap composed of 13 places in 20 ms
[2021-05-08 22:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:38:14] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 22:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:14] [INFO ] [Real]Absence check using state equation in 73 ms returned unsat
FORMULA DES-PT-50a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 260000 steps, including 6396 resets, run finished after 976 ms. (steps per millisecond=266 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 197300 steps, including 4779 resets, run finished after 688 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 130500 steps, including 3140 resets, run finished after 512 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 239500 steps, including 5673 resets, run finished after 865 ms. (steps per millisecond=276 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 239100 steps, including 6095 resets, run finished after 839 ms. (steps per millisecond=284 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 176900 steps, including 4229 resets, run finished after 643 ms. (steps per millisecond=275 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 221100 steps, including 5407 resets, run finished after 768 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 241800 steps, including 5934 resets, run finished after 868 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 20 out of 314 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 314/314 places, 257/257 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 314 transition count 255
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 314 transition count 255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 313 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 313 transition count 254
Applied a total of 9 rules in 77 ms. Remains 313 /314 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/314 places, 254/257 transitions.
Incomplete random walk after 1000000 steps, including 13478 resets, run finished after 3577 ms. (steps per millisecond=279 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DES-PT-50a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2317 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2257 resets, run finished after 1362 ms. (steps per millisecond=734 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1748 resets, run finished after 1388 ms. (steps per millisecond=720 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7284 resets, run finished after 1401 ms. (steps per millisecond=713 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2417 resets, run finished after 1451 ms. (steps per millisecond=689 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7274 resets, run finished after 1409 ms. (steps per millisecond=709 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2379 resets, run finished after 1300 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 22:38:33] [INFO ] Computed 61 place invariants in 9 ms
[2021-05-08 22:38:33] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:34] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2021-05-08 22:38:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:34] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 63 ms returned sat
[2021-05-08 22:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:34] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2021-05-08 22:38:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:38:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:38:34] [INFO ] Deduced a trap composed of 7 places in 78 ms
[2021-05-08 22:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2021-05-08 22:38:35] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 16 ms.
[2021-05-08 22:38:36] [INFO ] Added : 231 causal constraints over 47 iterations in 1103 ms. Result :sat
[2021-05-08 22:38:36] [INFO ] Deduced a trap composed of 9 places in 27 ms
[2021-05-08 22:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 22:38:36] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:36] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2021-05-08 22:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:36] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2021-05-08 22:38:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:36] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:36] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 42 ms returned sat
[2021-05-08 22:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:37] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2021-05-08 22:38:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:38:37] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 16 ms.
[2021-05-08 22:38:38] [INFO ] Added : 192 causal constraints over 39 iterations in 1010 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:38:38] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:38] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 26 ms returned sat
[2021-05-08 22:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:39] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2021-05-08 22:38:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:39] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 93 ms returned sat
[2021-05-08 22:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:40] [INFO ] [Nat]Absence check using state equation in 965 ms returned sat
[2021-05-08 22:38:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:38:40] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 14 ms.
[2021-05-08 22:38:41] [INFO ] Added : 234 causal constraints over 47 iterations in 1460 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:38:42] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:42] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:42] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-08 22:38:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:42] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 37 ms returned sat
[2021-05-08 22:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:42] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2021-05-08 22:38:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:38:42] [INFO ] Deduced a trap composed of 9 places in 46 ms
[2021-05-08 22:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-08 22:38:43] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 15 ms.
[2021-05-08 22:38:44] [INFO ] Added : 226 causal constraints over 46 iterations in 1151 ms. Result :sat
[2021-05-08 22:38:44] [INFO ] Deduced a trap composed of 17 places in 54 ms
[2021-05-08 22:38:44] [INFO ] Deduced a trap composed of 6 places in 49 ms
[2021-05-08 22:38:44] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-08 22:38:44] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2021-05-08 22:38:44] [INFO ] Deduced a trap composed of 18 places in 53 ms
[2021-05-08 22:38:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 406 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:38:44] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:44] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2021-05-08 22:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:46] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2021-05-08 22:38:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:46] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 124 ms returned sat
[2021-05-08 22:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:46] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-08 22:38:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:38:46] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 12 ms.
[2021-05-08 22:38:48] [INFO ] Added : 237 causal constraints over 48 iterations in 1369 ms. Result :sat
[2021-05-08 22:38:48] [INFO ] Deduced a trap composed of 22 places in 116 ms
[2021-05-08 22:38:48] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2021-05-08 22:38:48] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2021-05-08 22:38:48] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2021-05-08 22:38:48] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2021-05-08 22:38:48] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2021-05-08 22:38:49] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2021-05-08 22:38:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:38:49] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:49] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:49] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-08 22:38:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2021-05-08 22:38:49] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 41 ms returned sat
[2021-05-08 22:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:50] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2021-05-08 22:38:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-08 22:38:50] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 14 ms.
[2021-05-08 22:38:51] [INFO ] Added : 174 causal constraints over 35 iterations in 1070 ms. Result :sat
[2021-05-08 22:38:51] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2021-05-08 22:38:51] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2021-05-08 22:38:51] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-08 22:38:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:38:51] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:38:51] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:52] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2021-05-08 22:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:38:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:38:52] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 22:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:38:52] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2021-05-08 22:38:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:38:52] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 14 ms.
[2021-05-08 22:38:53] [INFO ] Added : 165 causal constraints over 33 iterations in 791 ms. Result :sat
[2021-05-08 22:38:53] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2021-05-08 22:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 143500 steps, including 2135 resets, run finished after 528 ms. (steps per millisecond=271 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 189800 steps, including 2802 resets, run finished after 710 ms. (steps per millisecond=267 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 210500 steps, including 3067 resets, run finished after 781 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 228000 steps, including 3334 resets, run finished after 847 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 213800 steps, including 3161 resets, run finished after 794 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 158400 steps, including 2477 resets, run finished after 594 ms. (steps per millisecond=266 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 231900 steps, including 3425 resets, run finished after 870 ms. (steps per millisecond=266 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 254/254 transitions.
Incomplete random walk after 1000000 steps, including 13477 resets, run finished after 3633 ms. (steps per millisecond=275 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2275 resets, run finished after 1346 ms. (steps per millisecond=742 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2251 resets, run finished after 1413 ms. (steps per millisecond=707 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1731 resets, run finished after 1453 ms. (steps per millisecond=688 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7267 resets, run finished after 1467 ms. (steps per millisecond=681 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2408 resets, run finished after 1502 ms. (steps per millisecond=665 ) properties seen :[0, 0, 1, 0, 0, 0, 0]
FORMULA DES-PT-50a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 7264 resets, run finished after 1413 ms. (steps per millisecond=707 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2400 resets, run finished after 1313 ms. (steps per millisecond=761 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 22:39:12] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 22:39:12] [INFO ] [Real]Absence check using 37 positive place invariants in 39 ms returned sat
[2021-05-08 22:39:12] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 46 ms returned sat
[2021-05-08 22:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:12] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2021-05-08 22:39:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:39:12] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 63 ms returned sat
[2021-05-08 22:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:13] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2021-05-08 22:39:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:39:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:39:13] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2021-05-08 22:39:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2021-05-08 22:39:13] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 10 ms.
[2021-05-08 22:39:14] [INFO ] Added : 231 causal constraints over 47 iterations in 1095 ms. Result :sat
[2021-05-08 22:39:14] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-08 22:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:39:14] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:39:14] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2021-05-08 22:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:15] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2021-05-08 22:39:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:39:15] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2021-05-08 22:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:15] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2021-05-08 22:39:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:39:15] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 30 ms.
[2021-05-08 22:39:16] [INFO ] Added : 192 causal constraints over 39 iterations in 1034 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:39:16] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:39:16] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:17] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-08 22:39:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:39:17] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 22:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:17] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2021-05-08 22:39:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:39:17] [INFO ] Deduced a trap composed of 9 places in 48 ms
[2021-05-08 22:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-08 22:39:17] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 15 ms.
[2021-05-08 22:39:18] [INFO ] Added : 226 causal constraints over 46 iterations in 1160 ms. Result :sat
[2021-05-08 22:39:18] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2021-05-08 22:39:19] [INFO ] Deduced a trap composed of 6 places in 47 ms
[2021-05-08 22:39:19] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2021-05-08 22:39:19] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2021-05-08 22:39:19] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2021-05-08 22:39:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 404 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:39:19] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 22:39:19] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2021-05-08 22:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:20] [INFO ] [Real]Absence check using state equation in 1435 ms returned sat
[2021-05-08 22:39:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:39:21] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 123 ms returned sat
[2021-05-08 22:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:21] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2021-05-08 22:39:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:39:21] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 13 ms.
[2021-05-08 22:39:23] [INFO ] Added : 237 causal constraints over 48 iterations in 1399 ms. Result :sat
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 22 places in 91 ms
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 20 places in 80 ms
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 17 places in 56 ms
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2021-05-08 22:39:23] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2021-05-08 22:39:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 800 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:39:23] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:39:23] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:24] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2021-05-08 22:39:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:39:24] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 48 ms returned sat
[2021-05-08 22:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:24] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2021-05-08 22:39:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:39:25] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 11 ms.
[2021-05-08 22:39:26] [INFO ] Added : 174 causal constraints over 35 iterations in 1058 ms. Result :sat
[2021-05-08 22:39:26] [INFO ] Deduced a trap composed of 18 places in 37 ms
[2021-05-08 22:39:26] [INFO ] Deduced a trap composed of 17 places in 35 ms
[2021-05-08 22:39:26] [INFO ] Deduced a trap composed of 8 places in 32 ms
[2021-05-08 22:39:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 22:39:26] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:39:26] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:26] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2021-05-08 22:39:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:39:26] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 22:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:27] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2021-05-08 22:39:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:39:27] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 16 ms.
[2021-05-08 22:39:28] [INFO ] Added : 165 causal constraints over 33 iterations in 817 ms. Result :sat
[2021-05-08 22:39:28] [INFO ] Deduced a trap composed of 8 places in 39 ms
[2021-05-08 22:39:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 143500 steps, including 2137 resets, run finished after 503 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 189800 steps, including 2792 resets, run finished after 665 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 210500 steps, including 3116 resets, run finished after 734 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 228000 steps, including 3337 resets, run finished after 800 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 158400 steps, including 2459 resets, run finished after 555 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 231900 steps, including 3418 resets, run finished after 812 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 254/254 transitions.
Incomplete random walk after 1000000 steps, including 13508 resets, run finished after 3500 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2287 resets, run finished after 1352 ms. (steps per millisecond=739 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2275 resets, run finished after 1404 ms. (steps per millisecond=712 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7279 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2399 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7280 resets, run finished after 1431 ms. (steps per millisecond=698 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2372 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 13656405 steps, run timeout after 30001 ms. (steps per millisecond=455 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 13656405 steps, saw 1703484 distinct states, run finished after 30001 ms. (steps per millisecond=455 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 22:40:14] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 22:40:14] [INFO ] [Real]Absence check using 37 positive place invariants in 32 ms returned sat
[2021-05-08 22:40:14] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:14] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2021-05-08 22:40:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 22:40:14] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 64 ms returned sat
[2021-05-08 22:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:15] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2021-05-08 22:40:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 22:40:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:40:15] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2021-05-08 22:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-08 22:40:15] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 15 ms.
[2021-05-08 22:40:16] [INFO ] Added : 231 causal constraints over 47 iterations in 1186 ms. Result :sat
[2021-05-08 22:40:16] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2021-05-08 22:40:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 22:40:16] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 22:40:16] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2021-05-08 22:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:17] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2021-05-08 22:40:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:17] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 42 ms returned sat
[2021-05-08 22:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:17] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2021-05-08 22:40:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:40:17] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 13 ms.
[2021-05-08 22:40:18] [INFO ] Added : 192 causal constraints over 39 iterations in 1055 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:40:18] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:18] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:19] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-08 22:40:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:19] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2021-05-08 22:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:19] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2021-05-08 22:40:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:40:19] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2021-05-08 22:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-08 22:40:19] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 15 ms.
[2021-05-08 22:40:21] [INFO ] Added : 226 causal constraints over 46 iterations in 1188 ms. Result :sat
[2021-05-08 22:40:21] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2021-05-08 22:40:21] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2021-05-08 22:40:21] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2021-05-08 22:40:21] [INFO ] Deduced a trap composed of 18 places in 56 ms
[2021-05-08 22:40:21] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2021-05-08 22:40:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 421 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:40:21] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:21] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 26 ms returned sat
[2021-05-08 22:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:23] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2021-05-08 22:40:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:23] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 123 ms returned sat
[2021-05-08 22:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:23] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2021-05-08 22:40:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:40:23] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 16 ms.
[2021-05-08 22:40:25] [INFO ] Added : 237 causal constraints over 48 iterations in 1390 ms. Result :sat
[2021-05-08 22:40:25] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2021-05-08 22:40:25] [INFO ] Deduced a trap composed of 7 places in 96 ms
[2021-05-08 22:40:25] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2021-05-08 22:40:25] [INFO ] Deduced a trap composed of 17 places in 54 ms
[2021-05-08 22:40:25] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2021-05-08 22:40:25] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2021-05-08 22:40:26] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2021-05-08 22:40:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 844 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-08 22:40:26] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:26] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:26] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2021-05-08 22:40:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 22:40:26] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 40 ms returned sat
[2021-05-08 22:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:27] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2021-05-08 22:40:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:40:27] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 13 ms.
[2021-05-08 22:40:28] [INFO ] Added : 174 causal constraints over 35 iterations in 1090 ms. Result :sat
[2021-05-08 22:40:28] [INFO ] Deduced a trap composed of 18 places in 31 ms
[2021-05-08 22:40:28] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-08 22:40:28] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2021-05-08 22:40:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:40:28] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:28] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:29] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2021-05-08 22:40:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2021-05-08 22:40:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 22:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:29] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2021-05-08 22:40:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:40:29] [INFO ] Computed and/alt/rep : 253/1212/253 causal constraints in 15 ms.
[2021-05-08 22:40:30] [INFO ] Added : 165 causal constraints over 33 iterations in 801 ms. Result :sat
[2021-05-08 22:40:30] [INFO ] Deduced a trap composed of 8 places in 37 ms
[2021-05-08 22:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 143500 steps, including 2140 resets, run finished after 505 ms. (steps per millisecond=284 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 189800 steps, including 2781 resets, run finished after 668 ms. (steps per millisecond=284 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 210500 steps, including 3074 resets, run finished after 736 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 228000 steps, including 3337 resets, run finished after 801 ms. (steps per millisecond=284 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 158400 steps, including 2462 resets, run finished after 552 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 231900 steps, including 3411 resets, run finished after 809 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 254/254 transitions.
Starting structural reductions, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 22:40:34] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 22:40:35] [INFO ] Implicit Places using invariants in 692 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 694 ms to find 1 implicit places.
[2021-05-08 22:40:35] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:40:35] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:40:35] [INFO ] Dead Transitions using invariants and state equation in 614 ms returned []
Starting structural reductions, iteration 1 : 312/313 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2021-05-08 22:40:35] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:40:35] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:40:36] [INFO ] Dead Transitions using invariants and state equation in 598 ms returned []
Finished structural reductions, in 2 iterations. Remains : 312/313 places, 254/254 transitions.
Incomplete random walk after 1000000 steps, including 13343 resets, run finished after 3436 ms. (steps per millisecond=291 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2245 resets, run finished after 1237 ms. (steps per millisecond=808 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2283 resets, run finished after 1292 ms. (steps per millisecond=773 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7306 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2399 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7287 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2396 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 13747090 steps, run timeout after 30001 ms. (steps per millisecond=458 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 13747090 steps, saw 1712744 distinct states, run finished after 30001 ms. (steps per millisecond=458 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:41:17] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:41:17] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:18] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2021-05-08 22:41:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2021-05-08 22:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:18] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2021-05-08 22:41:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 22:41:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2021-05-08 22:41:19] [INFO ] Deduced a trap composed of 6 places in 50 ms
[2021-05-08 22:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-08 22:41:19] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 22 ms.
[2021-05-08 22:41:20] [INFO ] Added : 243 causal constraints over 49 iterations in 1313 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:41:20] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 22:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:20] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2021-05-08 22:41:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2021-05-08 22:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:21] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-08 22:41:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:41:21] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 13 ms.
[2021-05-08 22:41:22] [INFO ] Added : 184 causal constraints over 37 iterations in 906 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:41:22] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 22:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:22] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2021-05-08 22:41:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2021-05-08 22:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:23] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2021-05-08 22:41:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:41:23] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 14 ms.
[2021-05-08 22:41:24] [INFO ] Added : 240 causal constraints over 48 iterations in 1125 ms. Result :sat
[2021-05-08 22:41:24] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2021-05-08 22:41:24] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2021-05-08 22:41:24] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2021-05-08 22:41:24] [INFO ] Deduced a trap composed of 22 places in 59 ms
[2021-05-08 22:41:25] [INFO ] Deduced a trap composed of 17 places in 54 ms
[2021-05-08 22:41:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 479 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 22:41:25] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 22:41:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 22:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:26] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2021-05-08 22:41:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2021-05-08 22:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:26] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2021-05-08 22:41:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:41:26] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 13 ms.
[2021-05-08 22:41:28] [INFO ] Added : 246 causal constraints over 50 iterations in 1261 ms. Result :sat
[2021-05-08 22:41:28] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2021-05-08 22:41:28] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-08 22:41:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-08 22:41:28] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:28] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-08 22:41:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 22:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:29] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-08 22:41:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:41:29] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 15 ms.
[2021-05-08 22:41:30] [INFO ] Added : 174 causal constraints over 35 iterations in 1036 ms. Result :sat
[2021-05-08 22:41:30] [INFO ] Deduced a trap composed of 17 places in 46 ms
[2021-05-08 22:41:30] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2021-05-08 22:41:30] [INFO ] Deduced a trap composed of 18 places in 31 ms
[2021-05-08 22:41:30] [INFO ] Deduced a trap composed of 17 places in 32 ms
[2021-05-08 22:41:30] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2021-05-08 22:41:31] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2021-05-08 22:41:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 350 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:41:31] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:31] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2021-05-08 22:41:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2021-05-08 22:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:32] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2021-05-08 22:41:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:41:32] [INFO ] Deduced a trap composed of 6 places in 49 ms
[2021-05-08 22:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-08 22:41:32] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 16 ms.
[2021-05-08 22:41:33] [INFO ] Added : 244 causal constraints over 49 iterations in 1292 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 243800 steps, including 3596 resets, run finished after 875 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 192900 steps, including 2810 resets, run finished after 706 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 245200 steps, including 3610 resets, run finished after 876 ms. (steps per millisecond=279 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 233100 steps, including 3438 resets, run finished after 833 ms. (steps per millisecond=279 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 156800 steps, including 2418 resets, run finished after 559 ms. (steps per millisecond=280 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 226000 steps, including 3362 resets, run finished after 804 ms. (steps per millisecond=281 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:41:38] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:41:38] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:41:38] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:41:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 22:41:42] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 4180 ms to find 0 implicit places.
[2021-05-08 22:41:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:41:42] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:41:42] [INFO ] Dead Transitions using invariants and state equation in 589 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 254/254 transitions.
Incomplete random walk after 100000 steps, including 1353 resets, run finished after 340 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:41:43] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:41:43] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:43] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-08 22:41:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2021-05-08 22:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:44] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2021-05-08 22:41:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 22:41:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:41:44] [INFO ] Deduced a trap composed of 6 places in 41 ms
[2021-05-08 22:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-08 22:41:44] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 14 ms.
[2021-05-08 22:41:45] [INFO ] Added : 243 causal constraints over 49 iterations in 1333 ms. Result :sat
[2021-05-08 22:41:45] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 22:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:46] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2021-05-08 22:41:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2021-05-08 22:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:46] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-08 22:41:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-08 22:41:46] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 16 ms.
[2021-05-08 22:41:47] [INFO ] Added : 184 causal constraints over 37 iterations in 927 ms. Result :sat
[2021-05-08 22:41:47] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:48] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2021-05-08 22:41:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2021-05-08 22:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:48] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2021-05-08 22:41:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-08 22:41:48] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 14 ms.
[2021-05-08 22:41:50] [INFO ] Added : 240 causal constraints over 48 iterations in 1178 ms. Result :sat
[2021-05-08 22:41:50] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2021-05-08 22:41:50] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2021-05-08 22:41:50] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2021-05-08 22:41:50] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2021-05-08 22:41:50] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2021-05-08 22:41:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 432 ms
[2021-05-08 22:41:50] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 22:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:51] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2021-05-08 22:41:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2021-05-08 22:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:52] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2021-05-08 22:41:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:41:52] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 13 ms.
[2021-05-08 22:41:53] [INFO ] Added : 246 causal constraints over 50 iterations in 1297 ms. Result :sat
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2021-05-08 22:41:53] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2021-05-08 22:41:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2021-05-08 22:41:53] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 22:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:54] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2021-05-08 22:41:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 22:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:54] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2021-05-08 22:41:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:41:54] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 15 ms.
[2021-05-08 22:41:56] [INFO ] Added : 174 causal constraints over 35 iterations in 1062 ms. Result :sat
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 17 places in 35 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 17 places in 36 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2021-05-08 22:41:56] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2021-05-08 22:41:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 370 ms
[2021-05-08 22:41:56] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:56] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2021-05-08 22:41:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2021-05-08 22:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:57] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2021-05-08 22:41:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-08 22:41:57] [INFO ] Deduced a trap composed of 6 places in 43 ms
[2021-05-08 22:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-08 22:41:57] [INFO ] Computed and/alt/rep : 253/1209/253 causal constraints in 14 ms.
[2021-05-08 22:41:58] [INFO ] Added : 244 causal constraints over 49 iterations in 1299 ms. Result :sat
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 312 cols
[2021-05-08 22:41:58] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:41:58] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:59] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2021-05-08 22:41:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2021-05-08 22:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:00] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2021-05-08 22:42:00] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2021-05-08 22:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 22:42:00] [INFO ] Computed and/alt/rep : 253/1205/253 causal constraints in 15 ms.
[2021-05-08 22:42:01] [INFO ] Added : 230 causal constraints over 46 iterations in 986 ms. Result :sat
[2021-05-08 22:42:01] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2021-05-08 22:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 22:42:01] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:42:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-08 22:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:01] [INFO ] [Real]Absence check using state equation in 428 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 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:42:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 45 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 468 ms returned sat
[2021-05-08 22:42:02] [INFO ] Computed and/alt/rep : 253/1205/253 causal constraints in 16 ms.
[2021-05-08 22:42:03] [INFO ] Added : 202 causal constraints over 41 iterations in 1004 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 22:42:03] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:42:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:03] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2021-05-08 22:42:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:42:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 65 ms returned sat
[2021-05-08 22:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:04] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2021-05-08 22:42:04] [INFO ] Computed and/alt/rep : 253/1205/253 causal constraints in 15 ms.
[2021-05-08 22:42:05] [INFO ] Added : 237 causal constraints over 48 iterations in 1071 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 22:42:05] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:42:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 22:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:06] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2021-05-08 22:42:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:42:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2021-05-08 22:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:07] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2021-05-08 22:42:07] [INFO ] Computed and/alt/rep : 253/1205/253 causal constraints in 13 ms.
[2021-05-08 22:42:08] [INFO ] Added : 247 causal constraints over 50 iterations in 1209 ms. Result :sat
[2021-05-08 22:42:08] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2021-05-08 22:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 22:42:08] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:42:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 22:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:09] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2021-05-08 22:42:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:42:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 22:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:09] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-08 22:42:09] [INFO ] Computed and/alt/rep : 253/1205/253 causal constraints in 14 ms.
[2021-05-08 22:42:10] [INFO ] Added : 167 causal constraints over 34 iterations in 992 ms. Result :sat
[2021-05-08 22:42:10] [INFO ] Deduced a trap composed of 16 places in 60 ms
[2021-05-08 22:42:10] [INFO ] Deduced a trap composed of 23 places in 51 ms
[2021-05-08 22:42:10] [INFO ] Deduced a trap composed of 19 places in 30 ms
[2021-05-08 22:42:11] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2021-05-08 22:42:11] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2021-05-08 22:42:11] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2021-05-08 22:42:11] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2021-05-08 22:42:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 536 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:42:11] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:42:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:11] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-08 22:42:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:42:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:42:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 70 ms returned sat
[2021-05-08 22:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:42:12] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-08 22:42:12] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2021-05-08 22:42:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-08 22:42:12] [INFO ] Computed and/alt/rep : 253/1205/253 causal constraints in 13 ms.
[2021-05-08 22:42:13] [INFO ] Added : 244 causal constraints over 49 iterations in 1334 ms. Result :sat
[2021-05-08 22:42:13] [INFO ] Deduced a trap composed of 13 places in 44 ms
[2021-05-08 22:42:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 22:42:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-08 22:42:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2021-05-08 22:42:14] [INFO ] Flatten gal took : 125 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-50a @ 3570 seconds

FORMULA DES-PT-50a-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ DES-PT-50a

{
"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:42:15 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 (((p158 <= 0) OR (p204 <= 0))))",
"processed_size": 37,
"rewrites": 2
},
"result":
{
"edges": 2314,
"markings": 2239,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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 <= p180) AND (1 <= p204))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 1016,
"markings": 985,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 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 <= p109) AND (1 <= p228))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 1360,
"markings": 1361,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 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 <= p5) AND (1 <= p231) AND (1 <= p233))))",
"processed_size": 51,
"rewrites": 1
},
"result":
{
"edges": 2205,
"markings": 2206,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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 <= p20) AND (1 <= p231) AND (1 <= p233) AND ((p186 <= 0) OR (p204 <= 0)))))",
"processed_size": 86,
"rewrites": 1
},
"result":
{
"edges": 1494,
"markings": 1495,
"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": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((p104 <= 0) OR (p228 <= 0)) AND ((p111 <= 0) OR (p228 <= 0)) AND ((p262 <= 0) OR (p278 <= 0) OR (p194 <= 0) OR (p204 <= 0)))))",
"processed_size": 139,
"rewrites": 2
},
"result":
{
"edges": 6533,
"markings": 4896,
"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": 8,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 25448,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1252,
"conflict_clusters": 42,
"places": 312,
"places_significant": 252,
"singleton_clusters": 0,
"transitions": 254
},
"result":
{
"preliminary_value": "yes yes no no yes yes ",
"value": "yes yes no 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: 566/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 312
lola: finding significant places
lola: 312 places, 254 transitions, 252 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: E (F (((1 <= p5) AND (1 <= p231) AND (1 <= p233)))) : E (F (((1 <= p20) AND (1 <= p231) AND (1 <= p233) AND ((p186 <= 0) OR (p204 <= 0))))) : A (G (((p158 <= 0) OR (p204 <= 0)))) : A (G ((((p104 <= 0) OR (p228 <= 0)) AND ((p111 <= 0) OR (p228 <= 0)) AND ((p262 <= 0) OR (p278 <= 0) OR (p194 <= 0) OR (p204 <= 0))))) : E (F (((1 <= p180) AND (1 <= p204)))) : E (F (((1 <= p109) AND (1 <= p228))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p158 <= 0) OR (p204 <= 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 (((p158 <= 0) OR (p204 <= 0))))
lola: processed formula length: 37
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 <= p158) AND (1 <= p204))
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.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2239 markings, 2314 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p180) 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 <= p180) AND (1 <= p204))))
lola: processed formula length: 37
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 985 markings, 1016 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p109) AND (1 <= p228))))
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 <= p109) AND (1 <= p228))))
lola: processed formula length: 37
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1361 markings, 1360 edges
lola: formula 0: ((1 <= p109) AND (1 <= p228))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p5) AND (1 <= p231) AND (1 <= p233))))
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 <= p5) AND (1 <= p231) AND (1 <= p233))))
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 <= p5) AND (1 <= p231) AND (1 <= p233))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2206 markings, 2205 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20) AND (1 <= p231) AND (1 <= p233) AND ((p186 <= 0) OR (p204 <= 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 <= p20) AND (1 <= p231) AND (1 <= p233) AND ((p186 <= 0) OR (p204 <= 0)))))
lola: processed formula length: 86
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 <= p20) AND (1 <= p231) AND (1 <= p233) AND ((p186 <= 0) OR (p204 <= 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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1495 markings, 1494 edges
lola: ========================================
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p104 <= 0) OR (p228 <= 0)) AND ((p111 <= 0) OR (p228 <= 0)) AND ((p262 <= 0) OR (p278 <= 0) OR (p194 <= 0) OR (p204 <= 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 ((((p104 <= 0) OR (p228 <= 0)) AND ((p111 <= 0) OR (p228 <= 0)) AND ((p262 <= 0) OR (p278 <= 0) OR (p194 <= 0) OR (p204 <= 0)))))
lola: processed formula length: 139
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 <= p104) AND (1 <= p228)) OR ((1 <= p111) AND (1 <= p228)) OR ((1 <= p262) AND (1 <= p278) AND (1 <= p194) AND (1 <= p204)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4896 markings, 6533 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes
lola:
preliminary result: yes yes no no yes yes
lola: memory consumption: 25448 KB
lola: time consumption: 4 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-50a"
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-50a, 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-162039097100068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 ;