Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000540.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 146K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591162465442

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:34:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:34:26] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-03 05:34:26] [INFO ] Transformed 586 places.
[2020-06-03 05:34:26] [INFO ] Transformed 525 transitions.
[2020-06-03 05:34:26] [INFO ] Found NUPN structural information;
[2020-06-03 05:34:26] [INFO ] Parsed PT model containing 586 places and 525 transitions in 98 ms.
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100000 steps, including 725 resets, run finished after 292 ms. (steps per millisecond=342 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2020-06-03 05:34:27] [INFO ] Computed 98 place invariants in 20 ms
[2020-06-03 05:34:27] [INFO ] [Real]Absence check using 55 positive place invariants in 44 ms returned sat
[2020-06-03 05:34:27] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:27] [INFO ] [Real]Absence check using state equation in 565 ms returned unsat
[2020-06-03 05:34:28] [INFO ] [Real]Absence check using 55 positive place invariants in 42 ms returned sat
[2020-06-03 05:34:28] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-06-03 05:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:28] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2020-06-03 05:34:28] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 29 places in 91 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 32 places in 115 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 31 places in 117 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 25 places in 114 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 22 places in 109 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 05:34:29] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 26 places in 67 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 33 places in 60 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 32 places in 63 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 45 places in 60 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 33 places in 63 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 32 places in 57 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 33 places in 59 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 47 places in 57 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 40 places in 60 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 48 places in 61 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 51 places in 67 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 29 places in 65 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 24 places in 80 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 37 places in 65 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 45 places in 58 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 46 places in 59 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 54 places in 62 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 40 places in 65 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 63 places in 63 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 67 places in 62 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 35 places in 64 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 38 places in 63 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 63 places in 65 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 37 places in 63 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 27 places in 64 ms
[2020-06-03 05:34:32] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 3684 ms
[2020-06-03 05:34:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 47 ms returned sat
[2020-06-03 05:34:32] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:33] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 30 places in 84 ms
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 05:34:33] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 31 places in 75 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 35 places in 81 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 32 places in 68 ms
[2020-06-03 05:34:34] [INFO ] Deduced a trap composed of 26 places in 69 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 52 places in 66 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 21 places in 65 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 25 places in 66 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 31 places in 67 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 40 places in 62 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 30 places in 62 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 30 places in 67 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 48 places in 68 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 50 places in 69 ms
[2020-06-03 05:34:35] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 44 places in 66 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 40 places in 63 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 28 places in 62 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 50 places in 62 ms
[2020-06-03 05:34:36] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 3158 ms
[2020-06-03 05:34:36] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 26 ms.
[2020-06-03 05:34:39] [INFO ] Added : 313 causal constraints over 64 iterations in 2956 ms. Result :sat
[2020-06-03 05:34:39] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-06-03 05:34:39] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using state equation in 608 ms returned unsat
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-06-03 05:34:40] [INFO ] Deduced a trap composed of 15 places in 149 ms
[2020-06-03 05:34:41] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-06-03 05:34:41] [INFO ] Deduced a trap composed of 22 places in 136 ms
[2020-06-03 05:34:41] [INFO ] Deduced a trap composed of 133 places in 134 ms
[2020-06-03 05:34:41] [INFO ] Deduced a trap composed of 23 places in 135 ms
[2020-06-03 05:34:41] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2020-06-03 05:34:41] [INFO ] Deduced a trap composed of 127 places in 133 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 26 places in 131 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 16 places in 110 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 119 places in 127 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 116 places in 122 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 24 places in 126 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 32 places in 126 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 22 places in 122 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 30 places in 74 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 26 places in 65 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 33 places in 69 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 22 places in 70 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 42 places in 67 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 31 places in 62 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 30 places in 58 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 49 places in 68 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 34 places in 62 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 35 places in 62 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 45 places in 73 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 47 places in 67 ms
[2020-06-03 05:34:44] [INFO ] Deduced a trap composed of 47 places in 68 ms
[2020-06-03 05:34:44] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 3875 ms
[2020-06-03 05:34:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 42 ms returned sat
[2020-06-03 05:34:44] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:45] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-06-03 05:34:45] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 05:34:45] [INFO ] Deduced a trap composed of 13 places in 122 ms
[2020-06-03 05:34:45] [INFO ] Deduced a trap composed of 26 places in 123 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 119 places in 109 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 116 places in 136 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 118 places in 147 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 19 places in 130 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 31 places in 132 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 24 places in 137 ms
[2020-06-03 05:34:47] [INFO ] Deduced a trap composed of 22 places in 126 ms
[2020-06-03 05:34:47] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 05:34:47] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-06-03 05:34:47] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-03 05:34:48] [INFO ] Deduced a trap composed of 18 places in 967 ms
[2020-06-03 05:34:48] [INFO ] Deduced a trap composed of 22 places in 197 ms
[2020-06-03 05:34:49] [INFO ] Deduced a trap composed of 27 places in 1142 ms
[2020-06-03 05:34:49] [INFO ] Deduced a trap composed of 38 places in 66 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 27 places in 77 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 21 places in 74 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 32 places in 77 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 43 places in 85 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 44 places in 72 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 48 places in 72 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 47 places in 70 ms
[2020-06-03 05:34:50] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 05:34:51] [INFO ] Deduced a trap composed of 48 places in 65 ms
[2020-06-03 05:34:51] [INFO ] Deduced a trap composed of 42 places in 65 ms
[2020-06-03 05:34:51] [INFO ] Deduced a trap composed of 46 places in 62 ms
[2020-06-03 05:34:51] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5761 ms
[2020-06-03 05:34:51] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 17 ms.
[2020-06-03 05:34:53] [INFO ] Added : 309 causal constraints over 62 iterations in 2310 ms. Result :sat
[2020-06-03 05:34:53] [INFO ] Deduced a trap composed of 42 places in 57 ms
[2020-06-03 05:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2020-06-03 05:34:53] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:34:53] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:54] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-06-03 05:34:54] [INFO ] Deduced a trap composed of 16 places in 94 ms
[2020-06-03 05:34:54] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-06-03 05:34:54] [INFO ] Deduced a trap composed of 15 places in 88 ms
[2020-06-03 05:34:54] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 20 places in 91 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 34 places in 86 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 32 places in 85 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 35 places in 86 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 37 places in 83 ms
[2020-06-03 05:34:55] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 25 places in 82 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 23 places in 65 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 35 places in 61 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 24 places in 61 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 39 places in 52 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 41 places in 48 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 44 places in 51 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 28 places in 49 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 28 places in 58 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 24 places in 62 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 46 places in 71 ms
[2020-06-03 05:34:57] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 2986 ms
[2020-06-03 05:34:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:58] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 20 places in 84 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 24 places in 79 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 41 places in 91 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 21 places in 76 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 35 places in 72 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 54 places in 141 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 20 places in 73 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 20 places in 74 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 28 places in 72 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 36 places in 69 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 41 places in 75 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 43 places in 72 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 43 places in 73 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 41 places in 73 ms
[2020-06-03 05:35:00] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2756 ms
[2020-06-03 05:35:00] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 26 ms.
[2020-06-03 05:35:03] [INFO ] Added : 303 causal constraints over 61 iterations in 2563 ms. Result :sat
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using 55 positive place invariants in 72 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:04] [INFO ] [Real]Absence check using state equation in 533 ms returned unsat
[2020-06-03 05:35:04] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-06-03 05:35:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:05] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 15 places in 205 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 22 places in 201 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 13 places in 150 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 142 places in 150 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 128 places in 196 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 20 places in 159 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 34 places in 159 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 19 places in 137 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 32 places in 572 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 23 places in 160 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 33 places in 158 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 131 places in 161 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 128 places in 133 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 29 places in 127 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 125 places in 123 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 28 places in 125 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 26 places in 121 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 37 places in 119 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 36 places in 118 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 36 places in 123 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 129 places in 127 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 42 places in 112 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 25 places in 110 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 124 places in 121 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 128 places in 119 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 130 places in 135 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 35 places in 126 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 137 places in 129 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 39 places in 113 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 124 places in 116 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 143 places in 111 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 30 places in 113 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 28 places in 110 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 129 places in 116 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 127 places in 130 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 134 places in 133 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 132 places in 110 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 47 places in 126 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 119 places in 188 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 130 places in 434 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 40 places in 222 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 132 places in 260 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 35 places in 197 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 130 places in 114 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 129 places in 108 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 136 places in 110 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 136 places in 105 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 136 places in 103 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 129 places in 101 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 133 places in 102 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 135 places in 104 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 134 places in 129 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 139 places in 130 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 125 places in 126 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 144 places in 125 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 132 places in 125 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 126 places in 119 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 126 places in 131 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 133 places in 118 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 142 places in 122 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 125 places in 121 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 138 places in 117 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 128 places in 124 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 131 places in 107 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 131 places in 124 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 148 places in 122 ms
[2020-06-03 05:35:17] [INFO ] Deduced a trap composed of 134 places in 120 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 127 places in 100 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 131 places in 127 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 132 places in 121 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 127 places in 106 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 125 places in 103 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 132 places in 100 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 135 places in 98 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 120 places in 101 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 123 places in 99 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 119 places in 99 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 123 places in 97 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 127 places in 102 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 131 places in 98 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 121 places in 98 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 126 places in 98 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 125 places in 119 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 122 places in 111 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 126 places in 99 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 139 places in 101 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 132 places in 98 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 127 places in 99 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 129 places in 99 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 124 places in 97 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 121 places in 96 ms
[2020-06-03 05:35:21] [INFO ] Trap strengthening (SAT) tested/added 102/101 trap constraints in 15969 ms
[2020-06-03 05:35:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:21] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:35:21] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:21] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2020-06-03 05:35:21] [INFO ] Deduced a trap composed of 121 places in 171 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 18 places in 167 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 28 places in 165 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 36 places in 162 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 33 places in 139 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 30 places in 162 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 128 places in 160 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 123 places in 135 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 23 places in 130 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 23 places in 140 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 44 places in 140 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 35 places in 124 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 123 places in 127 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 130 places in 160 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 141 places in 154 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 24 places in 150 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 50 places in 146 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 36 places in 147 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 123 places in 150 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 35 places in 150 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 141 places in 150 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 145 places in 127 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 123 places in 148 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 49 places in 144 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 110 places in 153 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 31 places in 143 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 112 places in 143 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 144 places in 143 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 30 places in 91 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 25 places in 89 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 60 places in 153 ms
[2020-06-03 05:35:27] [INFO ] Deduced a trap composed of 121 places in 144 ms
[2020-06-03 05:35:28] [INFO ] Deduced a trap composed of 29 places in 138 ms
[2020-06-03 05:35:28] [INFO ] Deduced a trap composed of 30 places in 141 ms
[2020-06-03 05:35:28] [INFO ] Deduced a trap composed of 122 places in 140 ms
[2020-06-03 05:35:28] [INFO ] Deduced a trap composed of 43 places in 150 ms
[2020-06-03 05:35:28] [INFO ] Deduced a trap composed of 130 places in 146 ms
[2020-06-03 05:35:28] [INFO ] Deduced a trap composed of 83 places in 135 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 38 places in 127 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 137 places in 147 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 146 places in 141 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 130 places in 149 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 75 places in 144 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 77 places in 147 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 128 places in 147 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 133 places in 144 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 137 places in 144 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 72 places in 142 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 81 places in 142 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 64 places in 145 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 124 places in 138 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 84 places in 73 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 58 places in 78 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 74 places in 76 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 76 places in 150 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 137 places in 147 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 133 places in 148 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 131 places in 143 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 73 places in 75 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 75 places in 74 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 68 places in 74 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 75 places in 73 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 86 places in 59 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 89 places in 72 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 135 places in 128 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 135 places in 141 ms
[2020-06-03 05:35:33] [INFO ] Deduced a trap composed of 136 places in 129 ms
[2020-06-03 05:35:33] [INFO ] Deduced a trap composed of 131 places in 119 ms
[2020-06-03 05:35:33] [INFO ] Deduced a trap composed of 137 places in 117 ms
[2020-06-03 05:35:33] [INFO ] Deduced a trap composed of 133 places in 120 ms
[2020-06-03 05:35:33] [INFO ] Deduced a trap composed of 139 places in 121 ms
[2020-06-03 05:35:33] [INFO ] Deduced a trap composed of 136 places in 269 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 146 places in 118 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 124 places in 117 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 128 places in 118 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 133 places in 116 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 150 places in 120 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 148 places in 113 ms
[2020-06-03 05:35:34] [INFO ] Deduced a trap composed of 120 places in 113 ms
[2020-06-03 05:35:35] [INFO ] Deduced a trap composed of 123 places in 109 ms
[2020-06-03 05:35:35] [INFO ] Deduced a trap composed of 138 places in 124 ms
[2020-06-03 05:35:35] [INFO ] Trap strengthening (SAT) tested/added 87/86 trap constraints in 13494 ms
[2020-06-03 05:35:35] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 20 ms.
[2020-06-03 05:35:38] [INFO ] Added : 377 causal constraints over 76 iterations in 3513 ms. Result :sat
[2020-06-03 05:35:38] [INFO ] Deduced a trap composed of 151 places in 124 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 141 places in 122 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 140 places in 119 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 152 places in 119 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 158 places in 109 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 159 places in 108 ms
[2020-06-03 05:35:40] [INFO ] Deduced a trap composed of 137 places in 104 ms
[2020-06-03 05:35:40] [INFO ] Deduced a trap composed of 129 places in 106 ms
[2020-06-03 05:35:40] [INFO ] Deduced a trap composed of 134 places in 104 ms
[2020-06-03 05:35:40] [INFO ] Deduced a trap composed of 141 places in 105 ms
[2020-06-03 05:35:40] [INFO ] Deduced a trap composed of 127 places in 106 ms
[2020-06-03 05:35:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:35:41] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-06-03 05:35:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s231) 0)") while checking expression at index 6
[2020-06-03 05:35:41] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned unsat
[2020-06-03 05:35:41] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:35:41] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:42] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-06-03 05:35:42] [INFO ] Deduced a trap composed of 13 places in 151 ms
[2020-06-03 05:35:42] [INFO ] Deduced a trap composed of 138 places in 149 ms
[2020-06-03 05:35:42] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 05:35:42] [INFO ] Deduced a trap composed of 17 places in 149 ms
[2020-06-03 05:35:43] [INFO ] Deduced a trap composed of 26 places in 141 ms
[2020-06-03 05:35:43] [INFO ] Deduced a trap composed of 25 places in 144 ms
[2020-06-03 05:35:43] [INFO ] Deduced a trap composed of 35 places in 132 ms
[2020-06-03 05:35:43] [INFO ] Deduced a trap composed of 138 places in 131 ms
[2020-06-03 05:35:43] [INFO ] Deduced a trap composed of 14 places in 129 ms
[2020-06-03 05:35:43] [INFO ] Deduced a trap composed of 27 places in 126 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 138 places in 181 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 137 places in 127 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 24 places in 136 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 23 places in 139 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 24 places in 137 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 27 places in 129 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 28 places in 123 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 44 places in 116 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 128 places in 121 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 37 places in 115 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 22 places in 116 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 133 places in 117 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 49 places in 114 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 47 places in 114 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 28 places in 115 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 47 places in 115 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 32 places in 117 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 123 places in 152 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 30 places in 116 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 63 places in 114 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 127 places in 131 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 48 places in 202 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 27 places in 124 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 26 places in 129 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 126 places in 130 ms
[2020-06-03 05:35:48] [INFO ] Deduced a trap composed of 26 places in 129 ms
[2020-06-03 05:35:48] [INFO ] Deduced a trap composed of 128 places in 126 ms
[2020-06-03 05:35:48] [INFO ] Deduced a trap composed of 135 places in 126 ms
[2020-06-03 05:35:48] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-06-03 05:35:48] [INFO ] Deduced a trap composed of 47 places in 213 ms
[2020-06-03 05:35:48] [INFO ] Deduced a trap composed of 49 places in 116 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 21 places in 114 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 52 places in 114 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 30 places in 132 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 28 places in 132 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 43 places in 129 ms
[2020-06-03 05:35:49] [INFO ] Deduced a trap composed of 120 places in 114 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 39 places in 128 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 48 places in 127 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 133 places in 130 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 45 places in 116 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 132 places in 130 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 41 places in 156 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 38 places in 150 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 137 places in 149 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 135 places in 116 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 137 places in 125 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 134 places in 130 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 138 places in 141 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 51 places in 143 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 131 places in 144 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 44 places in 132 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 49 places in 119 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 128 places in 118 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 46 places in 115 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 134 places in 110 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 131 places in 124 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 120 places in 115 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 53 places in 114 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 117 places in 125 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 127 places in 157 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 53 places in 106 ms
[2020-06-03 05:35:53] [INFO ] Deduced a trap composed of 133 places in 123 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 143 places in 118 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 140 places in 123 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 140 places in 129 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 136 places in 113 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 133 places in 111 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 136 places in 113 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 137 places in 111 ms
[2020-06-03 05:35:55] [INFO ] Deduced a trap composed of 132 places in 114 ms
[2020-06-03 05:35:55] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 12885 ms
[2020-06-03 05:35:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:55] [INFO ] [Nat]Absence check using 55 positive place invariants in 46 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:55] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2020-06-03 05:35:55] [INFO ] Deduced a trap composed of 14 places in 141 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 24 places in 131 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 16 places in 132 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 31 places in 130 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 22 places in 130 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 24 places in 129 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 126 places in 126 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 132 places in 123 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 123 places in 127 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 128 places in 157 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 132 places in 125 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 22 places in 122 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 140 places in 126 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 137 places in 150 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 134 places in 146 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 136 places in 150 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 130 places in 125 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 122 places in 122 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 29 places in 122 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 23 places in 121 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 35 places in 120 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 27 places in 147 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 30 places in 148 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 133 places in 154 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 35 places in 149 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 41 places in 147 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 129 places in 123 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 131 places in 152 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 136 places in 149 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 130 places in 146 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 23 places in 147 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 129 places in 144 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 35 places in 144 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 125 places in 147 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 22 places in 147 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 147 places in 149 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 45 places in 148 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 29 places in 146 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 27 places in 122 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 26 places in 148 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 51 places in 143 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 132 places in 146 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 141 places in 145 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 145 places in 142 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 22 places in 141 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 134 places in 140 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 161 places in 138 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 153 places in 139 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 46 places in 55 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 57 places in 56 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 50 places in 50 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 137 places in 141 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 132 places in 133 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 47 places in 119 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 132 places in 116 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 38 places in 116 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 139 places in 116 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 41 places in 111 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 137 places in 110 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 135 places in 114 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 123 places in 127 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 49 places in 121 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 124 places in 127 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 51 places in 109 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 130 places in 120 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 37 places in 105 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 124 places in 178 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 126 places in 108 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 61 places in 105 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 136 places in 114 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 137 places in 107 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 40 places in 113 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 126 places in 114 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 59 places in 123 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 133 places in 122 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 131 places in 125 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 123 places in 116 ms
[2020-06-03 05:36:08] [INFO ] Trap strengthening (SAT) tested/added 87/86 trap constraints in 13062 ms
[2020-06-03 05:36:08] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 38 ms.
[2020-06-03 05:36:12] [INFO ] Added : 346 causal constraints over 70 iterations in 3137 ms. Result :sat
[2020-06-03 05:36:12] [INFO ] Deduced a trap composed of 138 places in 117 ms
[2020-06-03 05:36:12] [INFO ] Deduced a trap composed of 164 places in 128 ms
[2020-06-03 05:36:12] [INFO ] Deduced a trap composed of 141 places in 120 ms
[2020-06-03 05:36:12] [INFO ] Deduced a trap composed of 141 places in 127 ms
[2020-06-03 05:36:12] [INFO ] Deduced a trap composed of 151 places in 124 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 140 places in 117 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 147 places in 115 ms
[2020-06-03 05:36:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1353 ms
[2020-06-03 05:36:13] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-06-03 05:36:13] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2020-06-03 05:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:14] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 11 places in 133 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 19 places in 124 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 122 places in 124 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 22 places in 120 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 17 places in 126 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 25 places in 118 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 31 places in 120 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 32 places in 120 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 23 places in 118 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 108 places in 119 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 21 places in 117 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 30 places in 112 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 39 places in 113 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 28 places in 113 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 21 places in 112 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 26 places in 113 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 29 places in 111 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 27 places in 111 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 27 places in 109 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 124 places in 109 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 41 places in 108 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 45 places in 114 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 130 places in 112 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 135 places in 107 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 135 places in 106 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 134 places in 105 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 136 places in 107 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 129 places in 110 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 126 places in 107 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 128 places in 111 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 124 places in 106 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 123 places in 104 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 128 places in 109 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 130 places in 107 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 130 places in 109 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 136 places in 102 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 133 places in 103 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 149 places in 103 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 19 places in 103 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 25 places in 103 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 40 places in 107 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 107 places in 103 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 129 places in 102 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 44 places in 106 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 67 places in 101 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 42 places in 98 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 29 places in 103 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 50 places in 101 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 104 places in 102 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 43 places in 96 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 57 places in 100 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 125 places in 101 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 128 places in 103 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 111 places in 101 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 112 places in 103 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 113 places in 103 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 112 places in 100 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 114 places in 107 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 108 places in 104 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 107 places in 104 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 106 places in 101 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 103 places in 101 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 110 places in 106 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 117 places in 114 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 121 places in 98 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 104 places in 102 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 108 places in 101 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 119 places in 99 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 109 places in 99 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 118 places in 104 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 119 places in 108 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 122 places in 102 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 120 places in 101 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 121 places in 106 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 120 places in 101 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 119 places in 107 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 126 places in 100 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 120 places in 105 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 120 places in 97 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 124 places in 101 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 130 places in 99 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 125 places in 98 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 127 places in 101 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 127 places in 92 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 126 places in 102 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 124 places in 100 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 126 places in 103 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 29 places in 110 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 129 places in 110 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 34 places in 105 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 134 places in 104 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 32 places in 101 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 30 places in 104 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 31 places in 109 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 35 places in 107 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 31 places in 109 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 34 places in 105 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 37 places in 105 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 28 places in 102 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 126 places in 101 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 126 places in 94 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 28 places in 100 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 128 places in 96 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 135 places in 101 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 32 places in 100 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 128 places in 105 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 124 places in 100 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 123 places in 97 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 134 places in 100 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 128 places in 101 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 136 places in 97 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 125 places in 103 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 134 places in 104 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 121 places in 101 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 129 places in 98 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 123 places in 99 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 133 places in 98 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 125 places in 96 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 133 places in 96 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 135 places in 100 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 130 places in 99 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 130 places in 103 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 53 places in 51 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 63 places in 52 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 25 places in 54 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 24 places in 50 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 32 places in 49 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 36 places in 52 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 50 places in 50 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 54 places in 54 ms
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 64 places in 51 ms
[2020-06-03 05:36:31] [INFO ] Trap strengthening (SAT) tested/added 142/141 trap constraints in 17524 ms
[2020-06-03 05:36:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-06-03 05:36:31] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:32] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2020-06-03 05:36:32] [INFO ] Deduced a trap composed of 122 places in 151 ms
[2020-06-03 05:36:32] [INFO ] Deduced a trap composed of 124 places in 132 ms
[2020-06-03 05:36:32] [INFO ] Deduced a trap composed of 16 places in 130 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 13 places in 132 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 16 places in 126 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 23 places in 126 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 18 places in 127 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 131 places in 130 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 19 places in 122 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 17 places in 122 ms
[2020-06-03 05:36:34] [INFO ] Deduced a trap composed of 123 places in 123 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 36 places in 122 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 22 places in 149 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 33 places in 151 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 124 places in 151 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 39 places in 149 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 32 places in 147 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 35 places in 149 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 42 places in 145 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 31 places in 142 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 44 places in 147 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 38 places in 122 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 42 places in 119 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 130 places in 148 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 135 places in 146 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 41 places in 143 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 38 places in 140 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 135 places in 120 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 49 places in 147 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 44 places in 145 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 53 places in 143 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 130 places in 141 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 132 places in 144 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 134 places in 116 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 129 places in 146 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 129 places in 142 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 131 places in 141 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 129 places in 141 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 128 places in 116 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 132 places in 124 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 135 places in 121 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 25 places in 30 ms
[2020-06-03 05:36:40] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 8135 ms
[2020-06-03 05:36:40] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 24 ms.
[2020-06-03 05:36:43] [INFO ] Added : 340 causal constraints over 68 iterations in 2925 ms. Result :sat
[2020-06-03 05:36:43] [INFO ] [Real]Absence check using 55 positive place invariants in 58 ms returned sat
[2020-06-03 05:36:43] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 38 ms returned sat
[2020-06-03 05:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:45] [INFO ] [Real]Absence check using state equation in 1941 ms returned sat
[2020-06-03 05:36:45] [INFO ] Deduced a trap composed of 13 places in 294 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 150 places in 161 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 16 places in 275 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 20 places in 354 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 134 places in 160 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 36 places in 159 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 135 places in 154 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 29 places in 155 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 33 places in 153 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 38 places in 273 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 134 places in 152 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 135 places in 147 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 40 places in 146 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 121 places in 148 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 128 places in 144 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 136 places in 148 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 151 places in 146 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 127 places in 145 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 37 places in 145 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 31 places in 142 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 46 places in 143 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 135 places in 143 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 129 places in 144 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 137 places in 147 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 138 places in 142 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 40 places in 143 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 134 places in 143 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 132 places in 145 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 146 places in 145 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 126 places in 143 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 158 places in 144 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 144 places in 142 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 45 places in 142 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 139 places in 148 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 44 places in 138 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 40 places in 141 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 132 places in 140 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 131 places in 137 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 148 places in 145 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 128 places in 148 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 17 places in 146 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 21 places in 144 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 28 places in 144 ms
[2020-06-03 05:36:54] [INFO ] Deduced a trap composed of 35 places in 141 ms
[2020-06-03 05:36:54] [INFO ] Deduced a trap composed of 130 places in 145 ms
[2020-06-03 05:36:54] [INFO ] Deduced a trap composed of 37 places in 143 ms
[2020-06-03 05:36:54] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-03 05:36:54] [INFO ] Deduced a trap composed of 127 places in 144 ms
[2020-06-03 05:36:54] [INFO ] Deduced a trap composed of 131 places in 139 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 48 places in 135 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 64 places in 120 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 125 places in 114 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 129 places in 148 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 45 places in 143 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 58 places in 131 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 134 places in 144 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 120 places in 144 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 128 places in 126 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 129 places in 116 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 43 places in 156 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 129 places in 146 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 120 places in 140 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 142 places in 144 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 144 places in 119 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 136 places in 149 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 123 places in 144 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 34 places in 114 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 48 places in 112 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 122 places in 113 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 46 places in 109 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 43 places in 111 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 131 places in 111 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 27 places in 112 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 135 places in 112 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 47 places in 111 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 131 places in 111 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 50 places in 114 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 148 places in 112 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 27 places in 115 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 38 places in 115 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 40 places in 115 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 136 places in 115 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 36 places in 111 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 41 places in 112 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 134 places in 111 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 144 places in 113 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 141 places in 112 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 31 places in 105 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 130 places in 108 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 36 places in 107 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 134 places in 106 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 129 places in 106 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 41 places in 105 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 141 places in 105 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 54 places in 102 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 140 places in 111 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 122 places in 110 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 150 places in 136 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 133 places in 112 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 135 places in 111 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 126 places in 112 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 128 places in 123 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 138 places in 125 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 122 places in 112 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 128 places in 111 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 133 places in 220 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 130 places in 190 ms
[2020-06-03 05:37:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s27 s28 s31 s32 s36 s37 s38 s66 s67 s68 s71 s75 s77 s83 s96 s108 s111 s165 s166 s167 s171 s172 s173 s191 s192 s193 s203 s204 s205 s206 s223 s224 s270 s284 s288 s289 s290 s294 s299 s304 s319 s329 s334 s339 s344 s349 s354 s369 s374 s379 s399 s404 s409 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s435 s436 s439 s440 s443 s444 s447 s448 s456 s461 s462 s463 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s482 s483 s484 s485 s488 s489 s490 s491 s492 s493 s494 s495 s498 s499 s509 s510 s515 s516 s517 s518 s525 s526 s527 s528 s529 s530 s531 s532 s539 s540 s543 s557 s572 s573) 0)") while checking expression at index 10
[2020-06-03 05:37:03] [INFO ] [Real]Absence check using 55 positive place invariants in 34 ms returned sat
[2020-06-03 05:37:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 6 ms returned unsat
[2020-06-03 05:37:03] [INFO ] [Real]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-06-03 05:37:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-06-03 05:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:04] [INFO ] [Real]Absence check using state equation in 494 ms returned unsat
[2020-06-03 05:37:04] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned unsat
[2020-06-03 05:37:04] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-06-03 05:37:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using state equation in 585 ms returned unsat
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using state equation in 464 ms returned unsat
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:06] [INFO ] [Real]Absence check using state equation in 509 ms returned unsat
[2020-06-03 05:37:06] [INFO ] [Real]Absence check using 55 positive place invariants in 63 ms returned sat
[2020-06-03 05:37:06] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-06-03 05:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:07] [INFO ] [Real]Absence check using state equation in 422 ms returned unsat
[2020-06-03 05:37:07] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-06-03 05:37:07] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:07] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2020-06-03 05:37:07] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-06-03 05:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2020-06-03 05:37:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:08] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2020-06-03 05:37:08] [INFO ] Deduced a trap composed of 11 places in 119 ms
[2020-06-03 05:37:08] [INFO ] Deduced a trap composed of 114 places in 112 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 122 places in 103 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 11 places in 107 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 19 places in 98 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 29 places in 108 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 122 places in 98 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 35 places in 107 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 137 places in 95 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2020-06-03 05:37:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1669 ms
[2020-06-03 05:37:10] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 16 ms.
[2020-06-03 05:37:11] [INFO ] Added : 161 causal constraints over 33 iterations in 969 ms. Result :sat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-06-03 05:37:11] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 05:37:11] [INFO ] Flatten gal took : 111 ms
[2020-06-03 05:37:11] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 05:37:11] [INFO ] Flatten gal took : 43 ms
FORMULA BusinessProcesses-PT-12-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:37:11] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-03 05:37:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-12 @ 3570 seconds

