About the Execution of ITS-Tools for BusinessProcesses-PT-14
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16246.863 | 3600000.00 | 3566955.00 | 138341.80 | ?T????T???????T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900426.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 156K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1620762620417
Running Version 0
[2021-05-11 19:50:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 19:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:50:22] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-11 19:50:22] [INFO ] Transformed 624 places.
[2021-05-11 19:50:22] [INFO ] Transformed 564 transitions.
[2021-05-11 19:50:22] [INFO ] Found NUPN structural information;
[2021-05-11 19:50:22] [INFO ] Parsed PT model containing 624 places and 564 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Support contains 455 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 597 transition count 542
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 597 transition count 542
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 595 transition count 540
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 595 transition count 540
Applied a total of 37 rules in 54 ms. Remains 595 /616 variables (removed 21) and now considering 540/556 (removed 16) transitions.
// Phase 1: matrix 540 rows 595 cols
[2021-05-11 19:50:22] [INFO ] Computed 94 place invariants in 35 ms
[2021-05-11 19:50:22] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 540 rows 595 cols
[2021-05-11 19:50:22] [INFO ] Computed 94 place invariants in 11 ms
[2021-05-11 19:50:22] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
// Phase 1: matrix 540 rows 595 cols
[2021-05-11 19:50:22] [INFO ] Computed 94 place invariants in 7 ms
[2021-05-11 19:50:23] [INFO ] Dead Transitions using invariants and state equation in 305 ms returned []
Finished structural reductions, in 1 iterations. Remains : 595/616 places, 540/556 transitions.
[2021-05-11 19:50:23] [INFO ] Flatten gal took : 70 ms
[2021-05-11 19:50:23] [INFO ] Flatten gal took : 41 ms
[2021-05-11 19:50:23] [INFO ] Input system was already deterministic with 540 transitions.
Incomplete random walk after 100000 steps, including 688 resets, run finished after 476 ms. (steps per millisecond=210 ) properties (out of 102) seen :85
Running SMT prover for 17 properties.
// Phase 1: matrix 540 rows 595 cols
[2021-05-11 19:50:24] [INFO ] Computed 94 place invariants in 23 ms
[2021-05-11 19:50:24] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-11 19:50:24] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 19:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:50:24] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-11 19:50:24] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 6 ms to minimize.
[2021-05-11 19:50:25] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 1 ms to minimize.
[2021-05-11 19:50:25] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2021-05-11 19:50:25] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 2 ms to minimize.
[2021-05-11 19:50:25] [INFO ] Deduced a trap composed of 116 places in 187 ms of which 1 ms to minimize.
[2021-05-11 19:50:26] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2021-05-11 19:50:26] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2021-05-11 19:50:26] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:50:26] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 1 ms to minimize.
[2021-05-11 19:50:26] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2021-05-11 19:50:27] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 1 ms to minimize.
[2021-05-11 19:50:27] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 0 ms to minimize.
[2021-05-11 19:50:27] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:50:27] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:50:27] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 1 ms to minimize.
[2021-05-11 19:50:28] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:50:28] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:50:28] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:50:28] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:50:28] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:50:29] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 1 ms to minimize.
[2021-05-11 19:50:29] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 1 ms to minimize.
[2021-05-11 19:50:29] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:50:29] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:50:29] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:50:29] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:50:30] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:50:30] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:50:30] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:50:30] [INFO ] Deduced a trap composed of 130 places in 196 ms of which 1 ms to minimize.
[2021-05-11 19:50:31] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:50:31] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:50:31] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:50:31] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:50:31] [INFO ] Deduced a trap composed of 126 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 130 places in 175 ms of which 1 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 2 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:50:32] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:50:33] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:50:33] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:50:33] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:50:33] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:50:33] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:50:33] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:50:34] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:50:34] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:50:34] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 2 ms to minimize.
[2021-05-11 19:50:34] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:50:34] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:50:35] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 1 ms to minimize.
[2021-05-11 19:50:35] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:50:35] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:50:35] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:50:35] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 0 ms to minimize.
[2021-05-11 19:50:36] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:50:36] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:50:36] [INFO ] Deduced a trap composed of 130 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:50:36] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:50:36] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 1 ms to minimize.
[2021-05-11 19:50:37] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:50:37] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:50:37] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2021-05-11 19:50:37] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:50:37] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 12 ms to minimize.
[2021-05-11 19:50:38] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:50:38] [INFO ] Deduced a trap composed of 141 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:50:38] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:50:38] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 0 ms to minimize.
[2021-05-11 19:50:38] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 1 ms to minimize.
[2021-05-11 19:50:39] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 1 ms to minimize.
[2021-05-11 19:50:39] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 1 ms to minimize.
[2021-05-11 19:50:39] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:50:39] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:50:39] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:50:40] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:50:40] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:50:40] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:50:40] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:50:40] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:50:41] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:50:41] [INFO ] Deduced a trap composed of 125 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:50:41] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:50:41] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:50:41] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:50:42] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:50:42] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:50:42] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:50:42] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:50:42] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 0 ms to minimize.
[2021-05-11 19:50:43] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:50:43] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:50:43] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 1 ms to minimize.
[2021-05-11 19:50:43] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 0 ms to minimize.
[2021-05-11 19:50:43] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:50:44] [INFO ] Deduced a trap composed of 128 places in 172 ms of which 0 ms to minimize.
[2021-05-11 19:50:44] [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 close... while checking expression at index 0
[2021-05-11 19:50:44] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-11 19:50:44] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 19:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:50:44] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2021-05-11 19:50:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:50:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-11 19:50:44] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 19:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:50:45] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2021-05-11 19:50:45] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2021-05-11 19:50:45] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:50:45] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:50:45] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 0 ms to minimize.
[2021-05-11 19:50:46] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:50:46] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2021-05-11 19:50:46] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 0 ms to minimize.
[2021-05-11 19:50:46] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 1 ms to minimize.
[2021-05-11 19:50:46] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2021-05-11 19:50:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2747 ms
[2021-05-11 19:50:47] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 41 ms.
[2021-05-11 19:50:50] [INFO ] Added : 351 causal constraints over 71 iterations in 2970 ms. Result :sat
[2021-05-11 19:50:50] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2021-05-11 19:50:50] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 19:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:50:51] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2021-05-11 19:50:51] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:50:51] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2021-05-11 19:50:51] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:50:51] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:50:52] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:50:52] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:50:52] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:50:52] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:50:52] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:50:53] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 1 ms to minimize.
[2021-05-11 19:50:53] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:50:53] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 0 ms to minimize.
[2021-05-11 19:50:53] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:50:53] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:50:53] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:50:54] [INFO ] Deduced a trap composed of 147 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:50:54] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:50:54] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:50:54] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:50:54] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:50:54] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2021-05-11 19:50:55] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:50:55] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:50:55] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:50:55] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 0 ms to minimize.
[2021-05-11 19:50:55] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 10 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:50:56] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 141 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 136 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 133 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:50:57] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 140 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:50:58] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:50:59] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 141 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 138 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:51:00] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 122 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 142 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:51:01] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:51:02] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 142 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 150 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 130 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:51:03] [INFO ] Deduced a trap composed of 131 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 127 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 137 places in 89 ms of which 1 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 128 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:51:04] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 129 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 129 places in 89 ms of which 1 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 139 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 133 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 128 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:51:05] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 129 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:51:06] [INFO ] Deduced a trap composed of 130 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 130 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 133 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:51:07] [INFO ] Deduced a trap composed of 139 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:51:08] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:51:08] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 1 ms to minimize.
[2021-05-11 19:51:08] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:51:08] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:51:08] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:51:08] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:51:09] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 1 ms to minimize.
[2021-05-11 19:51:09] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:51:09] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:51:09] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:51:09] [INFO ] Deduced a trap composed of 134 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:51:09] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 11 ms to minimize.
[2021-05-11 19:51:10] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:51:10] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:51:10] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:51:10] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:51:10] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:51:10] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2021-05-11 19:51:10] [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 close... while checking expression at index 2
[2021-05-11 19:51:11] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2021-05-11 19:51:11] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 19:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:51:11] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-11 19:51:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:51:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-11 19:51:11] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 19:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:51:11] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-11 19:51:11] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2021-05-11 19:51:12] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2021-05-11 19:51:12] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:51:12] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:51:12] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:51:12] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:51:12] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 3 ms to minimize.
[2021-05-11 19:51:13] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:51:13] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:51:13] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 0 ms to minimize.
[2021-05-11 19:51:13] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:51:13] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 0 ms to minimize.
[2021-05-11 19:51:13] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:51:14] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:51:15] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 1 ms to minimize.
[2021-05-11 19:51:15] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2021-05-11 19:51:15] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:51:15] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:51:15] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:51:15] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:51:16] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2021-05-11 19:51:16] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2021-05-11 19:51:16] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-11 19:51:16] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4641 ms
[2021-05-11 19:51:16] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 62 ms.
[2021-05-11 19:51:19] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:51:19] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:51:19] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:51:20] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:51:20] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:51:20] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:51:20] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 1 ms to minimize.
[2021-05-11 19:51:20] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 1 ms to minimize.
[2021-05-11 19:51:21] [INFO ] Deduced a trap composed of 147 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:51:21] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:51:21] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:51:21] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:51:21] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:51:22] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:51:22] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 0 ms to minimize.
[2021-05-11 19:51:22] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:51:22] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:51:23] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:51:23] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:51:23] [INFO ] Deduced a trap composed of 150 places in 189 ms of which 1 ms to minimize.
[2021-05-11 19:51:23] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 1 ms to minimize.
[2021-05-11 19:51:23] [INFO ] Deduced a trap composed of 153 places in 172 ms of which 1 ms to minimize.
[2021-05-11 19:51:24] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 0 ms to minimize.
[2021-05-11 19:51:24] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:51:24] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:51:24] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:51:25] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 0 ms to minimize.
[2021-05-11 19:51:25] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:51:25] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:51:25] [INFO ] Deduced a trap composed of 151 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:51:26] [INFO ] Deduced a trap composed of 152 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:51:26] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:51:26] [INFO ] Deduced a trap composed of 142 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:51:26] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 1 ms to minimize.
[2021-05-11 19:51:26] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 1 ms to minimize.
[2021-05-11 19:51:27] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:51:27] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 1 ms to minimize.
[2021-05-11 19:51:27] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:51:27] [INFO ] Deduced a trap composed of 151 places in 119 ms of which 1 ms to minimize.
[2021-05-11 19:51:28] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 0 ms to minimize.
[2021-05-11 19:51:28] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:51:28] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:51:28] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:51:28] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:51:29] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:51:29] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:51:29] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 0 ms to minimize.
[2021-05-11 19:51:30] [INFO ] Deduced a trap composed of 144 places in 223 ms of which 0 ms to minimize.
[2021-05-11 19:51:30] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 1 ms to minimize.
[2021-05-11 19:51:30] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:51:31] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:51:31] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 11853 ms
[2021-05-11 19:51:31] [INFO ] Added : 364 causal constraints over 74 iterations in 15039 ms. Result :sat
[2021-05-11 19:51:31] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2021-05-11 19:51:31] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-11 19:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:51:31] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-11 19:51:31] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 1 ms to minimize.
[2021-05-11 19:51:32] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 0 ms to minimize.
[2021-05-11 19:51:32] [INFO ] Deduced a trap composed of 124 places in 205 ms of which 1 ms to minimize.
[2021-05-11 19:51:32] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2021-05-11 19:51:32] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 1 ms to minimize.
[2021-05-11 19:51:33] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:51:33] [INFO ] Deduced a trap composed of 131 places in 211 ms of which 0 ms to minimize.
[2021-05-11 19:51:33] [INFO ] Deduced a trap composed of 143 places in 160 ms of which 1 ms to minimize.
[2021-05-11 19:51:33] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:51:33] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2021-05-11 19:51:34] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2021-05-11 19:51:35] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:51:35] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2021-05-11 19:51:35] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3520 ms
[2021-05-11 19:51:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:51:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-11 19:51:35] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-11 19:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:51:35] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-11 19:51:35] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 0 ms to minimize.
[2021-05-11 19:51:35] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2021-05-11 19:51:36] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:51:36] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:51:36] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:51:36] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 1 ms to minimize.
[2021-05-11 19:51:37] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 1 ms to minimize.
[2021-05-11 19:51:37] [INFO ] Deduced a trap composed of 140 places in 193 ms of which 0 ms to minimize.
[2021-05-11 19:51:37] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 1 ms to minimize.
[2021-05-11 19:51:37] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:51:38] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 0 ms to minimize.
[2021-05-11 19:51:38] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:51:38] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:51:38] [INFO ] Deduced a trap composed of 143 places in 245 ms of which 1 ms to minimize.
[2021-05-11 19:51:38] [INFO ] Deduced a trap composed of 145 places in 189 ms of which 0 ms to minimize.
[2021-05-11 19:51:39] [INFO ] Deduced a trap composed of 142 places in 184 ms of which 0 ms to minimize.
[2021-05-11 19:51:39] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:51:39] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 1 ms to minimize.
[2021-05-11 19:51:39] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:51:39] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 1 ms to minimize.
[2021-05-11 19:51:40] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:51:40] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:51:40] [INFO ] Deduced a trap composed of 142 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:51:40] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:51:40] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 1 ms to minimize.
[2021-05-11 19:51:41] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 1 ms to minimize.
[2021-05-11 19:51:41] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:51:41] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 0 ms to minimize.
[2021-05-11 19:51:41] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 1 ms to minimize.
[2021-05-11 19:51:41] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 1 ms to minimize.
[2021-05-11 19:51:42] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 0 ms to minimize.
[2021-05-11 19:51:42] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:51:42] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2021-05-11 19:51:42] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:51:42] [INFO ] Deduced a trap composed of 141 places in 233 ms of which 1 ms to minimize.
[2021-05-11 19:51:43] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 0 ms to minimize.
[2021-05-11 19:51:43] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:51:43] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:51:43] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 1 ms to minimize.
[2021-05-11 19:51:43] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2021-05-11 19:51:44] [INFO ] Deduced a trap composed of 148 places in 178 ms of which 0 ms to minimize.
[2021-05-11 19:51:44] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:51:44] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:51:44] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:51:44] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:51:44] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:51:45] [INFO ] Deduced a trap composed of 149 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:51:45] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 1 ms to minimize.
[2021-05-11 19:51:45] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:51:45] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 0 ms to minimize.
[2021-05-11 19:51:45] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 1 ms to minimize.
[2021-05-11 19:51:45] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:51:46] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:51:46] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:51:46] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 1 ms to minimize.
[2021-05-11 19:51:46] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:51:46] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:51:47] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:51:47] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:51:47] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:51:47] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:51:47] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:51:48] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:51:48] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:51:48] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:51:48] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2021-05-11 19:51:48] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:51:48] [INFO ] Deduced a trap composed of 157 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:51:49] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:51:49] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:51:49] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:51:49] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:51:49] [INFO ] Deduced a trap composed of 146 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:51:49] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:51:50] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 1 ms to minimize.
[2021-05-11 19:51:50] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:51:50] [INFO ] Deduced a trap composed of 140 places in 176 ms of which 0 ms to minimize.
[2021-05-11 19:51:50] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:51:50] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 1 ms to minimize.
[2021-05-11 19:51:50] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:51:51] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 0 ms to minimize.
[2021-05-11 19:51:51] [INFO ] Deduced a trap composed of 152 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:51:51] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:51:51] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:51:51] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:51:52] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:51:52] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:51:52] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:51:52] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:51:52] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 17516 ms
[2021-05-11 19:51:53] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 59 ms.
[2021-05-11 19:51:55] [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 close... while checking expression at index 4
[2021-05-11 19:51:55] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-11 19:51:55] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 19:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:51:55] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-11 19:51:55] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2021-05-11 19:51:55] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2021-05-11 19:51:56] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2021-05-11 19:51:56] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:51:56] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 3 ms to minimize.
[2021-05-11 19:51:56] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:51:56] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:51:56] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:51:57] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2743 ms
[2021-05-11 19:51:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:51:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 19:51:58] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-11 19:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:51:58] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:51:58] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:51:59] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:52:00] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2448 ms
[2021-05-11 19:52:01] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 22 ms.
[2021-05-11 19:52:02] [INFO ] Added : 371 causal constraints over 75 iterations in 1950 ms. Result :sat
[2021-05-11 19:52:03] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-11 19:52:03] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-11 19:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:03] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-11 19:52:03] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:52:03] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:52:03] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:52:03] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:52:04] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:52:04] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:52:04] [INFO ] Deduced a trap composed of 148 places in 272 ms of which 1 ms to minimize.
[2021-05-11 19:52:04] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:52:04] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:52:05] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:52:05] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:52:05] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:52:05] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 1 ms to minimize.
[2021-05-11 19:52:05] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:52:06] [INFO ] Deduced a trap composed of 143 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:52:06] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:52:06] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:52:06] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2021-05-11 19:52:06] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:52:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2021-05-11 19:52:07] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2021-05-11 19:52:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3788 ms
[2021-05-11 19:52:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:52:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 26 ms returned sat
[2021-05-11 19:52:07] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 19:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:07] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-11 19:52:07] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2021-05-11 19:52:07] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2021-05-11 19:52:08] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:52:08] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:52:08] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:52:08] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2021-05-11 19:52:08] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:52:08] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2021-05-11 19:52:09] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:52:09] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2021-05-11 19:52:09] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:52:09] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:52:09] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:52:09] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:10] [INFO ] Deduced a trap composed of 139 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:11] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 0 ms to minimize.
[2021-05-11 19:52:11] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 0 ms to minimize.
[2021-05-11 19:52:11] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:52:11] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:52:11] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:52:12] [INFO ] Deduced a trap composed of 126 places in 192 ms of which 1 ms to minimize.
[2021-05-11 19:52:12] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:52:12] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:52:12] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:52:12] [INFO ] Deduced a trap composed of 146 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:52:12] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5321 ms
[2021-05-11 19:52:12] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 36 ms.
[2021-05-11 19:52:14] [INFO ] Deduced a trap composed of 155 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:52:15] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:52:15] [INFO ] Deduced a trap composed of 152 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:52:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 397 ms
[2021-05-11 19:52:15] [INFO ] Added : 365 causal constraints over 74 iterations in 2445 ms. Result :sat
[2021-05-11 19:52:15] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 19:52:15] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-11 19:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:15] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-11 19:52:15] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:52:15] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:15] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:52:16] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:52:17] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:52:18] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:52:18] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:18] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:52:18] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:52:18] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:52:18] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 146 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 124 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 147 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:52:19] [INFO ] Deduced a trap composed of 144 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 142 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 152 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:52:20] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 141 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 134 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 142 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 139 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 141 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:52:21] [INFO ] Deduced a trap composed of 127 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 144 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 141 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 133 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 125 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:52:22] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:52:23] [INFO ] Deduced a trap composed of 134 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:52:23] [INFO ] Deduced a trap composed of 147 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:52:23] [INFO ] Deduced a trap composed of 137 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:52:23] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:52:23] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:52:23] [INFO ] Deduced a trap composed of 146 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 0 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 1 ms to minimize.
[2021-05-11 19:52:24] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:52:25] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:52:25] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:52:25] [INFO ] Deduced a trap composed of 146 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:52:25] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:52:25] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:52:25] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2021-05-11 19:52:26] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:52:26] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:52:26] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:52:26] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:52:26] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 11041 ms
[2021-05-11 19:52:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:52:26] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-11 19:52:26] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-11 19:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:26] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-11 19:52:26] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:52:27] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2021-05-11 19:52:27] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:52:27] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:52:27] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:52:27] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2021-05-11 19:52:28] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
[2021-05-11 19:52:28] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 1 ms to minimize.
[2021-05-11 19:52:28] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:52:28] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:52:29] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:52:29] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2021-05-11 19:52:29] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2021-05-11 19:52:29] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:52:29] [INFO ] Deduced a trap composed of 142 places in 198 ms of which 0 ms to minimize.
[2021-05-11 19:52:30] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2021-05-11 19:52:30] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2021-05-11 19:52:30] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:52:30] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2021-05-11 19:52:30] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:52:31] [INFO ] Deduced a trap composed of 155 places in 142 ms of which 2 ms to minimize.
[2021-05-11 19:52:31] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2021-05-11 19:52:31] [INFO ] Deduced a trap composed of 143 places in 228 ms of which 1 ms to minimize.
[2021-05-11 19:52:31] [INFO ] Deduced a trap composed of 151 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:52:32] [INFO ] Deduced a trap composed of 134 places in 181 ms of which 0 ms to minimize.
[2021-05-11 19:52:32] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 1 ms to minimize.
[2021-05-11 19:52:32] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:52:32] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:52:32] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:52:32] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:52:33] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:52:33] [INFO ] Deduced a trap composed of 148 places in 149 ms of which 0 ms to minimize.
[2021-05-11 19:52:33] [INFO ] Deduced a trap composed of 133 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:52:33] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:52:33] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:52:34] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:52:34] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:52:34] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:52:34] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:52:34] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:52:34] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 1 ms to minimize.
[2021-05-11 19:52:35] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:52:35] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:52:35] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:52:35] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:52:35] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:52:35] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:52:36] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:52:36] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:52:36] [INFO ] Deduced a trap composed of 147 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:52:36] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:52:36] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:52:36] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 0 ms to minimize.
[2021-05-11 19:52:37] [INFO ] Deduced a trap composed of 148 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:52:37] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 0 ms to minimize.
[2021-05-11 19:52:37] [INFO ] Deduced a trap composed of 155 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:52:37] [INFO ] Deduced a trap composed of 130 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:52:37] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:52:37] [INFO ] Deduced a trap composed of 139 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:52:38] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:52:38] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:52:38] [INFO ] Deduced a trap composed of 150 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:52:38] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:52:38] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 0 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 134 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:52:39] [INFO ] Deduced a trap composed of 147 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:52:40] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:52:40] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:52:40] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:52:40] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 1 ms to minimize.
[2021-05-11 19:52:40] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:52:41] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:52:41] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:52:41] [INFO ] Trap strengthening (SAT) tested/added 79/78 trap constraints in 14432 ms
[2021-05-11 19:52:41] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 51 ms.
[2021-05-11 19:52:44] [INFO ] Added : 360 causal constraints over 73 iterations in 3055 ms. Result :sat
[2021-05-11 19:52:44] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-11 19:52:44] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 19:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:44] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-11 19:52:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:52:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-11 19:52:44] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 19:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:45] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2021-05-11 19:52:45] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:52:45] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:52:45] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:52:45] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:52:45] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:52:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1716 ms
[2021-05-11 19:52:46] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 33 ms.
[2021-05-11 19:52:49] [INFO ] Added : 351 causal constraints over 71 iterations in 3000 ms. Result :sat
[2021-05-11 19:52:49] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-11 19:52:49] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 19:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:50] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2021-05-11 19:52:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:52:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-11 19:52:50] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 19:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:52:50] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2021-05-11 19:52:51] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:52:51] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:52:51] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:52:51] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:52:51] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:52:51] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:52:52] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:52:53] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 134 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:52:54] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 133 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 152 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:52:55] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 130 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 139 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:52:56] [INFO ] Deduced a trap composed of 141 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 145 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 140 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:52:57] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 151 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:52:58] [INFO ] Deduced a trap composed of 146 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 142 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:52:59] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:53:00] [INFO ] Deduced a trap composed of 139 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:53:00] [INFO ] Deduced a trap composed of 142 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:53:00] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:53:00] [INFO ] Deduced a trap composed of 131 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:53:00] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 9535 ms
[2021-05-11 19:53:00] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 27 ms.
[2021-05-11 19:53:02] [INFO ] Added : 375 causal constraints over 75 iterations in 2336 ms. Result :sat
[2021-05-11 19:53:02] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-11 19:53:02] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 19:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:03] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-11 19:53:03] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:53:03] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:53:03] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:53:03] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2021-05-11 19:53:03] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 0 ms to minimize.
[2021-05-11 19:53:04] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:53:04] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:53:04] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 0 ms to minimize.
[2021-05-11 19:53:04] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:53:04] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 9 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:53:05] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2021-05-11 19:53:06] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-11 19:53:06] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:53:06] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2021-05-11 19:53:06] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2021-05-11 19:53:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3188 ms
[2021-05-11 19:53:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:53:06] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 19:53:06] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-11 19:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:06] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-11 19:53:06] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2021-05-11 19:53:07] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 0 ms to minimize.
[2021-05-11 19:53:07] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2021-05-11 19:53:07] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2021-05-11 19:53:07] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 1 ms to minimize.
[2021-05-11 19:53:07] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2021-05-11 19:53:07] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:53:08] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 1 ms to minimize.
[2021-05-11 19:53:08] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:53:08] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:53:08] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:53:08] [INFO ] Deduced a trap composed of 134 places in 194 ms of which 1 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 1 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:53:09] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2021-05-11 19:53:10] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:53:10] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2021-05-11 19:53:10] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2021-05-11 19:53:10] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3647 ms
[2021-05-11 19:53:10] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 28 ms.
[2021-05-11 19:53:11] [INFO ] Added : 310 causal constraints over 62 iterations in 1474 ms. Result :sat
[2021-05-11 19:53:11] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 19:53:11] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-11 19:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:12] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2021-05-11 19:53:12] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2021-05-11 19:53:12] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:53:12] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2021-05-11 19:53:12] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:53:12] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 132 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 130 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:53:13] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:53:14] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 0 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 111 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 103 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:53:15] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:53:16] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:53:17] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 111 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:53:18] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:53:19] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:53:19] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:53:19] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 7112 ms
[2021-05-11 19:53:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:53:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-11 19:53:19] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 19:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:19] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-11 19:53:19] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:53:20] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 0 ms to minimize.
[2021-05-11 19:53:20] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2021-05-11 19:53:20] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
[2021-05-11 19:53:20] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:53:20] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2021-05-11 19:53:20] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:53:21] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:53:21] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:53:21] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2021-05-11 19:53:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1662 ms
[2021-05-11 19:53:21] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 22 ms.
[2021-05-11 19:53:23] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:53:23] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 0 ms to minimize.
[2021-05-11 19:53:23] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:53:23] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:53:23] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 0 ms to minimize.
[2021-05-11 19:53:24] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:53:24] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:53:24] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2021-05-11 19:53:24] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:53:25] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 11 ms to minimize.
[2021-05-11 19:53:25] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 1 ms to minimize.
[2021-05-11 19:53:25] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:53:25] [INFO ] Deduced a trap composed of 156 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:53:25] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 0 ms to minimize.
[2021-05-11 19:53:26] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 0 ms to minimize.
[2021-05-11 19:53:26] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:53:26] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:53:26] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 1 ms to minimize.
[2021-05-11 19:53:27] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:53:27] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:53:27] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 0 ms to minimize.
[2021-05-11 19:53:27] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 0 ms to minimize.
[2021-05-11 19:53:28] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 1 ms to minimize.
[2021-05-11 19:53:28] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:53:28] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:53:28] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 1 ms to minimize.
[2021-05-11 19:53:28] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:53:29] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:53:29] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:53:29] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:53:30] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:53:30] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:53:30] [INFO ] Deduced a trap composed of 143 places in 170 ms of which 0 ms to minimize.
[2021-05-11 19:53:30] [INFO ] Deduced a trap composed of 130 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:53:31] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:53:31] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:53:31] [INFO ] Deduced a trap composed of 147 places in 161 ms of which 0 ms to minimize.
[2021-05-11 19:53:31] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 1 ms to minimize.
[2021-05-11 19:53:32] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 0 ms to minimize.
[2021-05-11 19:53:32] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:53:32] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:53:32] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 0 ms to minimize.
[2021-05-11 19:53:33] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:53:33] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:53:33] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:53:33] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:53:34] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 0 ms to minimize.
[2021-05-11 19:53:34] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:53:34] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 0 ms to minimize.
[2021-05-11 19:53:34] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 1 ms to minimize.
[2021-05-11 19:53:35] [INFO ] Deduced a trap composed of 151 places in 239 ms of which 1 ms to minimize.
[2021-05-11 19:53:35] [INFO ] Deduced a trap composed of 143 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:53:35] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:53:36] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2021-05-11 19:53:36] [INFO ] Deduced a trap composed of 150 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:53:36] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:53:36] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:53:37] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 14003 ms
[2021-05-11 19:53:37] [INFO ] Added : 361 causal constraints over 73 iterations in 15979 ms. Result :sat
[2021-05-11 19:53:37] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-11 19:53:37] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 19:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:37] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-11 19:53:37] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:53:37] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:53:37] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2021-05-11 19:53:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-11 19:53:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1948 ms
[2021-05-11 19:53:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:53:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-11 19:53:39] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 19:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:39] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:53:40] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:53:41] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:53:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2173 ms
[2021-05-11 19:53:42] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 21 ms.
[2021-05-11 19:53:43] [INFO ] Added : 341 causal constraints over 69 iterations in 1613 ms. Result :sat
[2021-05-11 19:53:43] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-11 19:53:43] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 19:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:44] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2021-05-11 19:53:44] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2021-05-11 19:53:45] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2021-05-11 19:53:45] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:53:45] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:53:45] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:53:45] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2021-05-11 19:53:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1524 ms
[2021-05-11 19:53:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:53:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 27 ms returned sat
[2021-05-11 19:53:45] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 19:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:46] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2021-05-11 19:53:46] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2021-05-11 19:53:46] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2021-05-11 19:53:46] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:53:46] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:53:46] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:53:46] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:53:47] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1930 ms
[2021-05-11 19:53:47] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 21 ms.
[2021-05-11 19:53:49] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2021-05-11 19:53:49] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2021-05-11 19:53:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2021-05-11 19:53:49] [INFO ] Added : 266 causal constraints over 54 iterations in 1441 ms. Result :sat
[2021-05-11 19:53:49] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-11 19:53:49] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 19:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:49] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-11 19:53:49] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:53:50] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:53:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1293 ms
[2021-05-11 19:53:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:53:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-11 19:53:51] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 19:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:51] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-11 19:53:51] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:53:51] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:53:51] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:53:51] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:53:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1488 ms
[2021-05-11 19:53:52] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 47 ms.
[2021-05-11 19:53:54] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2021-05-11 19:53:54] [INFO ] Added : 247 causal constraints over 50 iterations in 1929 ms. Result :sat
[2021-05-11 19:53:54] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-11 19:53:54] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 19:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:53:55] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-11 19:53:55] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2021-05-11 19:53:55] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:53:55] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:53:55] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2021-05-11 19:53:55] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:53:56] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:53:56] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:53:56] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:53:56] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:53:56] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:53:56] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:53:57] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2021-05-11 19:53:57] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:53:57] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:53:57] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:53:57] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:53:58] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 1 ms to minimize.
[2021-05-11 19:53:58] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:53:58] [INFO ] Deduced a trap composed of 145 places in 184 ms of which 1 ms to minimize.
[2021-05-11 19:53:58] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 0 ms to minimize.
[2021-05-11 19:53:58] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:53:59] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2021-05-11 19:53:59] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2021-05-11 19:53:59] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2021-05-11 19:53:59] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 0 ms to minimize.
[2021-05-11 19:53:59] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 0 ms to minimize.
[2021-05-11 19:54:00] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:54:00] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 1 ms to minimize.
[2021-05-11 19:54:00] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 1 ms to minimize.
[2021-05-11 19:54:00] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 1 ms to minimize.
[2021-05-11 19:54:00] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:54:01] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:54:01] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:54:01] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:54:01] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 0 ms to minimize.
[2021-05-11 19:54:01] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:54:02] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:54:02] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 0 ms to minimize.
[2021-05-11 19:54:02] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:54:02] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 1 ms to minimize.
[2021-05-11 19:54:02] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:54:02] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 1 ms to minimize.
[2021-05-11 19:54:03] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:54:03] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:54:03] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 0 ms to minimize.
[2021-05-11 19:54:03] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:54:03] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:54:04] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:54:04] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:54:04] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:54:04] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:54:04] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 2 ms to minimize.
[2021-05-11 19:54:04] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 146 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 141 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:54:05] [INFO ] Deduced a trap composed of 141 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:54:06] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:54:06] [INFO ] Deduced a trap composed of 143 places in 172 ms of which 1 ms to minimize.
[2021-05-11 19:54:06] [INFO ] Deduced a trap composed of 155 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:54:06] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:54:06] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:54:06] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:54:07] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:54:07] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:54:07] [INFO ] Deduced a trap composed of 130 places in 177 ms of which 0 ms to minimize.
[2021-05-11 19:54:07] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:54:07] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:54:07] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:54:08] [INFO ] Deduced a trap composed of 161 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:54:08] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:54:08] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:54:08] [INFO ] Deduced a trap composed of 159 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:54:08] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 1 ms to minimize.
[2021-05-11 19:54:08] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:54:09] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:54:09] [INFO ] Deduced a trap composed of 150 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:54:09] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:54:09] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:54:09] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 0 ms to minimize.
[2021-05-11 19:54:09] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:54:10] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:54:10] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:54:10] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:54:10] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2021-05-11 19:54:10] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 1 ms to minimize.
[2021-05-11 19:54:11] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:54:11] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:54:11] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:54:11] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:54:11] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:54:11] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2021-05-11 19:54:12] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 0 ms to minimize.
[2021-05-11 19:54:12] [INFO ] Deduced a trap composed of 138 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:54:12] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:54:12] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:54:12] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 0 ms to minimize.
[2021-05-11 19:54:13] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:54:13] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2021-05-11 19:54:13] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:54:13] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 0 ms to minimize.
[2021-05-11 19:54:13] [INFO ] Deduced a trap composed of 143 places in 165 ms of which 1 ms to minimize.
[2021-05-11 19:54:14] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 1 ms to minimize.
[2021-05-11 19:54:14] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 1 ms to minimize.
[2021-05-11 19:54:14] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 1 ms to minimize.
[2021-05-11 19:54:14] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:54:14] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 1 ms to minimize.
[2021-05-11 19:54:14] [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 close... while checking expression at index 15
[2021-05-11 19:54:15] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-11 19:54:15] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 19:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:54:15] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2021-05-11 19:54:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:54:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-11 19:54:15] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 19:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:54:16] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2021-05-11 19:54:16] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:54:16] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:54:16] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:54:16] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:54:16] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:54:16] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:54:17] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:54:17] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:54:17] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2021-05-11 19:54:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1221 ms
[2021-05-11 19:54:17] [INFO ] Computed and/alt/rep : 506/852/506 causal constraints (skipped 33 transitions) in 42 ms.
[2021-05-11 19:54:19] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 0 ms to minimize.
[2021-05-11 19:54:20] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:54:20] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:54:20] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:54:20] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:54:20] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 1 ms to minimize.
[2021-05-11 19:54:21] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:54:21] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:54:21] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:54:21] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:54:22] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 0 ms to minimize.
[2021-05-11 19:54:22] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:54:22] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 0 ms to minimize.
[2021-05-11 19:54:22] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:54:22] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:54:23] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:54:23] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 0 ms to minimize.
[2021-05-11 19:54:23] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:54:23] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:54:23] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 0 ms to minimize.
[2021-05-11 19:54:24] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:54:24] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:54:24] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 0 ms to minimize.
[2021-05-11 19:54:24] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 0 ms to minimize.
[2021-05-11 19:54:24] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:54:25] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:54:25] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:54:25] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:54:25] [INFO ] Deduced a trap composed of 138 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:54:26] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:54:26] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 1 ms to minimize.
[2021-05-11 19:54:26] [INFO ] Deduced a trap composed of 136 places in 254 ms of which 1 ms to minimize.
[2021-05-11 19:54:26] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:54:27] [INFO ] Deduced a trap composed of 151 places in 259 ms of which 1 ms to minimize.
[2021-05-11 19:54:27] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 0 ms to minimize.
[2021-05-11 19:54:27] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:54:28] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:54:28] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:54:28] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 1 ms to minimize.
[2021-05-11 19:54:28] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 0 ms to minimize.
[2021-05-11 19:54:29] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:54:29] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:54:29] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 1 ms to minimize.
[2021-05-11 19:54:29] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:54:30] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:54:30] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:54:30] [INFO ] Deduced a trap composed of 149 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:54:30] [INFO ] Deduced a trap composed of 137 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:54:31] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:54:31] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:54:31] [INFO ] Deduced a trap composed of 149 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:54:31] [INFO ] Deduced a trap composed of 151 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:54:31] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:54:31] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:54:32] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:54:32] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:54:32] [INFO ] Deduced a trap composed of 145 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:54:32] [INFO ] Deduced a trap composed of 144 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:54:32] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:54:33] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:54:33] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:54:33] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 0 ms to minimize.
[2021-05-11 19:54:33] [INFO ] Deduced a trap composed of 137 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:54:33] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:54:34] [INFO ] Deduced a trap composed of 129 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:54:34] [INFO ] Deduced a trap composed of 132 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:54:34] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:54:34] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 0 ms to minimize.
[2021-05-11 19:54:34] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:54:35] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:54:35] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:54:35] [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 close... while checking expression at index 16
Graph (trivial) has 315 edges and 595 vertex of which 7 / 595 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 588 transition count 424
Reduce places removed 108 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 113 rules applied. Total rules applied 222 place count 480 transition count 419
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 227 place count 475 transition count 419
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 227 place count 475 transition count 328
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 424 place count 369 transition count 328
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 496 place count 297 transition count 256
Iterating global reduction 3 with 72 rules applied. Total rules applied 568 place count 297 transition count 256
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 568 place count 297 transition count 250
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 582 place count 289 transition count 250
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 760 place count 199 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 764 place count 197 transition count 165
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 770 place count 197 transition count 165
Applied a total of 770 rules in 150 ms. Remains 197 /595 variables (removed 398) and now considering 165/540 (removed 375) transitions.
[2021-05-11 19:54:35] [INFO ] Flatten gal took : 37 ms
[2021-05-11 19:54:35] [INFO ] Flatten gal took : 31 ms
[2021-05-11 19:54:35] [INFO ] Input system was already deterministic with 165 transitions.
[2021-05-11 19:54:35] [INFO ] Flatten gal took : 24 ms
[2021-05-11 19:54:35] [INFO ] Flatten gal took : 20 ms
[2021-05-11 19:54:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12766324345695630248.gal : 26 ms
[2021-05-11 19:54:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3732976551225717108.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12766324345695630248.gal, -t, CGAL, -ctl, /tmp/CTLFireability3732976551225717108.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12766324345695630248.gal -t CGAL -ctl /tmp/CTLFireability3732976551225717108.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.54981e+06,0.696871,25496,2,21140,5,67516,6,0,952,62878,0
Converting to forward existential form...Done !
original formula: EF(((E(AG((((((((((p617==1)||(((p47==1)&&(p327==1))&&(p477==1)))||(p304==1))||(p54==1))||(((p195==1)&&(p407==1))&&(p606==1)))||(p328==1))||(p260==1))||(p447==1))||(p564==1))) U (((((p210==1)&&(p417==1))&&(p568==1))||(p548==1))||(p516==1))) * ((p547==1)||(p303==1))) * ((((p498==1)||(p558==1))||(p223==1))||(p395==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((((p498==1)||(p558==1))||(p223==1))||(p395==1))) * ((p547==1)||(p303==1))),!(E(TRUE U !((((((((((p617==1)||(((p47==1)&&(p327==1))&&(p477==1)))||(p304==1))||(p54==1))||(((p195==1)&&(p407==1))&&(p606==1)))||(p328==1))||(p260==1))||(p447==1))||(p564==1)))))) * (((((p210==1)&&(p417==1))&&(p568==1))||(p548==1))||(p516==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t10, t12, t13, t20, t58, t59, t61, t62, t64, t65, t66, t67, t69, t70, t71, t72, t73, t79, t80, t81, t82, t109, t111, t117, t118, t129, t135, t145, t146, t153, t154, t155, t156, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/94/35/165
(forward)formula 0,1,13.7893,393180,1,0,260,1.42916e+06,322,123,7218,852070,317
FORMULA BusinessProcesses-PT-14-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 594 transition count 453
Reduce places removed 86 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 90 rules applied. Total rules applied 176 place count 508 transition count 449
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 180 place count 504 transition count 449
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 180 place count 504 transition count 327
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 441 place count 365 transition count 327
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 520 place count 286 transition count 248
Iterating global reduction 3 with 79 rules applied. Total rules applied 599 place count 286 transition count 248
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 599 place count 286 transition count 238
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 622 place count 273 transition count 238
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 800 place count 184 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 801 place count 184 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 183 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 803 place count 182 transition count 147
Applied a total of 803 rules in 94 ms. Remains 182 /595 variables (removed 413) and now considering 147/540 (removed 393) transitions.
[2021-05-11 19:54:50] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:54:50] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:54:50] [INFO ] Input system was already deterministic with 147 transitions.
[2021-05-11 19:54:50] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:54:50] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:54:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5015145699045858149.gal : 34 ms
[2021-05-11 19:54:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2657440557617684931.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5015145699045858149.gal, -t, CGAL, -ctl, /tmp/CTLFireability2657440557617684931.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5015145699045858149.gal -t CGAL -ctl /tmp/CTLFireability2657440557617684931.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,666652,0.539962,24388,2,8970,5,62918,6,0,875,68183,0
Converting to forward existential form...Done !
original formula: EG((((((((((EF(((((p126==1)&&(p397==1))&&(p593==1))||(p142==1))) + (p309==1)) + (p261==1)) + (p374==1)) + (p38==1)) + (p611==1)) + (p508==1)) + (p142==1)) + (p15==1)) + (((p102==1)&&(p366==1))&&(p589==1))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((E(TRUE U ((((p126==1)&&(p397==1))&&(p593==1))||(p142==1))) + (p309==1)) + (p261==1)) + (p374==1)) + (p38==1)) + (p611==1)) + (p508==1)) + (p142==1)) + (p15==1)) + (((p102==1)&&(p366==1))&&(p589==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t8, t23, t31, t34, t36, t37, t39, t40, t41, t42, t43, t49, t50, t51, t52, t53, t87, t92, t94, t107, t115, t117, t119, t120, t124, t136, t137, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/82/29/147
(forward)formula 0,1,25.3355,756036,1,0,494,3.13144e+06,294,355,6641,4.43427e+06,536
FORMULA BusinessProcesses-PT-14-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 331 edges and 595 vertex of which 7 / 595 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 588 transition count 416
Reduce places removed 116 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 122 rules applied. Total rules applied 239 place count 472 transition count 410
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 245 place count 466 transition count 410
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 245 place count 466 transition count 320
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 440 place count 361 transition count 320
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 516 place count 285 transition count 244
Iterating global reduction 3 with 76 rules applied. Total rules applied 592 place count 285 transition count 244
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 592 place count 285 transition count 237
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 608 place count 276 transition count 237
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 794 place count 182 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 798 place count 180 transition count 148
Applied a total of 798 rules in 100 ms. Remains 180 /595 variables (removed 415) and now considering 148/540 (removed 392) transitions.
[2021-05-11 19:55:15] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:55:15] [INFO ] Flatten gal took : 23 ms
[2021-05-11 19:55:15] [INFO ] Input system was already deterministic with 148 transitions.
[2021-05-11 19:55:15] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:55:15] [INFO ] Flatten gal took : 18 ms
[2021-05-11 19:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8751386763733668312.gal : 18 ms
[2021-05-11 19:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4971275653089898514.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8751386763733668312.gal, -t, CGAL, -ctl, /tmp/CTLFireability4971275653089898514.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8751386763733668312.gal -t CGAL -ctl /tmp/CTLFireability4971275653089898514.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,109175,0.289262,12760,2,6338,5,23336,6,0,867,23566,0
Converting to forward existential form...Done !
original formula: EF((((((((((p81==1)||(p584==1))||(p230==1))||(p323==1))||(p479==1))||(p414==1)) + EF(((p545==1)||(((p186==1)&&(p407==1))&&(p562==1))))) + ((p183==1)&&(p569==1))) + (((p186==1)&&(p407==1))&&(p562==1))))
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * ((((((p81==1)||(p584==1))||(p230==1))||(p323==1))||(p479==1))||(p414==1)))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * ((p545==1)||(((p186==1)&&(p407==1))&&(p562==1))))] != FALSE) + [(FwdU(Init,TRUE) * ((p183==1)&&(p569==1)))] != FALSE) + [(FwdU(Init,TRUE) * (((p186==1)&&(p407==1))&&(p562==1)))] != FALSE)
(forward)formula 0,1,0.310122,13200,1,0,7,23336,8,1,885,23566,1
FORMULA BusinessProcesses-PT-14-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-11 19:55:16] [INFO ] Flatten gal took : 63 ms
[2021-05-11 19:55:16] [INFO ] Flatten gal took : 33 ms
[2021-05-11 19:55:16] [INFO ] Applying decomposition
[2021-05-11 19:55:16] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8338299425076786816.txt, -o, /tmp/graph8338299425076786816.bin, -w, /tmp/graph8338299425076786816.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8338299425076786816.bin, -l, -1, -v, -w, /tmp/graph8338299425076786816.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:55:16] [INFO ] Decomposing Gal with order
[2021-05-11 19:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:55:16] [INFO ] Removed a total of 270 redundant transitions.
[2021-05-11 19:55:17] [INFO ] Flatten gal took : 227 ms
[2021-05-11 19:55:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2021-05-11 19:55:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4940031519840265060.gal : 7 ms
[2021-05-11 19:55:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16091583394068216968.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4940031519840265060.gal, -t, CGAL, -ctl, /tmp/CTLFireability16091583394068216968.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4940031519840265060.gal -t CGAL -ctl /tmp/CTLFireability16091583394068216968.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.89933e+26,31.8093,533692,23717,113,626539,1509,1197,3.98699e+06,99,4625,0
Converting to forward existential form...Done !
original formula: (EX((((((((i8.u165.p435==0)&&(((i6.u70.p179==0)||(i6.u154.p412==0))||(i6.u231.p609==0)))&&(i9.u137.p364==0))&&(i19.u175.p462==0))&&(((i6.u69.p207==0)||(i6.u154.p412==0))||(i6.u231.p609==0))) * (!(AG((i17.i1.i2.u97.p260==1))) + !(EX((i19.u210.p549==1))))) + !(AF((((i19.u222.p584==1)||(i6.u216.p570==1))||(i11.u15.p38==1)))))) * E((((((((((EF((((((((((((i6.u72.p183==1)&&(i6.u216.p569==1))||(i18.u170.p502==1))||(((i6.u66.p186==1)&&(i6.u152.p407==1))&&(i6.u231.p606==1)))||(i8.u2.p4==1))||(i17.i0.i0.u200.p527==1))||(((i11.u16.p40==1)&&(i12.u111.p297==1))&&(i11.u179.p471==1)))||(i18.u170.p512==1))||(i3.u18.p45==1))||(i6.u64.p172==1))||(i18.u172.p456==1))) + (!(EG(((((((i5.u198.p520==1)||(((i0.u88.p228==1)&&(i14.u130.p347==1))&&(i0.u221.p581==1)))||(i19.u175.p462==1))||(i9.u137.p364==1))||(i19.u208.p545==1))||(((i6.u71.p182==1)&&(i6.u157.p417==1))&&(i6.u157.p568==1))))) * E((((((i6.u235.p617==1)||(i17.i1.i3.u159.p420==1))||(i11.u105.p279==1))||(i16.u42.p100==1))||(i3.u181.p479==1)) U ((((((((((i6.u65.p176==1)&&(i6.u152.p407==1))&&(i6.u227.p597==1))||(i5.u7.p20==1))||(i19.u169.p449==1))||(i10.u103.p275==1))||(i16.u36.p89==1))||(((i9.u47.p116==1)&&(i9.u145.p387==1))&&(i5.u199.p523==1)))||(i19.u222.p583==1))||(i2.u186.p488==1))))) + (i6.u235.p617==1)) + (i19.u189.p496==1)) + (i6.u64.p170==1)) + (i19.u168.p446==1)) + (i17.i0.i0.u226.p595==1)) + (((i6.u66.p186==1)&&(i6.u152.p407==1))&&(i6.u227.p597==1))) + (i19.u196.p516==1)) + EX(((((i17.i1.i2.u98.p262==1)||(((i17.i0.i0.u49.p126==1)&&(i17.i0.i1.u148.p397==1))&&(i17.i0.i0.u200.p593==1)))||(i17.i0.i0.u200.p527==1))||(i8.u95.p255==1)))) U (AX(((EG((((i19.u224.p525==1)||(i8.u90.p235==1))||(i1.u56.p143==1))) * (i6.u153.p408==0)) * (((((((i16.u41.p97==1)||(((i10.u23.p56==1)&&(i11.u119.p322==1))&&(i10.u185.p486==1)))||(i8.u2.p5==1))||(i10.u102.p273==1))||(i17.i1.i2.u97.p259==1))||(i12.u111.p298==1))||(i2.u186.p488==1)))) * A((AX(((((((((((i16.u41.p99==1)||(i12.u111.p294==1))||(((i6.u67.p198==1)&&(i6.u154.p412==1))&&(i6.u214.p618==1)))||(i19.u224.p556==1))||(i0.u88.p229==1))||(i16.u39.p103==1))||(i9.u100.p268==1))||(i14.u129.p348==1))||((i6.u76.p196==1)&&(i6.u77.p199==1)))||(i6.u215.p563==1))) * (((((((EF((((((i6.u231.p555==1)||(i19.u169.p450==1))||(((i6.u71.p182==1)&&(i6.u157.p417==1))&&(i6.u214.p621==1)))||(i6.u64.p170==1))||(i18.u170.p561==1))) + (i5.u52.p130==1)) + (i9.u47.p117==1)) + (i9.u144.p388==1)) + (i11.u113.p304==1)) + (i6.u213.p557==1)) + (i4.u8.p22==1)) + (i6.u155.p413==1))) U (((i6.u153.p404==1)||(i9.u47.p117==1))||(i19.u196.p515==1))))))
=> equivalent forward existential formula: [(((FwdU((Init * EX((((((((i8.u165.p435==0)&&(((i6.u70.p179==0)||(i6.u154.p412==0))||(i6.u231.p609==0)))&&(i9.u137.p364==0))&&(i19.u175.p462==0))&&(((i6.u69.p207==0)||(i6.u154.p412==0))||(i6.u231.p609==0))) * (!(!(E(TRUE U !((i17.i1.i2.u97.p260==1))))) + !(EX((i19.u210.p549==1))))) + !(!(EG(!((((i19.u222.p584==1)||(i6.u216.p570==1))||(i11.u15.p38==1))))))))),(((((((((E(TRUE U (((((((((((i6.u72.p183==1)&&(i6.u216.p569==1))||(i18.u170.p502==1))||(((i6.u66.p186==1)&&(i6.u152.p407==1))&&(i6.u231.p606==1)))||(i8.u2.p4==1))||(i17.i0.i0.u200.p527==1))||(((i11.u16.p40==1)&&(i12.u111.p297==1))&&(i11.u179.p471==1)))||(i18.u170.p512==1))||(i3.u18.p45==1))||(i6.u64.p172==1))||(i18.u172.p456==1))) + (!(EG(((((((i5.u198.p520==1)||(((i0.u88.p228==1)&&(i14.u130.p347==1))&&(i0.u221.p581==1)))||(i19.u175.p462==1))||(i9.u137.p364==1))||(i19.u208.p545==1))||(((i6.u71.p182==1)&&(i6.u157.p417==1))&&(i6.u157.p568==1))))) * E((((((i6.u235.p617==1)||(i17.i1.i3.u159.p420==1))||(i11.u105.p279==1))||(i16.u42.p100==1))||(i3.u181.p479==1)) U ((((((((((i6.u65.p176==1)&&(i6.u152.p407==1))&&(i6.u227.p597==1))||(i5.u7.p20==1))||(i19.u169.p449==1))||(i10.u103.p275==1))||(i16.u36.p89==1))||(((i9.u47.p116==1)&&(i9.u145.p387==1))&&(i5.u199.p523==1)))||(i19.u222.p583==1))||(i2.u186.p488==1))))) + (i6.u235.p617==1)) + (i19.u189.p496==1)) + (i6.u64.p170==1)) + (i19.u168.p446==1)) + (i17.i0.i0.u226.p595==1)) + (((i6.u66.p186==1)&&(i6.u152.p407==1))&&(i6.u227.p597==1))) + (i19.u196.p516==1)) + EX(((((i17.i1.i2.u98.p262==1)||(((i17.i0.i0.u49.p126==1)&&(i17.i0.i1.u148.p397==1))&&(i17.i0.i0.u200.p593==1)))||(i17.i0.i0.u200.p527==1))||(i8.u95.p255==1))))) * !(EX(!(((EG((((i19.u224.p525==1)||(i8.u90.p235==1))||(i1.u56.p143==1))) * (i6.u153.p408==0)) * (((((((i16.u41.p97==1)||(((i10.u23.p56==1)&&(i11.u119.p322==1))&&(i10.u185.p486==1)))||(i8.u2.p5==1))||(i10.u102.p273==1))||(i17.i1.i2.u97.p259==1))||(i12.u111.p298==1))||(i2.u186.p488==1))))))) * !(EG(!((((i6.u153.p404==1)||(i9.u47.p117==1))||(i19.u196.p515==1)))))) * !(E(!((((i6.u153.p404==1)||(i9.u47.p117==1))||(i19.u196.p515==1))) U (!((!(EX(!(((((((((((i16.u41.p99==1)||(i12.u111.p294==1))||(((i6.u67.p198==1)&&(i6.u154.p412==1))&&(i6.u214.p618==1)))||(i19.u224.p556==1))||(i0.u88.p229==1))||(i16.u39.p103==1))||(i9.u100.p268==1))||(i14.u129.p348==1))||((i6.u76.p196==1)&&(i6.u77.p199==1)))||(i6.u215.p563==1))))) * (((((((E(TRUE U (((((i6.u231.p555==1)||(i19.u169.p450==1))||(((i6.u71.p182==1)&&(i6.u157.p417==1))&&(i6.u214.p621==1)))||(i6.u64.p170==1))||(i18.u170.p561==1))) + (i5.u52.p130==1)) + (i9.u47.p117==1)) + (i9.u144.p388==1)) + (i11.u113.p304==1)) + (i6.u213.p557==1)) + (i4.u8.p22==1)) + (i6.u155.p413==1)))) * !((((i6.u153.p404==1)||(i9.u47.p117==1))||(i19.u196.p515==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t267, t386, t400, i0.t271, i0.u85.t278, i0.u87.t274, i1.u56.t323, i1.u58.t319, i2.t385, i2.t380, i2.t91, i2.u25.t383, i2.u26.t381, i2.u186.t95, i3.t410, i3.t399, i3.t394, i3.t114, i3.t104, i3.u12.t408, i3.u18.t397, i3.u13.t406, i3.u19.t395, i3.u174.t118, i3.u180.t107, i4.t379, i4.t368, i4.u28.t377, i4.u30.t371, i4.u30.t372, i4.u30.t373, i5.u44.t345, i5.u46.t341, i5.u52.t331, i6.t307, i6.t288, i6.t286, i6.t166, i6.t162, i6.t158, i6.t2, i6.u64.t293, i6.u64.t297, i6.u64.t301, i6.u154.t163, i6.u65.t289, i6.u152.t167, i6.u157.t159, i7.u60.t315, i7.u62.t311, i8.t150, i8.t142, i8.t138, i8.u89.t270, i8.u93.t261, i8.u91.t264, i8.u161.t151, i8.u165.t143, i8.u167.t139, i9.t202, i9.t198, i9.t190, i9.t186, i9.t182, i9.u134.t203, i9.u136.t199, i9.u141.t191, i9.u142.t187, i9.u145.t183, i10.t391, i10.t389, i10.t225, i10.t221, i10.t217, i10.u20.t393, i10.u124.t226, i10.u125.t222, i10.u128.t218, i11.t405, i11.t245, i11.t241, i11.t237, i11.t233, i11.u15.t403, i11.u114.t246, i11.u116.t242, i11.u117.t238, i11.u119.t234, i12.t258, i12.t255, i12.u108.t259, i12.u109.t256, i13.t229, i13.t146, i13.u83.t282, i13.u121.t230, i13.u162.t147, i14.t213, i14.t209, i14.u133.t205, i14.u130.t214, i14.u131.t210, i15.t194, i15.u54.t327, i15.u139.t195, i16.t362, i16.t358, i16.t356, i16.t353, i16.t350, i16.t348, i16.u41.t354, i16.u41.t355, i17.i0.i0.u48.t337, i17.i0.i1.t174, i17.i0.i1.u148.t175, i17.i1.i0.t178, i17.i1.i0.u147.t179, i17.i1.i1.t170, i17.i1.i1.u150.t171, i17.i1.i3.t154, i17.i1.i3.u159.t155, i18.u170.t13, i18.u170.t25, i18.u170.t28, i18.u170.t69, i18.u170.t77, i18.u170.t83, i18.u170.t84, i18.u170.t105, i19.t132, i19.t125, i19.t120, i19.t116, i19.t112, i19.t110, i19.t102, i19.t100, i19.t98, i19.t93, i19.t89, i19.t87, i19.t81, i19.t79, i19.t76, i19.t74, i19.t72, i19.t62, i19.t59, i19.t55, i19.t52, i19.t49, i19.t22, i19.t19, i19.t16, i19.u224.t12, i19.u224.t32, i19.u224.t36, i19.u224.t40, i19.u224.t46, i19.u224.t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/342/162/540
Detected timeout of ITS tools.
[2021-05-11 20:16:55] [INFO ] Applying decomposition
[2021-05-11 20:16:55] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:16:55] [INFO ] Decomposing Gal with order
[2021-05-11 20:16:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:16:55] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-11 20:16:55] [INFO ] Flatten gal took : 32 ms
[2021-05-11 20:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 73 ms.
[2021-05-11 20:16:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10508895718147733318.gal : 22 ms
[2021-05-11 20:16:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2369110847152620396.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10508895718147733318.gal, -t, CGAL, -ctl, /tmp/CTLFireability2369110847152620396.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability10508895718147733318.gal -t CGAL -ctl /tmp/CTLFireability2369110847152620396.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:38:36] [INFO ] Flatten gal took : 367 ms
[2021-05-11 20:38:37] [INFO ] Input system was already deterministic with 540 transitions.
[2021-05-11 20:38:37] [INFO ] Transformed 595 places.
[2021-05-11 20:38:37] [INFO ] Transformed 540 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 20:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2053042913814521677.gal : 17 ms
[2021-05-11 20:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10147950991012804526.ctl : 21 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2053042913814521677.gal, -t, CGAL, -ctl, /tmp/CTLFireability10147950991012804526.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2053042913814521677.gal -t CGAL -ctl /tmp/CTLFireability10147950991012804526.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-14"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, 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 r026-tajo-162038143900426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 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 '
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 ;