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-162038143900442.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-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K 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 94K 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.5K 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.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 159K 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-16-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620765448447

Running Version 0
[2021-05-11 20:37:30] [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 20:37:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:37:30] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-11 20:37:30] [INFO ] Transformed 638 places.
[2021-05-11 20:37:30] [INFO ] Transformed 578 transitions.
[2021-05-11 20:37:30] [INFO ] Found NUPN structural information;
[2021-05-11 20:37:30] [INFO ] Parsed PT model containing 638 places and 578 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
Support contains 435 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 605 transition count 550
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 605 transition count 550
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 603 transition count 548
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 603 transition count 548
Applied a total of 49 rules in 56 ms. Remains 603 /630 variables (removed 27) and now considering 548/570 (removed 22) transitions.
// Phase 1: matrix 548 rows 603 cols
[2021-05-11 20:37:30] [INFO ] Computed 95 place invariants in 34 ms
[2021-05-11 20:37:30] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 548 rows 603 cols
[2021-05-11 20:37:30] [INFO ] Computed 95 place invariants in 12 ms
[2021-05-11 20:37:30] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
// Phase 1: matrix 548 rows 603 cols
[2021-05-11 20:37:31] [INFO ] Computed 95 place invariants in 16 ms
[2021-05-11 20:37:31] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Finished structural reductions, in 1 iterations. Remains : 603/630 places, 548/570 transitions.
[2021-05-11 20:37:31] [INFO ] Flatten gal took : 62 ms
[2021-05-11 20:37:31] [INFO ] Flatten gal took : 32 ms
[2021-05-11 20:37:31] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 100000 steps, including 668 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 102) seen :83
Running SMT prover for 19 properties.
// Phase 1: matrix 548 rows 603 cols
[2021-05-11 20:37:32] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-11 20:37:32] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2021-05-11 20:37:32] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 20 ms returned sat
[2021-05-11 20:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:37:32] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-11 20:37:33] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 5 ms to minimize.
[2021-05-11 20:37:33] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:37:33] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:37:33] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:37:33] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:37:33] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:37:34] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:37:34] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:37:34] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 4 ms to minimize.
[2021-05-11 20:37:34] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 0 ms to minimize.
[2021-05-11 20:37:34] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:37:35] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 1 ms to minimize.
[2021-05-11 20:37:35] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:37:35] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:37:35] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:37:35] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:37:36] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:37:36] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:37:36] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:37:36] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:37:36] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:37:36] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:37:37] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:37:37] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:37:37] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:37:37] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:37:37] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:37:37] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:37:38] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:37:38] [INFO ] Deduced a trap composed of 136 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:37:38] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 0 ms to minimize.
[2021-05-11 20:37:38] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:37:38] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:37:39] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:37:39] [INFO ] Deduced a trap composed of 157 places in 144 ms of which 5 ms to minimize.
[2021-05-11 20:37:39] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:37:39] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:37:39] [INFO ] Deduced a trap composed of 143 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:37:40] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:37:40] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:37:40] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:37:40] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:37:40] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:37:40] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:37:41] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:37:41] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:37:41] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:37:41] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:37:41] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 154 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:37:42] [INFO ] Deduced a trap composed of 143 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:37:43] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:37:43] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:37:43] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:37:43] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:37:43] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:37:44] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:37:44] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:37:44] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:37:44] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:37:44] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 3 ms to minimize.
[2021-05-11 20:37:45] [INFO ] Deduced a trap composed of 129 places in 157 ms of which 2 ms to minimize.
[2021-05-11 20:37:45] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 11 ms to minimize.
[2021-05-11 20:37:45] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:37:45] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:37:45] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:37:45] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:37:46] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:37:46] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:37:46] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:37:46] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:37:46] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:37:47] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:37:47] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:37:47] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:37:47] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:37:47] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:37:48] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:37:48] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:37:48] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:37:48] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:37:48] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:37:48] [INFO ] Deduced a trap composed of 147 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:37:49] [INFO ] Deduced a trap composed of 161 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:37:49] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:37:49] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:37:49] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:37:49] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:37:49] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:37:50] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:37:50] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:37:50] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:37:50] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:37:50] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:37:50] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:37:51] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:37:51] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:37:51] [INFO ] Deduced a trap composed of 150 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:37:51] [INFO ] Deduced a trap composed of 146 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:37:51] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:37:51] [INFO ] Deduced a trap composed of 147 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:37:52] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:37:52] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:37:52] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:37:52] [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 20:37:52] [INFO ] [Real]Absence check using 56 positive place invariants in 21 ms returned sat
[2021-05-11 20:37:52] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 20:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:37:52] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-11 20:37:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2021-05-11 20:37:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2021-05-11 20:37:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2021-05-11 20:37:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2021-05-11 20:37:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:37:53] [INFO ] [Nat]Absence check using 56 positive place invariants in 21 ms returned sat
[2021-05-11 20:37:53] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 20:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:37:53] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-11 20:37:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:37:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2021-05-11 20:37:53] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2021-05-11 20:37:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2021-05-11 20:37:53] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 43 ms.
[2021-05-11 20:37:55] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:37:55] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:37:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2021-05-11 20:37:55] [INFO ] Added : 247 causal constraints over 50 iterations in 2017 ms. Result :sat
[2021-05-11 20:37:55] [INFO ] [Real]Absence check using 56 positive place invariants in 27 ms returned sat
[2021-05-11 20:37:55] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-11 20:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:37:56] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:37:56] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1079 ms
[2021-05-11 20:37:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:37:57] [INFO ] [Nat]Absence check using 56 positive place invariants in 21 ms returned sat
[2021-05-11 20:37:57] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 20:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:37:57] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:37:57] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2021-05-11 20:37:58] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2021-05-11 20:37:58] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2021-05-11 20:37:58] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2021-05-11 20:37:58] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2021-05-11 20:37:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 912 ms
[2021-05-11 20:37:58] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 47 ms.
[2021-05-11 20:37:59] [INFO ] Added : 241 causal constraints over 49 iterations in 1470 ms. Result :sat
[2021-05-11 20:37:59] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2021-05-11 20:37:59] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-11 20:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:00] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-11 20:38:00] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2021-05-11 20:38:00] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2021-05-11 20:38:00] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 3 ms to minimize.
[2021-05-11 20:38:00] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:38:01] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:38:01] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:38:01] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:38:01] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2021-05-11 20:38:01] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:38:01] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:38:02] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:38:02] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2021-05-11 20:38:02] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:38:02] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:38:02] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:38:02] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:38:03] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:38:03] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:38:03] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:38:03] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:38:03] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:38:03] [INFO ] Deduced a trap composed of 130 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:38:04] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:38:04] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:38:04] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:38:04] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:38:04] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:38:04] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:38:05] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:38:05] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:38:05] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:38:05] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:38:05] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:38:05] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:38:06] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:38:06] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:38:06] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:38:06] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:38:06] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:38:06] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:38:07] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:38:07] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:38:07] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:38:07] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:38:07] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:38:07] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:38:08] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:38:08] [INFO ] Deduced a trap composed of 128 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:38:08] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:38:08] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:38:08] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:38:08] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:38:09] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:38:09] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:38:09] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:38:09] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:38:09] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:38:09] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:38:10] [INFO ] Deduced a trap composed of 124 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:38:11] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:38:11] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:38:11] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:38:11] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:38:11] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:38:12] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:38:12] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:38:12] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:38:12] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:38:12] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:38:12] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:38:13] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:38:13] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:38:13] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:38:13] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:38:13] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:38:13] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:38:14] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:38:14] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:38:14] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:38:14] [INFO ] Deduced a trap composed of 154 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:38:14] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:38:15] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:38:15] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:38:15] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:38:15] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:38:15] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:38:15] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:38:16] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2021-05-11 20:38:16] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:38:16] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:38:16] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:38:16] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:38:17] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:38:17] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:38:17] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:38:17] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:38:17] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:38:18] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:38:18] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:38:18] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:38:18] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:38:18] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 13 ms to minimize.
[2021-05-11 20:38:18] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:38:19] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:38:19] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:38:19] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:38:19] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 13 ms to minimize.
[2021-05-11 20:38:19] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:38:19] [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 3
[2021-05-11 20:38:19] [INFO ] [Real]Absence check using 56 positive place invariants in 28 ms returned sat
[2021-05-11 20:38:19] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:20] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2021-05-11 20:38:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:20] [INFO ] [Nat]Absence check using 56 positive place invariants in 37 ms returned sat
[2021-05-11 20:38:20] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 20:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:20] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 151 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:38:21] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 12 ms to minimize.
[2021-05-11 20:38:22] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:38:22] [INFO ] Deduced a trap composed of 149 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:38:22] [INFO ] Deduced a trap composed of 151 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:38:22] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:38:22] [INFO ] Deduced a trap composed of 149 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:38:22] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:38:23] [INFO ] Deduced a trap composed of 151 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:38:24] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:38:24] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:38:24] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:38:24] [INFO ] Deduced a trap composed of 151 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:38:24] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:38:24] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:38:25] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:38:25] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:38:25] [INFO ] Deduced a trap composed of 154 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:38:25] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:38:25] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:38:26] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:38:26] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:38:26] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:38:26] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:38:26] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:38:26] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:38:27] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:38:27] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:38:27] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:38:27] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:38:27] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:38:28] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:38:28] [INFO ] Deduced a trap composed of 152 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:38:28] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 0 ms to minimize.
[2021-05-11 20:38:28] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:38:29] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:38:29] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:38:29] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:38:29] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 9066 ms
[2021-05-11 20:38:29] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 41 ms.
[2021-05-11 20:38:32] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:38:32] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:38:32] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:38:33] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:38:33] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:38:33] [INFO ] Deduced a trap composed of 144 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:38:33] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:38:34] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:38:34] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:38:34] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:38:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2713 ms
[2021-05-11 20:38:34] [INFO ] Added : 278 causal constraints over 56 iterations in 5041 ms. Result :sat
[2021-05-11 20:38:35] [INFO ] [Real]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-11 20:38:35] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:35] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2021-05-11 20:38:35] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:38:35] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:38:35] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:38:36] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:38:36] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:38:36] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:38:36] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:38:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 830 ms
[2021-05-11 20:38:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:36] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2021-05-11 20:38:36] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:36] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2021-05-11 20:38:37] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:38:37] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:38:37] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2021-05-11 20:38:37] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2021-05-11 20:38:37] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:38:37] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2021-05-11 20:38:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 727 ms
[2021-05-11 20:38:37] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 43 ms.
[2021-05-11 20:38:39] [INFO ] Added : 231 causal constraints over 47 iterations in 1542 ms. Result :sat
[2021-05-11 20:38:39] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2021-05-11 20:38:39] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 20:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:39] [INFO ] [Real]Absence check using state equation in 165 ms returned unsat
[2021-05-11 20:38:39] [INFO ] [Real]Absence check using 56 positive place invariants in 24 ms returned sat
[2021-05-11 20:38:39] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:39] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-11 20:38:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:39] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-11 20:38:39] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:40] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-11 20:38:40] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:38:40] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:38:40] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:38:40] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2021-05-11 20:38:40] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2021-05-11 20:38:40] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Deduced a trap composed of 39 places in 21 ms of which 0 ms to minimize.
[2021-05-11 20:38:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1651 ms
[2021-05-11 20:38:41] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 42 ms.
[2021-05-11 20:38:44] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:38:44] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:38:44] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:38:44] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:38:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 865 ms
[2021-05-11 20:38:44] [INFO ] Added : 344 causal constraints over 70 iterations in 3121 ms. Result :sat
[2021-05-11 20:38:45] [INFO ] [Real]Absence check using 56 positive place invariants in 23 ms returned sat
[2021-05-11 20:38:45] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 20:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:45] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2021-05-11 20:38:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:45] [INFO ] [Nat]Absence check using 56 positive place invariants in 21 ms returned sat
[2021-05-11 20:38:45] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 20:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:45] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:38:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 968 ms
[2021-05-11 20:38:46] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 54 ms.
[2021-05-11 20:38:48] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:38:48] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:38:48] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:38:49] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:38:49] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:38:49] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 0 ms to minimize.
[2021-05-11 20:38:49] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2021-05-11 20:38:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 865 ms
[2021-05-11 20:38:49] [INFO ] Added : 273 causal constraints over 55 iterations in 2641 ms. Result :sat
[2021-05-11 20:38:49] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2021-05-11 20:38:49] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:49] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2021-05-11 20:38:50] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:38:50] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:38:50] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:38:50] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:38:50] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:38:50] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:38:51] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:38:51] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:38:51] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:38:51] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:38:51] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 150 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:38:52] [INFO ] Deduced a trap composed of 133 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 149 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:38:54] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:38:54] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:38:54] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:38:54] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:38:54] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:38:54] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:38:55] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:38:55] [INFO ] Deduced a trap composed of 142 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:38:55] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:38:55] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:38:55] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:38:56] [INFO ] Deduced a trap composed of 160 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:38:56] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-11 20:38:56] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2021-05-11 20:38:56] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6422 ms
[2021-05-11 20:38:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-11 20:38:56] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:56] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-11 20:38:57] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:38:57] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:38:57] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:38:57] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:38:57] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:38:58] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:38:58] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:38:58] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:38:58] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:38:58] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:38:58] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:38:59] [INFO ] Deduced a trap composed of 151 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:38:59] [INFO ] Deduced a trap composed of 127 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:38:59] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:38:59] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:38:59] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:38:59] [INFO ] Deduced a trap composed of 146 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 144 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 168 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:39:00] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:39:01] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:39:01] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:39:01] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:39:01] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:39:01] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:39:01] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:39:02] [INFO ] Deduced a trap composed of 150 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:39:02] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:39:02] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:39:02] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:39:02] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:39:03] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:03] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:39:03] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:39:03] [INFO ] Deduced a trap composed of 155 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:39:03] [INFO ] Deduced a trap composed of 140 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:39:04] [INFO ] Deduced a trap composed of 139 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:39:04] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7259 ms
[2021-05-11 20:39:04] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 29 ms.
[2021-05-11 20:39:05] [INFO ] Added : 266 causal constraints over 54 iterations in 1838 ms. Result :sat
[2021-05-11 20:39:06] [INFO ] [Real]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-11 20:39:06] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 20:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:06] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-11 20:39:06] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:39:06] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:39:06] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:39:07] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:39:07] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:39:07] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:39:07] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2021-05-11 20:39:07] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2021-05-11 20:39:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1369 ms
[2021-05-11 20:39:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:39:07] [INFO ] [Nat]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-11 20:39:07] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 20:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:08] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2021-05-11 20:39:08] [INFO ] Deduced a trap composed of 108 places in 203 ms of which 1 ms to minimize.
[2021-05-11 20:39:08] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2021-05-11 20:39:08] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2021-05-11 20:39:08] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:39:09] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:39:09] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:39:09] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:39:09] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:39:09] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:39:10] [INFO ] Deduced a trap composed of 130 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:39:10] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:39:10] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:39:10] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2021-05-11 20:39:10] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:39:11] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:39:11] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:39:11] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:39:11] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:39:11] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:39:12] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:39:12] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:39:12] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:39:12] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:39:12] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:39:12] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:39:13] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:39:14] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:39:14] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:39:14] [INFO ] Deduced a trap composed of 127 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:39:14] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:39:14] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:39:14] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 140 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:15] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:39:16] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:39:16] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:39:16] [INFO ] Deduced a trap composed of 142 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:39:16] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:39:16] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:39:17] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:17] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:39:17] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:39:17] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:39:17] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:39:17] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:39:18] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:39:18] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:39:18] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:39:18] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:39:18] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:18] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:39:19] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:39:19] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:39:19] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:39:19] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:39:19] [INFO ] Deduced a trap composed of 120 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:39:19] [INFO ] Deduced a trap composed of 132 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:39:20] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 11 ms to minimize.
[2021-05-11 20:39:20] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:39:20] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:39:20] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:39:20] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:39:21] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:39:21] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:39:21] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:39:21] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:39:21] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:39:21] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:39:22] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:39:23] [INFO ] Trap strengthening (SAT) tested/added 87/86 trap constraints in 15039 ms
[2021-05-11 20:39:23] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 43 ms.
[2021-05-11 20:39:25] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:39:26] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:39:26] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:39:26] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:39:26] [INFO ] Deduced a trap composed of 154 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:39:27] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:39:27] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:39:27] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:39:27] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:39:27] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 1 ms to minimize.
[2021-05-11 20:39:27] [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 10
[2021-05-11 20:39:28] [INFO ] [Real]Absence check using 56 positive place invariants in 19 ms returned sat
[2021-05-11 20:39:28] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 20:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:28] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2021-05-11 20:39:28] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 0 ms to minimize.
[2021-05-11 20:39:28] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:39:28] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:39:29] [INFO ] Deduced a trap composed of 146 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:39:29] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:39:29] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:39:29] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:39:29] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:39:29] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2021-05-11 20:39:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2187 ms
[2021-05-11 20:39:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:39:30] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2021-05-11 20:39:30] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-11 20:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:31] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2021-05-11 20:39:31] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:39:31] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:39:31] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:39:31] [INFO ] Deduced a trap composed of 146 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:39:31] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:39:32] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:39:33] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2021-05-11 20:39:33] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2021-05-11 20:39:33] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2021-05-11 20:39:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2197 ms
[2021-05-11 20:39:33] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 36 ms.
[2021-05-11 20:39:35] [INFO ] Added : 316 causal constraints over 64 iterations in 2321 ms. Result :sat
[2021-05-11 20:39:35] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2021-05-11 20:39:35] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 20:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:35] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-11 20:39:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:39:36] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-11 20:39:36] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:36] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2021-05-11 20:39:36] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 2 ms to minimize.
[2021-05-11 20:39:36] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:39:36] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:39:37] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:39:37] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:39:37] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:39:37] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:39:37] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2021-05-11 20:39:38] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 0 ms to minimize.
[2021-05-11 20:39:38] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:39:38] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:39:38] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:39:38] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:39:38] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:39:39] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:39:40] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:39:40] [INFO ] Deduced a trap composed of 152 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:39:40] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:39:40] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:39:40] [INFO ] Deduced a trap composed of 152 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:39:40] [INFO ] Deduced a trap composed of 156 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 128 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:39:41] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:42] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:39:42] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:39:42] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:39:42] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:39:42] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:39:42] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:39:43] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:39:43] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:39:43] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:39:43] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:39:43] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:39:43] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:39:44] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:39:44] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:39:44] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:44] [INFO ] Deduced a trap composed of 162 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:44] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:39:44] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2021-05-11 20:39:45] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2021-05-11 20:39:46] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 9708 ms
[2021-05-11 20:39:46] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 46 ms.
[2021-05-11 20:39:48] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:39:49] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:39:49] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:39:49] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:39:49] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:39:49] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:39:50] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:39:50] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:39:50] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:39:50] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:39:51] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:39:51] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:39:51] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:39:51] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:39:52] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:39:52] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:39:52] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:39:52] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:39:53] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:39:53] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:39:53] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:39:54] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:39:54] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:39:54] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 2 ms to minimize.
[2021-05-11 20:39:54] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:39:55] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:39:55] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:39:55] [INFO ] Deduced a trap composed of 137 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:39:55] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:39:56] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:39:56] [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 12
[2021-05-11 20:39:56] [INFO ] [Real]Absence check using 56 positive place invariants in 19 ms returned sat
[2021-05-11 20:39:56] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 20:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:56] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2021-05-11 20:39:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:39:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 23 ms returned sat
[2021-05-11 20:39:56] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 21 ms returned sat
[2021-05-11 20:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:39:56] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-11 20:39:57] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2021-05-11 20:39:57] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:39:57] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:39:57] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:39:57] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:39:57] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:39:58] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:39:59] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:39:59] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:39:59] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2021-05-11 20:39:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2322 ms
[2021-05-11 20:39:59] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 36 ms.
[2021-05-11 20:40:01] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:40:01] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:40:02] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:40:02] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:40:02] [INFO ] Deduced a trap composed of 141 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:40:02] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:40:02] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:40:03] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:40:03] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:40:03] [INFO ] Deduced a trap composed of 146 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:40:03] [INFO ] Deduced a trap composed of 151 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:40:04] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:40:04] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:40:04] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:40:04] [INFO ] Deduced a trap composed of 141 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:40:04] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:40:05] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:40:05] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:40:05] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:40:05] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:40:05] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:40:06] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:40:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4743 ms
[2021-05-11 20:40:06] [INFO ] Added : 296 causal constraints over 60 iterations in 7161 ms. Result :sat
[2021-05-11 20:40:06] [INFO ] [Real]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-11 20:40:06] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 20:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:06] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-11 20:40:07] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 0 ms to minimize.
[2021-05-11 20:40:07] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:40:07] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:40:07] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:40:07] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:40:08] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:40:09] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:40:09] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:40:09] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:40:09] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:40:09] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:40:09] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:40:10] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3999 ms
[2021-05-11 20:40:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:40:10] [INFO ] [Nat]Absence check using 56 positive place invariants in 22 ms returned sat
[2021-05-11 20:40:10] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-11 20:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:11] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2021-05-11 20:40:11] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 0 ms to minimize.
[2021-05-11 20:40:11] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 0 ms to minimize.
[2021-05-11 20:40:11] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:40:12] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 0 ms to minimize.
[2021-05-11 20:40:12] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:40:12] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 0 ms to minimize.
[2021-05-11 20:40:12] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:40:12] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:40:13] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2021-05-11 20:40:14] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2021-05-11 20:40:15] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:40:15] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:40:15] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:40:15] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:40:15] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:40:15] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4308 ms
[2021-05-11 20:40:15] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 22 ms.
[2021-05-11 20:40:17] [INFO ] Added : 255 causal constraints over 52 iterations in 1471 ms. Result :sat
[2021-05-11 20:40:17] [INFO ] [Real]Absence check using 56 positive place invariants in 23 ms returned sat
[2021-05-11 20:40:17] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:17] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-11 20:40:17] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:40:17] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:40:18] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:40:19] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:40:19] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:40:19] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:40:19] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:40:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2072 ms
[2021-05-11 20:40:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:40:19] [INFO ] [Nat]Absence check using 56 positive place invariants in 23 ms returned sat
[2021-05-11 20:40:19] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 20:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:19] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-11 20:40:20] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2021-05-11 20:40:20] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2021-05-11 20:40:20] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:40:20] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2021-05-11 20:40:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 752 ms
[2021-05-11 20:40:20] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 44 ms.
[2021-05-11 20:40:22] [INFO ] Added : 252 causal constraints over 51 iterations in 1528 ms. Result :sat
[2021-05-11 20:40:22] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2021-05-11 20:40:22] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-11 20:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:22] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-11 20:40:22] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:40:22] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:40:22] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2021-05-11 20:40:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1450 ms
[2021-05-11 20:40:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:40:23] [INFO ] [Nat]Absence check using 56 positive place invariants in 19 ms returned sat
[2021-05-11 20:40:23] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 20:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:24] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-11 20:40:24] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:40:24] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:40:24] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:40:24] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:40:25] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:40:25] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:40:25] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:40:25] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:40:25] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:40:25] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:40:26] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:40:26] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:40:26] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:40:26] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:40:26] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:40:26] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:40:27] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:40:27] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:40:27] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:40:27] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:40:27] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:40:28] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:40:28] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:40:28] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:40:28] [INFO ] Deduced a trap composed of 120 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:40:28] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:40:28] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:40:29] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:40:29] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:40:29] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:40:29] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:40:29] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:40:29] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:40:30] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:40:30] [INFO ] Deduced a trap composed of 160 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:40:30] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:40:30] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:40:30] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:40:31] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:40:31] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:40:31] [INFO ] Deduced a trap composed of 133 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:40:31] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:40:31] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:40:32] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:40:32] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:40:32] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:40:32] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:40:32] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:40:32] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:40:33] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:40:33] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 9072 ms
[2021-05-11 20:40:33] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 31 ms.
[2021-05-11 20:40:35] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2021-05-11 20:40:35] [INFO ] Added : 290 causal constraints over 59 iterations in 2827 ms. Result :sat
[2021-05-11 20:40:36] [INFO ] [Real]Absence check using 56 positive place invariants in 23 ms returned sat
[2021-05-11 20:40:36] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 20:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:36] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2021-05-11 20:40:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:40:36] [INFO ] [Nat]Absence check using 56 positive place invariants in 32 ms returned sat
[2021-05-11 20:40:36] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 16 ms returned sat
[2021-05-11 20:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:36] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2021-05-11 20:40:37] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:40:37] [INFO ] Deduced a trap composed of 121 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:40:37] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:40:37] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:40:37] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:40:37] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:40:38] [INFO ] Deduced a trap composed of 150 places in 134 ms of which 23 ms to minimize.
[2021-05-11 20:40:39] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:40:39] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:40:39] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:40:39] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:40:39] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:40:40] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:40:40] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:40:40] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:40:40] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:40:40] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:40:40] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:40:41] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:40:41] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:40:41] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:40:41] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:40:42] [INFO ] Deduced a trap composed of 160 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:40:42] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:40:42] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:40:42] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:40:42] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:40:42] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:40:43] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 0 ms to minimize.
[2021-05-11 20:40:43] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:40:43] [INFO ] Deduced a trap composed of 139 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:40:43] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:40:44] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:40:44] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:40:44] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:40:44] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:40:44] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:40:45] [INFO ] Deduced a trap composed of 140 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:40:45] [INFO ] Deduced a trap composed of 134 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:40:45] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:40:45] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:40:45] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:40:45] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:40:46] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:40:46] [INFO ] Deduced a trap composed of 144 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:40:46] [INFO ] Deduced a trap composed of 147 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:40:46] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:40:46] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:40:47] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 6 ms to minimize.
[2021-05-11 20:40:47] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:40:47] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:40:47] [INFO ] Deduced a trap composed of 157 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:40:47] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:40:47] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:40:48] [INFO ] Deduced a trap composed of 142 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:40:48] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:40:48] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:40:49] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:40:49] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:40:49] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:40:50] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:40:51] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:40:51] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:40:51] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:40:51] [INFO ] Deduced a trap composed of 137 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:40:51] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2021-05-11 20:40:52] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:40:52] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:40:52] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:40:53] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:40:53] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:40:53] [INFO ] Deduced a trap composed of 134 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:40:53] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:40:53] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:40:54] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:40:54] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:40:54] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:40:54] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:40:55] [INFO ] Deduced a trap composed of 135 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:40:55] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:40:55] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 0 ms to minimize.
[2021-05-11 20:40:55] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:40:56] [INFO ] Deduced a trap composed of 132 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:40:56] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 0 ms to minimize.
[2021-05-11 20:40:56] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:40:56] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2021-05-11 20:40:56] [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 17
[2021-05-11 20:40:56] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2021-05-11 20:40:56] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-11 20:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:40:56] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-11 20:40:57] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2021-05-11 20:40:57] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 0 ms to minimize.
[2021-05-11 20:40:57] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2021-05-11 20:40:57] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:40:58] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:40:58] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:40:58] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:40:58] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:40:58] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:40:58] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:40:59] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:40:59] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:40:59] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:40:59] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:40:59] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:41:00] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:41:00] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:41:00] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:41:00] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:41:00] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:41:01] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:41:01] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:41:01] [INFO ] Deduced a trap composed of 139 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:41:01] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:41:01] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:41:01] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:41:02] [INFO ] Deduced a trap composed of 152 places in 148 ms of which 0 ms to minimize.
[2021-05-11 20:41:02] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:41:02] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:41:02] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:41:02] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:41:02] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:41:03] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:41:03] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:41:03] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:41:03] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:41:03] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:41:04] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:41:04] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:41:04] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:41:04] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:41:04] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:41:05] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:41:05] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:41:05] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:41:05] [INFO ] Deduced a trap composed of 140 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:41:05] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:41:05] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:41:06] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:41:06] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:41:06] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:41:06] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:41:06] [INFO ] Deduced a trap composed of 142 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:41:07] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:41:07] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:41:07] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:41:07] [INFO ] Deduced a trap composed of 144 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:41:07] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2021-05-11 20:41:08] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 11021 ms
[2021-05-11 20:41:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:41:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2021-05-11 20:41:08] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-11 20:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:41:08] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-11 20:41:08] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2021-05-11 20:41:08] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:41:08] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:41:08] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 0 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:41:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1313 ms
[2021-05-11 20:41:09] [INFO ] Computed and/alt/rep : 512/854/512 causal constraints (skipped 35 transitions) in 30 ms.
[2021-05-11 20:41:11] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:41:11] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:41:12] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:41:12] [INFO ] Deduced a trap composed of 145 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:41:12] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:41:12] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:41:12] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:41:13] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:41:13] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:41:13] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:41:13] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:41:13] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:41:14] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:41:14] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:41:14] [INFO ] Deduced a trap composed of 144 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:41:14] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:41:14] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:41:15] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:41:15] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:41:15] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:41:15] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:41:15] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:41:16] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:41:16] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:41:16] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:41:16] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:41:16] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:41:17] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:41:17] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:41:17] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:41:17] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:41:17] [INFO ] Deduced a trap composed of 157 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:41:18] [INFO ] Deduced a trap composed of 150 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:41:18] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:41:18] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:41:18] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:41:19] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:41:19] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:41:19] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:41:19] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:41:19] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:41:20] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:41:20] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:41:20] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:41:20] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:41:21] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:41:21] [INFO ] Deduced a trap composed of 139 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:41:21] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:41:21] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:41:22] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:41:22] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:41:22] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:41:22] [INFO ] Deduced a trap composed of 139 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:41:23] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:41:23] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:41:23] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:41:23] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:41:24] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:41:24] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:41:24] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:41:25] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:41:25] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:41:25] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 14197 ms
[2021-05-11 20:41:25] [INFO ] Added : 336 causal constraints over 68 iterations in 16206 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 602 transition count 486
Reduce places removed 61 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 72 rules applied. Total rules applied 133 place count 541 transition count 475
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 144 place count 530 transition count 475
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 144 place count 530 transition count 360
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 387 place count 402 transition count 360
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 463 place count 326 transition count 284
Iterating global reduction 3 with 76 rules applied. Total rules applied 539 place count 326 transition count 284
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 539 place count 326 transition count 280
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 549 place count 320 transition count 280
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 699 place count 244 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 700 place count 244 transition count 205
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 705 place count 244 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 706 place count 243 transition count 204
Applied a total of 706 rules in 124 ms. Remains 243 /603 variables (removed 360) and now considering 204/548 (removed 344) transitions.
[2021-05-11 20:41:26] [INFO ] Flatten gal took : 18 ms
[2021-05-11 20:41:26] [INFO ] Flatten gal took : 19 ms
[2021-05-11 20:41:26] [INFO ] Input system was already deterministic with 204 transitions.
[2021-05-11 20:41:26] [INFO ] Flatten gal took : 24 ms
[2021-05-11 20:41:26] [INFO ] Flatten gal took : 15 ms
[2021-05-11 20:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8971452333017246561.gal : 11 ms
[2021-05-11 20:41:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9058977369541043867.ctl : 2 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/CTLFireability8971452333017246561.gal, -t, CGAL, -ctl, /tmp/CTLFireability9058977369541043867.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/CTLFireability8971452333017246561.gal -t CGAL -ctl /tmp/CTLFireability9058977369541043867.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,2.22276e+10,2.08362,69804,2,26254,5,216997,6,0,1177,206747,0


Converting to forward existential form...Done !
original formula: EF((AG((((((((((((((p214==1)&&(p427==1))&&(p629==1))||(p569==1))||(((p196==1)&&(p427==1))&&(p629==1)))||(p176==1))||(p101==1))||(((p180==1)&&(p417==1))&&(p620==1)))||(p84==1))||(p165==1))||(((p190==1)&&(p417==1))&&(p576==1)))||(p299==1)) * E((((((((p469==1)||(p134==1))||(p219==1))||(p24==1))||(p107==1))||(((p193==1)&&(p422==1))&&(p623==1)))||(((p46==1)&&(p341==1))&&(p603==1))) U ((p484==1)&&((p375==1)||(p10==1)))))) * !(A((((p35==1)&&(p297==1))&&(p476==1)) U (((((((AF(((((((((((p522==1)||(((p199==1)&&(p417==1))&&(p576==1)))||(p279==1))||(p450==1))||(p182==1))||(p107==1))||(p253==1))||(p152==1))||(p174==1))||(p631==1))) + (p523==1)) + (p55==1)) + ((p206==1)&&(p209==1))) + (p5==1)) + (p252==1)) + (p124==1)) + ((((p600==1)||((p633==1)&&(p636==1)))||(p237==1))&&(((((((((p199==1)&&(p417==1))&&(p611==1))||(((p238==1)&&(p447==1))&&(p599==1)))||(((p60==1)&&(p332==1))&&(p500==1)))||(p528==1))||(((p142==1)&&(p382==1))&&(p548==1)))||(((p148==1)&&(p377==1))&&(p552==1)))||(p267==1))))))))
=> equivalent forward existential formula: ([FwdG(((((((((FwdU((FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((p214==1)&&(p427==1))&&(p629==1))||(p569==1))||(((p196==1)&&(p427==1))&&(p629==1)))||(p176==1))||(p101==1))||(((p180==1)&&(p417==1))&&(p620==1)))||(p84==1))||(p165==1))||(((p190==1)&&(p417==1))&&(p576==1)))||(p299==1)) * E((((((((p469==1)||(p134==1))||(p219==1))||(p24==1))||(p107==1))||(((p193==1)&&(p422==1))&&(p623==1)))||(((p46==1)&&(p341==1))&&(p603==1))) U ((p484==1)&&((p375==1)||(p10==1))))))))),!((((((((!(EG(!(((((((((((p522==1)||(((p199==1)&&(p417==1))&&(p576==1)))||(p279==1))||(p450==1))||(p182==1))||(p107==1))||(p253==1))||(p152==1))||(p174==1))||(p631==1))))) + (p523==1)) + (p55==1)) + ((p206==1)&&(p209==1))) + (p5==1)) + (p252==1)) + (p124==1)) + ((((p600==1)||((p633==1)&&(p636==1)))||(p237==1))&&(((((((((p199==1)&&(p417==1))&&(p611==1))||(((p238==1)&&(p447==1))&&(p599==1)))||(((p60==1)&&(p332==1))&&(p500==1)))||(p528==1))||(((p142==1)&&(p382==1))&&(p548==1)))||(((p148==1)&&(p377==1))&&(p552==1)))||(p267==1)))))) * !((((p35==1)&&(p297==1))&&(p476==1)))) * !(((((p600==1)||((p633==1)&&(p636==1)))||(p237==1))&&(((((((((p199==1)&&(p417==1))&&(p611==1))||(((p238==1)&&(p447==1))&&(p599==1)))||(((p60==1)&&(p332==1))&&(p500==1)))||(p528==1))||(((p142==1)&&(p382==1))&&(p548==1)))||(((p148==1)&&(p377==1))&&(p552==1)))||(p267==1))))) * !((p124==1))) * !((p252==1))) * !((p5==1))) * !(((p206==1)&&(p209==1)))) * !((p55==1))) * !((p523==1))),!(((((((((((p522==1)||(((p199==1)&&(p417==1))&&(p576==1)))||(p279==1))||(p450==1))||(p182==1))||(p107==1))||(p253==1))||(p152==1))||(p174==1))||(p631==1))))] != FALSE + [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((p214==1)&&(p427==1))&&(p629==1))||(p569==1))||(((p196==1)&&(p427==1))&&(p629==1)))||(p176==1))||(p101==1))||(((p180==1)&&(p417==1))&&(p620==1)))||(p84==1))||(p165==1))||(((p190==1)&&(p417==1))&&(p576==1)))||(p299==1)) * E((((((((p469==1)||(p134==1))||(p219==1))||(p24==1))||(p107==1))||(((p193==1)&&(p422==1))&&(p623==1)))||(((p46==1)&&(p341==1))&&(p603==1))) U ((p484==1)&&((p375==1)||(p10==1))))))))),!((((((((!(EG(!(((((((((((p522==1)||(((p199==1)&&(p417==1))&&(p576==1)))||(p279==1))||(p450==1))||(p182==1))||(p107==1))||(p253==1))||(p152==1))||(p174==1))||(p631==1))))) + (p523==1)) + (p55==1)) + ((p206==1)&&(p209==1))) + (p5==1)) + (p252==1)) + (p124==1)) + ((((p600==1)||((p633==1)&&(p636==1)))||(p237==1))&&(((((((((p199==1)&&(p417==1))&&(p611==1))||(((p238==1)&&(p447==1))&&(p599==1)))||(((p60==1)&&(p332==1))&&(p500==1)))||(p528==1))||(((p142==1)&&(p382==1))&&(p548==1)))||(((p148==1)&&(p377==1))&&(p552==1)))||(p267==1))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t14, t15, t17, t18, t19, t22, t23, t28, t31, t36, t38, t39, t41, t97, t104, t107, t110, t111, t114, t116, t117, t118, t119, t120, t121, t123, t128, t129, t134, t148, t149, t150, t151, t153, t154, t155, t157, t160, t163, t164, t170, t179, t180, t181, t182, t196, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/120/48/204
Detected timeout of ITS tools.
[2021-05-11 20:41:56] [INFO ] Flatten gal took : 31 ms
[2021-05-11 20:41:56] [INFO ] Applying decomposition
[2021-05-11 20:41:56] [INFO ] Flatten gal took : 30 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/graph6985287904169567942.txt, -o, /tmp/graph6985287904169567942.bin, -w, /tmp/graph6985287904169567942.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/graph6985287904169567942.bin, -l, -1, -v, -w, /tmp/graph6985287904169567942.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:41:56] [INFO ] Decomposing Gal with order
[2021-05-11 20:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:41:56] [INFO ] Removed a total of 145 redundant transitions.
[2021-05-11 20:41:56] [INFO ] Flatten gal took : 56 ms
[2021-05-11 20:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2021-05-11 20:41:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9129067241743562732.gal : 6 ms
[2021-05-11 20:41:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5439222974277459087.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/CTLFireability9129067241743562732.gal, -t, CGAL, -ctl, /tmp/CTLFireability5439222974277459087.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/CTLFireability9129067241743562732.gal -t CGAL -ctl /tmp/CTLFireability5439222974277459087.ctl
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,2.22276e+10,0.634894,26096,1262,659,34065,18681,808,58840,194,66735,0


Converting to forward existential form...Done !
original formula: EF((AG((((((((((((((u53.p214==1)&&(u53.p427==1))&&(u53.p629==1))||(i7.u68.p569==1))||(((u53.p196==1)&&(u53.p427==1))&&(u53.p629==1)))||(i7.u18.p176==1))||(i3.u11.p101==1))||(((i7.u70.p180==1)&&(i7.u51.p417==1))&&(i7.u68.p620==1)))||(i6.i1.u10.p84==1))||(i2.u17.p165==1))||(((i7.u19.p190==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i4.i2.u32.p299==1)) * E((((((((i10.i1.u72.p469==1)||(i6.i0.u13.p134==1))||(i1.u22.p219==1))||(i5.i1.u2.p24==1))||(i3.u11.p107==1))||(((u52.p193==1)&&(u52.p422==1))&&(u52.p623==1)))||(((i5.i3.u5.p46==1)&&(i5.i3.u38.p341==1))&&(i10.i1.u72.p603==1))) U ((i10.i1.u72.p484==1)&&((i12.u45.p375==1)||(i1.u1.p10==1)))))) * !(A((((i4.i0.u3.p35==1)&&(i4.i1.u31.p297==1))&&(i4.i0.u59.p476==1)) U (((((((AF(((((((((((i10.i1.u72.p522==1)||(((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i5.i2.u39.p279==1))||(i0.i0.u58.p450==1))||(u52.p182==1))||(i3.u11.p107==1))||(i0.i1.u28.p253==1))||(i4.i1.u16.p152==1))||(i7.u18.p174==1))||(u53.p631==1))) + (i10.i1.u62.p523==1)) + (i5.i0.u6.p55==1)) + ((i7.u21.p206==1)&&(u53.p209==1))) + (i0.i1.u0.p5==1)) + (i0.i1.u27.p252==1)) + (i6.i2.u12.p124==1)) + ((((i0.i0.u71.p600==1)||((u52.p633==1)&&(u53.p636==1)))||(i0.i0.u25.p237==1))&&(((((((((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u73.p611==1))||(((i0.i0.u26.p238==1)&&(i0.i2.u57.p447==1))&&(i0.i0.u71.p599==1)))||(((i5.i0.u7.p60==1)&&(i2.u36.p332==1))&&(i5.i0.u60.p500==1)))||(i10.i1.u72.p528==1))||(((i11.u14.p142==1)&&(i11.u46.p382==1))&&(i11.u65.p548==1)))||(((i12.u15.p148==1)&&(i12.u45.p377==1))&&(i12.u66.p552==1)))||(i6.i0.u29.p267==1))))))))
=> equivalent forward existential formula: ([FwdG(((((((((FwdU((FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((u53.p214==1)&&(u53.p427==1))&&(u53.p629==1))||(i7.u68.p569==1))||(((u53.p196==1)&&(u53.p427==1))&&(u53.p629==1)))||(i7.u18.p176==1))||(i3.u11.p101==1))||(((i7.u70.p180==1)&&(i7.u51.p417==1))&&(i7.u68.p620==1)))||(i6.i1.u10.p84==1))||(i2.u17.p165==1))||(((i7.u19.p190==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i4.i2.u32.p299==1)) * E((((((((i10.i1.u72.p469==1)||(i6.i0.u13.p134==1))||(i1.u22.p219==1))||(i5.i1.u2.p24==1))||(i3.u11.p107==1))||(((u52.p193==1)&&(u52.p422==1))&&(u52.p623==1)))||(((i5.i3.u5.p46==1)&&(i5.i3.u38.p341==1))&&(i10.i1.u72.p603==1))) U ((i10.i1.u72.p484==1)&&((i12.u45.p375==1)||(i1.u1.p10==1))))))))),!((((((((!(EG(!(((((((((((i10.i1.u72.p522==1)||(((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i5.i2.u39.p279==1))||(i0.i0.u58.p450==1))||(u52.p182==1))||(i3.u11.p107==1))||(i0.i1.u28.p253==1))||(i4.i1.u16.p152==1))||(i7.u18.p174==1))||(u53.p631==1))))) + (i10.i1.u62.p523==1)) + (i5.i0.u6.p55==1)) + ((i7.u21.p206==1)&&(u53.p209==1))) + (i0.i1.u0.p5==1)) + (i0.i1.u27.p252==1)) + (i6.i2.u12.p124==1)) + ((((i0.i0.u71.p600==1)||((u52.p633==1)&&(u53.p636==1)))||(i0.i0.u25.p237==1))&&(((((((((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u73.p611==1))||(((i0.i0.u26.p238==1)&&(i0.i2.u57.p447==1))&&(i0.i0.u71.p599==1)))||(((i5.i0.u7.p60==1)&&(i2.u36.p332==1))&&(i5.i0.u60.p500==1)))||(i10.i1.u72.p528==1))||(((i11.u14.p142==1)&&(i11.u46.p382==1))&&(i11.u65.p548==1)))||(((i12.u15.p148==1)&&(i12.u45.p377==1))&&(i12.u66.p552==1)))||(i6.i0.u29.p267==1)))))) * !((((i4.i0.u3.p35==1)&&(i4.i1.u31.p297==1))&&(i4.i0.u59.p476==1)))) * !(((((i0.i0.u71.p600==1)||((u52.p633==1)&&(u53.p636==1)))||(i0.i0.u25.p237==1))&&(((((((((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u73.p611==1))||(((i0.i0.u26.p238==1)&&(i0.i2.u57.p447==1))&&(i0.i0.u71.p599==1)))||(((i5.i0.u7.p60==1)&&(i2.u36.p332==1))&&(i5.i0.u60.p500==1)))||(i10.i1.u72.p528==1))||(((i11.u14.p142==1)&&(i11.u46.p382==1))&&(i11.u65.p548==1)))||(((i12.u15.p148==1)&&(i12.u45.p377==1))&&(i12.u66.p552==1)))||(i6.i0.u29.p267==1))))) * !((i6.i2.u12.p124==1))) * !((i0.i1.u27.p252==1))) * !((i0.i1.u0.p5==1))) * !(((i7.u21.p206==1)&&(u53.p209==1)))) * !((i5.i0.u6.p55==1))) * !((i10.i1.u62.p523==1))),!(((((((((((i10.i1.u72.p522==1)||(((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i5.i2.u39.p279==1))||(i0.i0.u58.p450==1))||(u52.p182==1))||(i3.u11.p107==1))||(i0.i1.u28.p253==1))||(i4.i1.u16.p152==1))||(i7.u18.p174==1))||(u53.p631==1))))] != FALSE + [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((u53.p214==1)&&(u53.p427==1))&&(u53.p629==1))||(i7.u68.p569==1))||(((u53.p196==1)&&(u53.p427==1))&&(u53.p629==1)))||(i7.u18.p176==1))||(i3.u11.p101==1))||(((i7.u70.p180==1)&&(i7.u51.p417==1))&&(i7.u68.p620==1)))||(i6.i1.u10.p84==1))||(i2.u17.p165==1))||(((i7.u19.p190==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i4.i2.u32.p299==1)) * E((((((((i10.i1.u72.p469==1)||(i6.i0.u13.p134==1))||(i1.u22.p219==1))||(i5.i1.u2.p24==1))||(i3.u11.p107==1))||(((u52.p193==1)&&(u52.p422==1))&&(u52.p623==1)))||(((i5.i3.u5.p46==1)&&(i5.i3.u38.p341==1))&&(i10.i1.u72.p603==1))) U ((i10.i1.u72.p484==1)&&((i12.u45.p375==1)||(i1.u1.p10==1))))))))),!((((((((!(EG(!(((((((((((i10.i1.u72.p522==1)||(((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u70.p576==1)))||(i5.i2.u39.p279==1))||(i0.i0.u58.p450==1))||(u52.p182==1))||(i3.u11.p107==1))||(i0.i1.u28.p253==1))||(i4.i1.u16.p152==1))||(i7.u18.p174==1))||(u53.p631==1))))) + (i10.i1.u62.p523==1)) + (i5.i0.u6.p55==1)) + ((i7.u21.p206==1)&&(u53.p209==1))) + (i0.i1.u0.p5==1)) + (i0.i1.u27.p252==1)) + (i6.i2.u12.p124==1)) + ((((i0.i0.u71.p600==1)||((u52.p633==1)&&(u53.p636==1)))||(i0.i0.u25.p237==1))&&(((((((((i7.u20.p199==1)&&(i7.u51.p417==1))&&(i7.u73.p611==1))||(((i0.i0.u26.p238==1)&&(i0.i2.u57.p447==1))&&(i0.i0.u71.p599==1)))||(((i5.i0.u7.p60==1)&&(i2.u36.p332==1))&&(i5.i0.u60.p500==1)))||(i10.i1.u72.p528==1))||(((i11.u14.p142==1)&&(i11.u46.p382==1))&&(i11.u65.p548==1)))||(((i12.u15.p148==1)&&(i12.u45.p377==1))&&(i12.u66.p552==1)))||(i6.i0.u29.p267==1))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t56, t97, t104, t107, t110, t117, t128, t129, t149, t150, t151, t153, t155, t160, t164, t170, t180, t181, t182, t196, i0.i0.u25.t119, i0.i0.u58.t19, i0.i1.u27.t120, i1.u22.t118, i2.u17.t116, i3.u11.t41, i4.t179, i4.i1.u16.t36, i4.i2.u32.t121, i5.t154, i5.i0.u6.t114, i5.i2.u39.t23, i5.i3.u5.t123, i6.i0.u13.t38, i6.i1.u10.t163, i6.i2.u12.t39, i7.u18.t28, i7.u18.t31, i10.i1.t14, i10.i1.t157, i10.i1.u72.t12, i10.i1.u72.t15, i10.i1.u72.t17, i10.i1.u72.t18, i10.i1.u72.t148, i12.u45.t22, i12.u45.t134, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :29/119/48/196
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,3.6304,103768,1,0,189417,23639,4598,324417,1538,133341,306441
FORMULA BusinessProcesses-PT-16-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Graph (trivial) has 336 edges and 603 vertex of which 7 / 603 are part of one of the 1 SCC in 3 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 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 596 transition count 420
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 476 transition count 420
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 241 place count 476 transition count 326
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 445 place count 366 transition count 326
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 526 place count 285 transition count 245
Iterating global reduction 2 with 81 rules applied. Total rules applied 607 place count 285 transition count 245
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 607 place count 285 transition count 239
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 622 place count 276 transition count 239
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 812 place count 180 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 814 place count 179 transition count 149
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 819 place count 179 transition count 149
Applied a total of 819 rules in 61 ms. Remains 179 /603 variables (removed 424) and now considering 149/548 (removed 399) transitions.
[2021-05-11 20:42:00] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:42:00] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:42:00] [INFO ] Input system was already deterministic with 149 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA BusinessProcesses-PT-16-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 602 transition count 474
Reduce places removed 73 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 78 rules applied. Total rules applied 151 place count 529 transition count 469
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 524 transition count 469
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 156 place count 524 transition count 366
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 376 place count 407 transition count 366
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 443 place count 340 transition count 299
Iterating global reduction 3 with 67 rules applied. Total rules applied 510 place count 340 transition count 299
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 510 place count 340 transition count 296
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 518 place count 335 transition count 296
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 672 place count 258 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 674 place count 257 transition count 223
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 679 place count 257 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 680 place count 256 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 681 place count 255 transition count 222
Applied a total of 681 rules in 70 ms. Remains 255 /603 variables (removed 348) and now considering 222/548 (removed 326) transitions.
[2021-05-11 20:42:00] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:42:00] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:42:00] [INFO ] Input system was already deterministic with 222 transitions.
[2021-05-11 20:42:00] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:42:00] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:42:00] [INFO ] Time to serialize gal into /tmp/CTLFireability895240970834744576.gal : 1 ms
[2021-05-11 20:42:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13466938562785092136.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/CTLFireability895240970834744576.gal, -t, CGAL, -ctl, /tmp/CTLFireability13466938562785092136.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/CTLFireability895240970834744576.gal -t CGAL -ctl /tmp/CTLFireability13466938562785092136.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,2.25569e+10,1.50507,47084,2,31520,5,124639,6,0,1242,163327,0


Converting to forward existential form...Done !
original formula: (!(A(((((((p359==1)||(p98==1))||(p100==1))||(p23==1))||(p459==1))||(p283==1)) U ((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(AF(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1)))) + (AF((((((((p600==0)&&(((p211==0)||(p422==0))||(p623==0)))&&(p284==0))&&(((p202==0)||(p422==0))||(p623==0)))&&(p563==0))&&(p303==0))&&(p363==0))) * (!(AG(((((((((p133==0)||(p406==0))||(p603==0))&&(p418==0))&&(p230==0))&&((p605==0)||(p608==0)))&&(p511==0))&&(((p142==0)||(p382==0))||(p548==0))))) + !(E((((p540==0)&&(((p51==0)||(p337==0))||(p491==0))) + !(AF(((((((p135==1)||(p400==1))||(p449==1))||(((p211==1)&&(p422==1))&&(p632==1)))||(p265==1))||(p237==1))))) U AG(EF((((((((p293==1)||(p403==1))||(p385==1))||(p284==1))||(p303==1))||(p597==1))||(p581==1)))))))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(!((E(!(((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(!(EG(!(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1))) U (!(((((((p359==1)||(p98==1))||(p100==1))||(p23==1))||(p459==1))||(p283==1))) * !(((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(!(EG(!(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1))))) + EG(!(((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(!(EG(!(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1))))))))),!((((((((p600==0)&&(((p211==0)||(p422==0))||(p623==0)))&&(p284==0))&&(((p202==0)||(p422==0))||(p623==0)))&&(p563==0))&&(p303==0))&&(p363==0))))] = FALSE * [(FwdU(((Init * !(!(!((E(!(((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(!(EG(!(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1))) U (!(((((((p359==1)||(p98==1))||(p100==1))||(p23==1))||(p459==1))||(p283==1))) * !(((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(!(EG(!(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1))))) + EG(!(((((((((((((((p423==0)&&(((p193==0)||(p422==0))||(p632==0)))&&(((p214==0)||(p427==0))||(p582==0)))&&(p450==0))&&(p363==0)) + !(!(EG(!(((((((((p163==1)&&(p331==1))&&(p603==1))||(((p51==1)&&(p337==1))&&(p491==1)))||(p606==1))||(p24==1))||(p26==1))||(p378==1))))))) * (((((p16==0)&&(p147==0))&&(p523==0))&&(p132==0))||(((p118==0)&&(((p214==0)||(p427==0))||(p617==0)))&&(p456==0)))) + (p177==1)) + (p555==1)) + (((p211==1)&&(p422==1))&&(p623==1))) + (p365==1)) + (p122==1)) + (p92==1)) + (p424==1))))))))) * !(!(!(E(TRUE U !(((((((((p133==0)||(p406==0))||(p603==0))&&(p418==0))&&(p230==0))&&((p605==0)||(p608==0)))&&(p511==0))&&(((p142==0)||(p382==0))||(p548==0))))))))),(((p540==0)&&(((p51==0)||(p337==0))||(p491==0))) + !(!(EG(!(((((((p135==1)||(p400==1))||(p449==1))||(((p211==1)&&(p422==1))&&(p632==1)))||(p265==1))||(p237==1)))))))) * !(E(TRUE U !(E(TRUE U (((((((p293==1)||(p403==1))||(p385==1))||(p284==1))||(p303==1))||(p597==1))||(p581==1)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t5, t8, t9, t16, t18, t23, t25, t26, t29, t30, t33, t35, t36, t37, t40, t41, t43, t44, t50, t56, t59, t65, t66, t116, t117, t119, t125, t126, t127, t129, t131, t132, t133, t134, t135, t146, t147, t148, t149, t151, t153, t155, t165, t177, t181, t183, t184, t185, t203, t205, t206, t207, t208, t211, t212, t215, t216, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/127/59/222
Detected timeout of ITS tools.
[2021-05-11 20:42:30] [INFO ] Flatten gal took : 21 ms
[2021-05-11 20:42:30] [INFO ] Applying decomposition
[2021-05-11 20:42:30] [INFO ] Flatten gal took : 18 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/graph12904212423296745961.txt, -o, /tmp/graph12904212423296745961.bin, -w, /tmp/graph12904212423296745961.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/graph12904212423296745961.bin, -l, -1, -v, -w, /tmp/graph12904212423296745961.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:42:30] [INFO ] Decomposing Gal with order
[2021-05-11 20:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:42:30] [INFO ] Removed a total of 151 redundant transitions.
[2021-05-11 20:42:30] [INFO ] Flatten gal took : 20 ms
[2021-05-11 20:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2021-05-11 20:42:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4770461071935050258.gal : 4 ms
[2021-05-11 20:42:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2400184300078528260.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/CTLFireability4770461071935050258.gal, -t, CGAL, -ctl, /tmp/CTLFireability2400184300078528260.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/CTLFireability4770461071935050258.gal -t CGAL -ctl /tmp/CTLFireability2400184300078528260.ctl
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,2.25569e+10,0.24976,15088,1868,567,20842,2518,824,26209,190,4785,0


Converting to forward existential form...Done !
original formula: (!(A(((((((i13.u40.p359==1)||(i1.u10.p98==1))||(i1.u10.p100==1))||(i14.i0.u1.p23==1))||(i15.u63.p459==1))||(i5.u29.p283==1)) U ((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(AF(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1)))) + (AF((((((((i6.i1.u74.p600==0)&&(((i10.u54.p211==0)||(i10.u54.p422==0))||(i10.u54.p623==0)))&&(i5.u29.p284==0))&&(((i10.u54.p202==0)||(i10.u54.p422==0))||(i10.u54.p623==0)))&&(i15.u75.p563==0))&&(i12.i0.u32.p303==0))&&(i13.u40.p363==0))) * (!(AG(((((((((i3.u16.p133==0)||(i3.u50.p406==0))||(i15.u75.p603==0))&&(i9.u53.p418==0))&&(i6.i0.u26.p230==0))&&((i7.i0.u76.p605==0)||(i3.u77.p608==0)))&&(i15.u65.p511==0))&&(((i8.i0.u18.p142==0)||(i8.i0.u44.p382==0))||(i8.i0.u69.p548==0))))) + !(E((((i7.i0.u68.p540==0)&&(((i0.i0.u5.p51==0)||(i0.i1.u35.p337==0))||(i0.i0.u64.p491==0))) + !(AF(((((((i3.u16.p135==1)||(i7.i1.u48.p400==1))||(i6.i1.u61.p449==1))||(((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p632==1)))||(i3.u28.p265==1))||(i6.i1.u27.p237==1))))) U AG(EF((((((((i5.u30.p293==1)||(i7.i1.u49.p403==1))||(i1.u45.p385==1))||(i5.u29.p284==1))||(i12.i0.u32.p303==1))||(i15.u73.p597==1))||(i15.u75.p581==1)))))))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(!((E(!(((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(!(EG(!(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1))) U (!(((((((i13.u40.p359==1)||(i1.u10.p98==1))||(i1.u10.p100==1))||(i14.i0.u1.p23==1))||(i15.u63.p459==1))||(i5.u29.p283==1))) * !(((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(!(EG(!(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1))))) + EG(!(((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(!(EG(!(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1))))))))),!((((((((i6.i1.u74.p600==0)&&(((i10.u54.p211==0)||(i10.u54.p422==0))||(i10.u54.p623==0)))&&(i5.u29.p284==0))&&(((i10.u54.p202==0)||(i10.u54.p422==0))||(i10.u54.p623==0)))&&(i15.u75.p563==0))&&(i12.i0.u32.p303==0))&&(i13.u40.p363==0))))] = FALSE * [(FwdU(((Init * !(!(!((E(!(((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(!(EG(!(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1))) U (!(((((((i13.u40.p359==1)||(i1.u10.p98==1))||(i1.u10.p100==1))||(i14.i0.u1.p23==1))||(i15.u63.p459==1))||(i5.u29.p283==1))) * !(((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(!(EG(!(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1))))) + EG(!(((((((((((((((i10.u55.p423==0)&&(((i10.u54.p193==0)||(i10.u54.p422==0))||(i10.u54.p632==0)))&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u71.p582==0)))&&(i6.i1.u61.p450==0))&&(i13.u40.p363==0)) + !(!(EG(!(((((((((i13.u21.p163==1)&&(i0.i0.u34.p331==1))&&(i15.u75.p603==1))||(((i0.i0.u5.p51==1)&&(i0.i1.u35.p337==1))&&(i0.i0.u64.p491==1)))||(i7.i0.u76.p606==1))||(i14.i0.u1.p24==1))||(i0.i0.u2.p26==1))||(i4.u43.p378==1))))))) * (((((i8.i0.u0.p16==0)&&(i4.u19.p147==0))&&(i15.u67.p523==0))&&(i7.i0.u15.p132==0))||(((i2.u12.p118==0)&&(((i11.u22.p214==0)||(i11.u56.p427==0))||(i11.u78.p617==0)))&&(i15.u62.p456==0)))) + (i11.u22.p177==1)) + (i15.u75.p555==1)) + (((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p623==1))) + (i14.i1.u41.p365==1)) + (i2.u13.p122==1)) + (i8.i0.u9.p92==1)) + (i11.u56.p424==1))))))))) * !(!(!(E(TRUE U !(((((((((i3.u16.p133==0)||(i3.u50.p406==0))||(i15.u75.p603==0))&&(i9.u53.p418==0))&&(i6.i0.u26.p230==0))&&((i7.i0.u76.p605==0)||(i3.u77.p608==0)))&&(i15.u65.p511==0))&&(((i8.i0.u18.p142==0)||(i8.i0.u44.p382==0))||(i8.i0.u69.p548==0))))))))),(((i7.i0.u68.p540==0)&&(((i0.i0.u5.p51==0)||(i0.i1.u35.p337==0))||(i0.i0.u64.p491==0))) + !(!(EG(!(((((((i3.u16.p135==1)||(i7.i1.u48.p400==1))||(i6.i1.u61.p449==1))||(((i10.u54.p211==1)&&(i10.u54.p422==1))&&(i10.u54.p632==1)))||(i3.u28.p265==1))||(i6.i1.u27.p237==1)))))))) * !(E(TRUE U !(E(TRUE U (((((((i5.u30.p293==1)||(i7.i1.u49.p403==1))||(i1.u45.p385==1))||(i5.u29.p284==1))||(i12.i0.u32.p303==1))||(i15.u73.p597==1))||(i15.u75.p581==1)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t65, t116, t117, t119, t122, t132, t133, t134, t135, t146, t147, t148, t149, t151, t153, t155, t165, t181, t183, t194, t212, t216, i0.i0.t66, i1.u10.t205, i1.u10.t206, i1.u10.t207, i1.u10.t208, i1.u45.t37, i2.u12.t59, i3.u16.t56, i4.u19.t125, i4.u43.t40, i5.u29.t44, i5.u29.t185, i6.i0.u26.t50, i6.i1.u27.t126, i6.i1.u61.t25, i6.i1.u61.t127, i7.i0.t129, i7.i1.t35, i7.i1.u48.t36, i9.t33, i10.t29, i10.u54.t30, i11.u56.t26, i13.u21.t131, i13.u40.t43, i14.i1.u41.t41, i15.t177, i15.t23, i15.t18, i15.t16, i15.t4, i15.u75.t5, i15.u75.t8, i15.u75.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/121/57/203
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,11.0099,374248,1,0,794706,7862,4532,962613,1439,15477,1173236
FORMULA BusinessProcesses-PT-16-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Graph (trivial) has 319 edges and 603 vertex of which 7 / 603 are part of one of the 1 SCC in 0 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 596 transition count 430
Reduce places removed 110 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 114 rules applied. Total rules applied 225 place count 486 transition count 426
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 229 place count 482 transition count 426
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 229 place count 482 transition count 338
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 421 place count 378 transition count 338
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 491 place count 308 transition count 268
Iterating global reduction 3 with 70 rules applied. Total rules applied 561 place count 308 transition count 268
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 561 place count 308 transition count 262
Deduced a syphon composed of 6 places in 0 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 575 place count 300 transition count 262
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 769 place count 202 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 771 place count 201 transition count 170
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 777 place count 201 transition count 170
Applied a total of 777 rules in 53 ms. Remains 201 /603 variables (removed 402) and now considering 170/548 (removed 378) transitions.
[2021-05-11 20:42:41] [INFO ] Flatten gal took : 7 ms
[2021-05-11 20:42:41] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:42:41] [INFO ] Input system was already deterministic with 170 transitions.
[2021-05-11 20:42:41] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:42:41] [INFO ] Flatten gal took : 7 ms
[2021-05-11 20:42:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15147324488399279582.gal : 1 ms
[2021-05-11 20:42:41] [INFO ] Time to serialize properties into /tmp/CTLFireability18388407406123367204.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/CTLFireability15147324488399279582.gal, -t, CGAL, -ctl, /tmp/CTLFireability18388407406123367204.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/CTLFireability15147324488399279582.gal -t CGAL -ctl /tmp/CTLFireability18388407406123367204.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,5.07609e+06,0.514067,25896,2,12407,5,57935,6,0,973,67559,0


Converting to forward existential form...Done !
original formula: E(EF((((((EG(((p616==0)||((((((((p585==0)&&(p178==0))&&(p374==0))&&(p468==0))&&(p555==0))&&(p152==0))&&(p303==0))&&(((p211==0)||(p422==0))||(p632==0))))) + (p403==1)) + (p39==1)) + (p448==1)) + (p264==1)) + (p172==1))) U EF(((((((p195==1)||(p240==1))||(p68==1))||(p181==1))||(p440==1))||(((p205==1)&&(p417==1))&&(p576==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,E(TRUE U (((((EG(((p616==0)||((((((((p585==0)&&(p178==0))&&(p374==0))&&(p468==0))&&(p555==0))&&(p152==0))&&(p303==0))&&(((p211==0)||(p422==0))||(p632==0))))) + (p403==1)) + (p39==1)) + (p448==1)) + (p264==1)) + (p172==1)))),TRUE) * ((((((p195==1)||(p240==1))||(p68==1))||(p181==1))||(p440==1))||(((p205==1)&&(p417==1))&&(p576==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t10, t11, t14, t18, t20, t23, t26, t68, t71, t73, t75, t76, t77, t78, t80, t81, t87, t88, t89, t90, t91, t107, t108, t127, t134, t146, t154, t155, t156, t157, t158, t159, t162, t163, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/98/36/170
(forward)formula 0,1,19.2913,622000,1,0,442,3.07824e+06,337,217,7616,2.77981e+06,535
FORMULA BusinessProcesses-PT-16-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 602 transition count 467
Reduce places removed 80 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 84 rules applied. Total rules applied 164 place count 522 transition count 463
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 168 place count 518 transition count 463
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 127 Pre rules applied. Total rules applied 168 place count 518 transition count 336
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 438 place count 375 transition count 336
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 517 place count 296 transition count 257
Iterating global reduction 3 with 79 rules applied. Total rules applied 596 place count 296 transition count 257
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 596 place count 296 transition count 251
Deduced a syphon composed of 6 places in 0 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 610 place count 288 transition count 251
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 800 place count 192 transition count 157
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 192 transition count 156
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 807 place count 192 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 808 place count 191 transition count 155
Applied a total of 808 rules in 46 ms. Remains 191 /603 variables (removed 412) and now considering 155/548 (removed 393) transitions.
[2021-05-11 20:43:01] [INFO ] Flatten gal took : 6 ms
[2021-05-11 20:43:01] [INFO ] Flatten gal took : 7 ms
[2021-05-11 20:43:01] [INFO ] Input system was already deterministic with 155 transitions.
[2021-05-11 20:43:01] [INFO ] Flatten gal took : 6 ms
[2021-05-11 20:43:01] [INFO ] Flatten gal took : 6 ms
[2021-05-11 20:43:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7262482072276598993.gal : 1 ms
[2021-05-11 20:43:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15877822588587921619.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/CTLFireability7262482072276598993.gal, -t, CGAL, -ctl, /tmp/CTLFireability15877822588587921619.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/CTLFireability7262482072276598993.gal -t CGAL -ctl /tmp/CTLFireability15877822588587921619.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,2.70933e+06,0.325456,19712,2,7859,5,50069,6,0,919,48420,0


Converting to forward existential form...Done !
original formula: AG((AF(EG((((((((p101==1)||(((p106==1)&&(p386==1))&&(p603==1)))||(p71==1))||(p107==1))||(((p232==1)&&(p357==1))&&(p595==1)))||(p550==1))||(((p196==1)&&(p427==1))&&(p617==1))))) + (((((((p571==0)&&(p52==0))&&(p512==0))&&(p364==0))&&(p250==0))&&(((p229==0)||(p446==0))||(p603==0)))&&(((p96==0)||(p372==0))||(p464==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((((((p571==0)&&(p52==0))&&(p512==0))&&(p364==0))&&(p250==0))&&(((p229==0)||(p446==0))||(p603==0)))&&(((p96==0)||(p372==0))||(p464==0))))),!(EG((((((((p101==1)||(((p106==1)&&(p386==1))&&(p603==1)))||(p71==1))||(p107==1))||(((p232==1)&&(p357==1))&&(p595==1)))||(p550==1))||(((p196==1)&&(p427==1))&&(p617==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t8, t36, t37, t50, t54, t55, t57, t58, t59, t60, t61, t62, t71, t72, t73, t74, t75, t99, t100, t103, t113, t123, t129, t146, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/92/27/155
(forward)formula 0,0,7.82494,269576,1,0,333,1.28025e+06,302,161,6886,1.29729e+06,386
FORMULA BusinessProcesses-PT-16-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2021-05-11 20:43:09] [INFO ] Flatten gal took : 54 ms
[2021-05-11 20:43:09] [INFO ] Flatten gal took : 26 ms
[2021-05-11 20:43:09] [INFO ] Applying decomposition
[2021-05-11 20:43:09] [INFO ] Flatten gal took : 22 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/graph1354420670985820681.txt, -o, /tmp/graph1354420670985820681.bin, -w, /tmp/graph1354420670985820681.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/graph1354420670985820681.bin, -l, -1, -v, -w, /tmp/graph1354420670985820681.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:43:09] [INFO ] Decomposing Gal with order
[2021-05-11 20:43:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:43:09] [INFO ] Removed a total of 278 redundant transitions.
[2021-05-11 20:43:09] [INFO ] Flatten gal took : 49 ms
[2021-05-11 20:43:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-11 20:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10038684554475832316.gal : 8 ms
[2021-05-11 20:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3567819742233299860.ctl : 3 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/CTLFireability10038684554475832316.gal, -t, CGAL, -ctl, /tmp/CTLFireability3567819742233299860.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/CTLFireability10038684554475832316.gal -t CGAL -ctl /tmp/CTLFireability3567819742233299860.ctl
No direction supplied, using forward translation only.
Parsed 11 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.70656e+27,44.8748,982032,57151,94,1.53438e+06,1046,1201,3.09142e+06,88,2341,0


Converting to forward existential form...Done !
original formula: E((!(AX(((((((((((((((((((((i17.u82.p206==0)||(i17.u83.p209==0))&&(i5.u8.p18==0))&&(i5.u199.p538==0))&&(i17.u214.p573==0))&&(((i14.u89.p226==0)||(i14.u128.p347==0))||(i14.u221.p591==0)))&&(i19.u209.p558==0))&&(i5.u48.p116==0))&&(i14.u138.p370==0))&&(i1.u65.p165==0))&&(i2.u177.p472==0))&&(i4.u27.p64==0))&&(i15.u64.p161==0))&&(i19.u192.p523==0))&&(i4.u36.p84==0))&&(i4.u10.p23==0))&&(i5.u45.p104==0))&&(i1.u86.p218==0))&&(i15.u5.p12==0))&&(i7.i0.i1.u92.p236==0)))) + ((((((i7.i0.i1.u2.p4==0)&&(i12.u23.p54==0))&&(i4.u37.p89==0))&&(i5.u45.p105==0))&&(i15.u63.p159==0))&&(i6.u6.p15==0))) U ((((!(A(((((((((((((((((((((((i10.u110.p289==1)||(i11.u107.p284==1))||(i7.i1.i2.u166.p444==1))||((i8.u53.p128==1)&&(i8.u54.p131==1)))||(i19.u225.p602==1))||(((i17.u67.p169==1)&&(i18.u160.p431==1))&&(i19.u174.p603==1)))||(i8.u146.p395==1))||(((i17.u72.p183==1)&&(i17.u157.p422==1))&&(i17.u228.p614==1)))||((i4.u37.p88==1)&&(i4.u38.p91==1)))||(i0.u34.p79==1))||(i5.u197.p534==1))||(((i17.u69.p199==1)&&(i17.u154.p417==1))&&(i17.u228.p611==1)))||(((i17.u68.p196==1)&&(i17.u158.p427==1))&&(i17.u216.p582==1)))||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u216.p582==1)))||(i19.u193.p525==1))||(i13.u126.p339==1))||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u212.p617==1)))||(i1.u222.p596==1))||(i2.u176.p471==1))||(i18.u99.p263==1))||(i13.u106.p279==1))||(i19.u171.p456==1)) U (((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0)))) * (i8.u150.p404==0)) * ((((((((((EG(((((i11.u16.p37==1)&&(i11.u121.p326==1))&&(i19.u174.p603==1))||(i0.u137.p364==1))) * (i7.i1.i2.u166.p448==0)) * (i5.u44.p102==0)) * (i12.u170.p495==0)) * (i1.u86.p218==0)) * (i2.u11.p25==0)) * (i14.u128.p345==0)) * (((i17.u71.p180==0)||(i17.u154.p417==0))||(i17.u213.p620==0))) * ((i7.i0.i1.u92.p237==1)||(i11.u118.p314==1))) * (((i14.u129.p344==1)||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u214.p635==1)))||(((i0.u33.p76==1)&&(i0.u165.p441==1))&&(i19.u174.p603==1)))) + (((A((((i17.u232.p622==1)||(i12.u172.p459==1))||(i17.u67.p174==1)) U (((i15.u61.p151==1)&&(i10.u112.p296==1))&&(i19.u174.p603==1))) * E(((i19.u203.p546==1)||(i19.u174.p566==1)) U ((((((((((i2.u20.p48==1)||(i5.u43.p101==1))||(i7.i0.i1.u2.p6==1))||(i1.u65.p164==1))||(((i17.u75.p190==1)&&(i17.u154.p417==1))&&(i17.u213.p620==1)))||(i1.u3.p9==1))||(i11.u18.p42==1))||(i12.u25.p58==1))||(i13.u106.p281==1))||(i2.u20.p47==1)))) * (((((((i19.u201.p543==1)||(i6.u60.p149==1))||(i10.u113.p303==1))||(i8.u52.p126==1))||(i0.u165.p440==1))||(((i17.u81.p205==1)&&(i17.u154.p417==1))&&(i17.u228.p611==1)))||((i17.u235.p627==1)&&(i17.u236.p630==1)))) * ((((((((((i4.u28.p65==1)||(i8.u151.p405==1))||(i1.u65.p164==1))||(i19.u187.p512==1))||(i14.u138.p370==1))||(i17.u73.p184==1))||(i12.u26.p61==1))||(i13.u106.p280==1))||(i11.u107.p283==1))||(((i0.u33.p76==1)&&(i0.u165.p441==1))&&(i19.u174.p603==1)))))) * (((i2.u15.p35==0)||(i10.u112.p297==0))||(i2.u177.p476==0))) * ((i17.u74.p187==0)||(i17.u217.p583==0))))
=> equivalent forward existential formula: ([FwdG(((((((((((((FwdU(Init,(!(!(EX(!(((((((((((((((((((((i17.u82.p206==0)||(i17.u83.p209==0))&&(i5.u8.p18==0))&&(i5.u199.p538==0))&&(i17.u214.p573==0))&&(((i14.u89.p226==0)||(i14.u128.p347==0))||(i14.u221.p591==0)))&&(i19.u209.p558==0))&&(i5.u48.p116==0))&&(i14.u138.p370==0))&&(i1.u65.p165==0))&&(i2.u177.p472==0))&&(i4.u27.p64==0))&&(i15.u64.p161==0))&&(i19.u192.p523==0))&&(i4.u36.p84==0))&&(i4.u10.p23==0))&&(i5.u45.p104==0))&&(i1.u86.p218==0))&&(i15.u5.p12==0))&&(i7.i0.i1.u92.p236==0)))))) + ((((((i7.i0.i1.u2.p4==0)&&(i12.u23.p54==0))&&(i4.u37.p89==0))&&(i5.u45.p105==0))&&(i15.u63.p159==0))&&(i6.u6.p15==0)))) * ((i17.u74.p187==0)||(i17.u217.p583==0))) * (((i2.u15.p35==0)||(i10.u112.p297==0))||(i2.u177.p476==0))) * (!(!((E(!((((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0))) U (!(((((((((((((((((((((((i10.u110.p289==1)||(i11.u107.p284==1))||(i7.i1.i2.u166.p444==1))||((i8.u53.p128==1)&&(i8.u54.p131==1)))||(i19.u225.p602==1))||(((i17.u67.p169==1)&&(i18.u160.p431==1))&&(i19.u174.p603==1)))||(i8.u146.p395==1))||(((i17.u72.p183==1)&&(i17.u157.p422==1))&&(i17.u228.p614==1)))||((i4.u37.p88==1)&&(i4.u38.p91==1)))||(i0.u34.p79==1))||(i5.u197.p534==1))||(((i17.u69.p199==1)&&(i17.u154.p417==1))&&(i17.u228.p611==1)))||(((i17.u68.p196==1)&&(i17.u158.p427==1))&&(i17.u216.p582==1)))||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u216.p582==1)))||(i19.u193.p525==1))||(i13.u126.p339==1))||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u212.p617==1)))||(i1.u222.p596==1))||(i2.u176.p471==1))||(i18.u99.p263==1))||(i13.u106.p279==1))||(i19.u171.p456==1))) * !((((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0))))) + EG(!((((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0))))))) * (i8.u150.p404==0))) * (((i14.u129.p344==1)||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u214.p635==1)))||(((i0.u33.p76==1)&&(i0.u165.p441==1))&&(i19.u174.p603==1)))) * ((i7.i0.i1.u92.p237==1)||(i11.u118.p314==1))) * (((i17.u71.p180==0)||(i17.u154.p417==0))||(i17.u213.p620==0))) * (i14.u128.p345==0)) * (i2.u11.p25==0)) * (i1.u86.p218==0)) * (i12.u170.p495==0)) * (i5.u44.p102==0)) * (i7.i1.i2.u166.p448==0)),((((i11.u16.p37==1)&&(i11.u121.p326==1))&&(i19.u174.p603==1))||(i0.u137.p364==1)))] != FALSE + [(FwdU(((((((FwdU(Init,(!(!(EX(!(((((((((((((((((((((i17.u82.p206==0)||(i17.u83.p209==0))&&(i5.u8.p18==0))&&(i5.u199.p538==0))&&(i17.u214.p573==0))&&(((i14.u89.p226==0)||(i14.u128.p347==0))||(i14.u221.p591==0)))&&(i19.u209.p558==0))&&(i5.u48.p116==0))&&(i14.u138.p370==0))&&(i1.u65.p165==0))&&(i2.u177.p472==0))&&(i4.u27.p64==0))&&(i15.u64.p161==0))&&(i19.u192.p523==0))&&(i4.u36.p84==0))&&(i4.u10.p23==0))&&(i5.u45.p104==0))&&(i1.u86.p218==0))&&(i15.u5.p12==0))&&(i7.i0.i1.u92.p236==0)))))) + ((((((i7.i0.i1.u2.p4==0)&&(i12.u23.p54==0))&&(i4.u37.p89==0))&&(i5.u45.p105==0))&&(i15.u63.p159==0))&&(i6.u6.p15==0)))) * ((i17.u74.p187==0)||(i17.u217.p583==0))) * (((i2.u15.p35==0)||(i10.u112.p297==0))||(i2.u177.p476==0))) * (!(!((E(!((((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0))) U (!(((((((((((((((((((((((i10.u110.p289==1)||(i11.u107.p284==1))||(i7.i1.i2.u166.p444==1))||((i8.u53.p128==1)&&(i8.u54.p131==1)))||(i19.u225.p602==1))||(((i17.u67.p169==1)&&(i18.u160.p431==1))&&(i19.u174.p603==1)))||(i8.u146.p395==1))||(((i17.u72.p183==1)&&(i17.u157.p422==1))&&(i17.u228.p614==1)))||((i4.u37.p88==1)&&(i4.u38.p91==1)))||(i0.u34.p79==1))||(i5.u197.p534==1))||(((i17.u69.p199==1)&&(i17.u154.p417==1))&&(i17.u228.p611==1)))||(((i17.u68.p196==1)&&(i17.u158.p427==1))&&(i17.u216.p582==1)))||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u216.p582==1)))||(i19.u193.p525==1))||(i13.u126.p339==1))||(((i17.u70.p214==1)&&(i17.u158.p427==1))&&(i17.u212.p617==1)))||(i1.u222.p596==1))||(i2.u176.p471==1))||(i18.u99.p263==1))||(i13.u106.p279==1))||(i19.u171.p456==1))) * !((((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0))))) + EG(!((((((((((((((i19.u225.p601==1)||(i4.u184.p502==1))||(i3.u135.p359==1))||(i11.u119.p323==1))||(i19.u180.p481==1))||(i8.u147.p398==1))||(i13.u123.p329==1))||(i19.u171.p456==1))&&(((i17.u70.p214==0)||(i17.u158.p427==0))||(i17.u234.p629==0)))&&(i19.u191.p521==0))&&(i5.u199.p538==0))&&(i0.u136.p365==0))&&(i14.u128.p345==0))))))) * (i8.u150.p404==0))) * ((((((((((i4.u28.p65==1)||(i8.u151.p405==1))||(i1.u65.p164==1))||(i19.u187.p512==1))||(i14.u138.p370==1))||(i17.u73.p184==1))||(i12.u26.p61==1))||(i13.u106.p280==1))||(i11.u107.p283==1))||(((i0.u33.p76==1)&&(i0.u165.p441==1))&&(i19.u174.p603==1)))) * (((((((i19.u201.p543==1)||(i6.u60.p149==1))||(i10.u113.p303==1))||(i8.u52.p126==1))||(i0.u165.p440==1))||(((i17.u81.p205==1)&&(i17.u154.p417==1))&&(i17.u228.p611==1)))||((i17.u235.p627==1)&&(i17.u236.p630==1)))) * !((E(!((((i15.u61.p151==1)&&(i10.u112.p296==1))&&(i19.u174.p603==1))) U (!((((i17.u232.p622==1)||(i12.u172.p459==1))||(i17.u67.p174==1))) * !((((i15.u61.p151==1)&&(i10.u112.p296==1))&&(i19.u174.p603==1))))) + EG(!((((i15.u61.p151==1)&&(i10.u112.p296==1))&&(i19.u174.p603==1))))))),((i19.u203.p546==1)||(i19.u174.p566==1))) * ((((((((((i2.u20.p48==1)||(i5.u43.p101==1))||(i7.i0.i1.u2.p6==1))||(i1.u65.p164==1))||(((i17.u75.p190==1)&&(i17.u154.p417==1))&&(i17.u213.p620==1)))||(i1.u3.p9==1))||(i11.u18.p42==1))||(i12.u25.p58==1))||(i13.u106.p281==1))||(i2.u20.p47==1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t30, t267, t382, t388, t402, i0.t373, i0.t203, i0.t145, i0.u33.t375, i0.u136.t204, i0.u165.t146, i1.t271, i1.u65.t312, i1.u86.t282, i1.u90.t274, i2.t416, i2.t414, i2.t401, i2.t396, i2.t118, i2.u14.t412, i2.u21.t399, i2.u182.t102, i2.u182.t104, i2.u15.t410, i2.u22.t397, i2.u176.t112, i2.u176.t117, i2.u177.t116, i3.t381, i3.t207, i3.u31.t379, i3.u134.t208, i4.t387, i4.t94, i4.u29.t383, i4.u28.t385, i4.u36.t369, i4.u184.t97, i5.t359, i5.t357, i5.t355, i5.t353, i5.t350, i5.u47.t346, i5.u49.t342, i5.u39.t348, i5.u39.t362, i6.t195, i6.u57.t328, i6.u59.t324, i6.u141.t196, i7.i0.i0.u94.t264, i7.i0.i1.u92.t270, i7.i0.i1.u96.t261, i7.i0.i2.t137, i7.i0.i2.u168.t138, i7.i1.i1.t149, i7.i1.i1.u163.t150, i7.i1.i2.t141, i7.i1.i2.u167.t142, i8.t181, i8.t177, i8.t173, i8.t169, i8.u51.t338, i8.u146.t182, i8.u148.t178, i8.u151.t174, i8.u153.t170, i9.t188, i9.u142.t191, i9.u145.t184, i9.u144.t189, i10.t258, i10.t252, i10.u112.t255, i10.u111.t259, i10.u114.t253, i11.t407, i11.t405, i11.t242, i11.t238, i11.u16.t409, i11.u117.t243, i11.u120.t239, i11.u121.t234, i12.t393, i12.t391, i12.u23.t395, i12.u170.t19, i12.u170.t48, i12.u170.t95, i12.u170.t99, i12.u170.t100, i12.u170.t101, i12.u170.t103, i12.u170.t107, i13.t231, i13.t227, i13.t223, i13.u122.t232, i13.u125.t228, i13.u127.t224, i14.t219, i14.t215, i14.t211, i14.t199, i14.u88.t278, i14.u128.t220, i14.u130.t216, i14.u132.t212, i14.u138.t200, i15.u61.t320, i15.u63.t316, i16.u55.t332, i17.t290, i17.t288, i17.t286, i17.t165, i17.t161, i17.t157, i17.u67.t294, i17.u67.t298, i17.u67.t302, i17.u67.t308, i17.u154.t166, i17.u157.t162, i17.u158.t158, i18.t153, i18.u160.t154, i19.t132, i19.t125, i19.t120, i19.t114, i19.t111, i19.t109, i19.t92, i19.t90, i19.t87, i19.t84, i19.t82, i19.t80, i19.t78, i19.t76, i19.t74, i19.t71, i19.t63, i19.t60, i19.t57, i19.t54, i19.t51, i19.t25, i19.t22, i19.t17, i19.t14, i19.u174.t37, i19.u174.t46, i19.u174.t68, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/350/161/547
Detected timeout of ITS tools.
[2021-05-11 21:05:04] [INFO ] Applying decomposition
[2021-05-11 21:05:04] [INFO ] Flatten gal took : 293 ms
[2021-05-11 21:05:04] [INFO ] Decomposing Gal with order
[2021-05-11 21:05:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 21:05:06] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-11 21:05:06] [INFO ] Flatten gal took : 257 ms
[2021-05-11 21:05:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 111 ms.
[2021-05-11 21:05:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11476942792710571358.gal : 13 ms
[2021-05-11 21:05:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14165653695964835774.ctl : 10 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/CTLFireability11476942792710571358.gal, -t, CGAL, -ctl, /tmp/CTLFireability14165653695964835774.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/CTLFireability11476942792710571358.gal -t CGAL -ctl /tmp/CTLFireability14165653695964835774.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 21:27:02] [INFO ] Flatten gal took : 315 ms
[2021-05-11 21:27:03] [INFO ] Input system was already deterministic with 548 transitions.
[2021-05-11 21:27:04] [INFO ] Transformed 603 places.
[2021-05-11 21:27:04] [INFO ] Transformed 548 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 21:27:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5532746531051402625.gal : 11 ms
[2021-05-11 21:27:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11498321335993847017.ctl : 23 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/CTLFireability5532746531051402625.gal, -t, CGAL, -ctl, /tmp/CTLFireability11498321335993847017.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/CTLFireability5532746531051402625.gal -t CGAL -ctl /tmp/CTLFireability11498321335993847017.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 11 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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ 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-16"
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-16, 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-162038143900442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;