FORMULA BusinessProcesses-PT-12-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for CTLFireability @ BusinessProcesses-PT-12

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:37:11 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(EF(EG(((1 <= p54)))))",
"processed_size": 24,
"rewrites": 20
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 480,
"markings": 450,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p522))))",
"processed_size": 21,
"rewrites": 18
},
"result":
{
"edges": 104,
"markings": 105,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF((AG(((p87 <= 0) OR (p470 <= 0))) OR (EX(((1 <= p433))) OR EX(((1 <= p18))))))",
"processed_size": 81,
"rewrites": 21
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 3052,
"markings": 2505,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 3,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(A((((p93 <= 0) OR (p300 <= 0) OR (p548 <= 0)) AND ((p511 <= 0))) U EG(((1 <= p110)))) OR (EF(AX(((1 <= p562)))) OR EF(AX(((1 <= p79))))))",
"processed_size": 140,
"rewrites": 23
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 748,
"markings": 355,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 <= p386) AND (1 <= p199))))",
"processed_size": 37,
"rewrites": 18
},
"result":
{
"edges": 441,
"markings": 367,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p166))))",
"processed_size": 21,
"rewrites": 18
},
"result":
{
"edges": 144,
"markings": 145,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "E (F ((((1 <= p292)) OR ((1 <= p189)))))",
"processed_size": 41,
"rewrites": 18
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p297)) OR ((1 <= p135) AND (1 <= p322)) OR ((1 <= p218) AND (1 <= p404) AND (1 <= p543)))))",
"processed_size": 107,
"rewrites": 18
},
"result":
{
"edges": 30,
"markings": 30,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p51 <= 0))",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 125,
"markings": 125,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF(A((((1 <= p347)) OR ((1 <= p251))) U (((1 <= p536)) OR ((1 <= p426)))))",
"processed_size": 76,
"rewrites": 19
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 324,
"markings": 138,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p33) AND (1 <= p284) AND (1 <= p543)) R F (((p191 <= 0) OR (p370 <= 0) OR (p513 <= 0))))",
"processed_size": 98,
"rewrites": 26
},
"result":
{
"edges": 11806,
"markings": 8970,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p224 <= 0))))",
"processed_size": 21,
"rewrites": 19
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p141))",
"processed_size": 13,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((p515 <= 0))))",
"processed_size": 21,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((p232 <= 0) OR (p309 <= 0) OR (p543 <= 0))))",
"processed_size": 53,
"rewrites": 19
},
"result":
{
"edges": 1758,
"markings": 1188,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 38896,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(X(E(F(E(G(**)))))) : (E(F(**)) OR E(G(A(X(**))))) : E(F(**)) : A(F((A(G(**)) OR (E(X(**)) OR E(X(**)))))) : E(F(**)) : (** OR ((E(F(*)) OR (** OR **)) AND (A(G(**)) OR A(G(*))))) : A(F(**)) : (A((** U E(G(**)))) OR (E(F(A(X(**)))) OR E(F(A(X(**)))))) : E((** U E(G(**)))) : E(F(**)) : (A(X(**)) OR E(F(**))) : E(F(A((** U **))))"
},
"net":
{
"arcs": 1552,
"conflict_clusters": 437,
"places": 582,
"places_significant": 484,
"singleton_clusters": 0,
"transitions": 521
},
"result":
{
"preliminary_value": "yes yes yes no yes no no yes no yes yes yes ",
"value": "yes yes yes no yes no no yes no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 582
lola: finding significant places
lola: 582 places, 521 transitions, 484 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p522 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p470 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p515 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p329 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p368 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p548 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p562 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p370 <= 1)
lola: LP says that atomic proposition is always true: (p513 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p386 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p536 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: E (X (E (F (E (G (((1 <= p54)))))))) : (E (((0 <= 0) U E (F (((1 <= p522)))))) OR E (G (A (X (((1 <= p14))))))) : E (F ((((1 <= p292)) OR ((1 <= p189))))) : A (F (((A (G (((p87 <= 0) OR (p470 <= 0)))) OR E (X (((1 <= p433))))) OR E (X (((1 <= p18))))))) : E (F (((1 <= p166)))) : (((1 <= p141)) OR (((NOT(A (G (((1 <= p515))))) OR ((1 <= p156) AND (1 <= p354) AND (1 <= p543))) OR ((1 <= p26) AND (1 <= p379) AND (1 <= p543))) AND (A (G (((p232 <= 0) OR (p309 <= 0) OR (p543 <= 0)))) OR NOT(E (F (((1 <= p224)))))))) : (E (((((1 <= p129) AND (1 <= p329) AND (1 <= p543)) OR ((1 <= p166)) OR (p368 <= 0)) U (1 <= 0))) OR A (F (((1 <= p51))))) : (A (((((p93 <= 0) OR (p300 <= 0) OR (p548 <= 0)) AND ((p511 <= 0))) U E (G (((1 <= p110)))))) OR E (F ((A (X (((1 <= p562)))) OR A (X (((1 <= p79)))))))) : E ((((p33 <= 0) OR (p284 <= 0) OR (p543 <= 0)) U E (G (((1 <= p191) AND (1 <= p370) AND (1 <= p513)))))) : E (F ((((1 <= p297)) OR ((1 <= p135) AND (1 <= p322)) OR ((1 <= p218) AND (1 <= p404) AND (1 <= p543))))) : (A (X (((1 <= p342) AND ((p236 <= 0))))) OR E (F (E (F (((1 <= p386) AND (1 <= p199))))))) : E (F (A (((((1 <= p347)) OR ((1 <= p251))) U (((1 <= p536)) OR ((1 <= p426)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (E (G (((1 <= p54))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EF(EG(((1 <= p54)))))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 450 markings, 480 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p522)))) OR E (G (A (X (((1 <= p14)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p522))))
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 <= p522))))
lola: processed formula length: 21
lola: 18 rewrites
lola: closed formula file CTLFireability.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 <= p522))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 105 markings, 104 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((p87 <= 0) OR (p470 <= 0)))) OR (E (X (((1 <= p433)))) OR E (X (((1 <= p18))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((p87 <= 0) OR (p470 <= 0))) OR (EX(((1 <= p433))) OR EX(((1 <= p18))))))
lola: processed formula length: 81
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2505 markings, 3052 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p93 <= 0) OR (p300 <= 0) OR (p548 <= 0)) AND ((p511 <= 0))) U E (G (((1 <= p110)))))) OR (E (F (A (X (((1 <= p562)))))) OR E (F (A (X (((1 <= p79))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: (A((((p93 <= 0) OR (p300 <= 0) OR (p548 <= 0)) AND ((p511 <= 0))) U EG(((1 <= p110)))) OR (EF(AX(((1 <= p562)))) OR EF(AX(((1 <= p79))))))
lola: processed formula length: 140
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 355 markings, 748 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p342) AND ((p236 <= 0))))) OR E (F (((1 <= p386) AND (1 <= p199)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p386) AND (1 <= p199))))
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 <= p386) AND (1 <= p199))))
lola: processed formula length: 37
lola: 18 rewrites
lola: closed formula file CTLFireability.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 <= p386) AND (1 <= p199))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 367 markings, 441 edges
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p166))))
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 <= p166))))
lola: processed formula length: 21
lola: 18 rewrites
lola: closed formula file CTLFireability.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: sara: try reading problem file CTLFireability-4-0.sara.
formula 0: ((1 <= p166))
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: 145 markings, 144 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p292)) OR ((1 <= p189)))))
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 <= p292)) OR ((1 <= p189)))))
lola: processed formula length: 41
lola: 18 rewrites
lola: closed formula file CTLFireability.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: 28 markings, 27 edges
lola: formula 0: (((1 <= p292)) OR ((1 <= p189)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p297)) OR ((1 <= p135) AND (1 <= p322)) OR ((1 <= p218) AND (1 <= p404) AND (1 <= p543)))))
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 <= p297)) OR ((1 <= p135) AND (1 <= p322)) OR ((1 <= p218) AND (1 <= p404) AND (1 <= p543)))))
lola: processed formula length: 107
lola: 18 rewrites
lola: closed formula file CTLFireability.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 <= p297)) OR ((1 <= p135) AND (1 <= p322)) OR ((1 <= p218) AND (1 <= p404) AND (1 <= p543)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p51 <= 0))
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p51))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 125 markings, 125 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((((1 <= p347)) OR ((1 <= p251))) U (((1 <= p536)) OR ((1 <= p426)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((((1 <= p347)) OR ((1 <= p251))) U (((1 <= p536)) OR ((1 <= p426)))))
lola: processed formula length: 76
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 138 markings, 324 edges
lola: ========================================
lola: subprocess 10 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p33 <= 0) OR (p284 <= 0) OR (p543 <= 0)) U E (G (((1 <= p191) AND (1 <= p370) AND (1 <= p513))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p33) AND (1 <= p284) AND (1 <= p543)) R F (((p191 <= 0) OR (p370 <= 0) OR (p513 <= 0))))
lola: processed formula length: 98
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 8970 markings, 11806 edges
lola: ========================================
lola: subprocess 11 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p141)) OR ((E (F (((p515 <= 0)))) OR (((1 <= p156) AND (1 <= p354) AND (1 <= p543)) OR ((1 <= p26) AND (1 <= p379) AND (1 <= p543)))) AND (A (G (((p232 <= 0) OR (p309 <= 0) OR (p543 <= 0)))) OR A (G (((p224 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p224 <= 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:788
lola: processed formula: A (G (((p224 <= 0))))
lola: processed formula length: 21
lola: 19 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p224))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p141))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p141))
lola: processed formula length: 13
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p515 <= 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 (((p515 <= 0))))
lola: processed formula length: 21
lola: 18 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p515 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p232 <= 0) OR (p309 <= 0) OR (p543 <= 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 (((p232 <= 0) OR (p309 <= 0) OR (p543 <= 0))))
lola: processed formula length: 53
lola: 19 rewrites
lola: closed formula file CTLFireability.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 <= p232) AND (1 <= p309) AND (1 <= p543))
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 CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1188 markings, 1758 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no no yes no yes yes yes
lola:
preliminary result: yes yes yes no yes no no yes no yes yes yes
lola: memory consumption: 38896 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="BusinessProcesses-PT-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-12, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;